Performance evaluation of OpenFlow-based software-defined networks based on queueing model

B Xiong, K Yang, J Zhao, W Li, K Li - Computer Networks, 2016 - Elsevier
OpenFlow is one of the most famous protocols for controller-to-switch communications in
software-defined networking (SDN), commonly seen as a promising way towards future …

Mathematical tools and methods for analysis of SDN: A comprehensive survey

L Girish, SKN Rao - 2016 2nd International Conference on …, 2016 - ieeexplore.ieee.org
Software defined Networking (SDN) is one of the developing networking technologies which
is attracting extreme interest from both industry and research groups. SDN's application is …

Parallel implementation of Bouvka's minimum spanning tree algorithm

S Chung, A Condon - Proceedings of International Conference …, 1996 - ieeexplore.ieee.org
We study parallel algorithms for the minimum spanning tree problem, based on the
sequential algorithm of O. Boruvka (1926). The target architectures for our algorithm are …

Opportunistic piggyback marking for IP traceback

L Cheng, DM Divakaran, WY Lim… - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
IP traceback is a solution for attributing cyber attacks, and it is also useful for accounting user
traffic and network diagnosis. Marking-based traceback (MBT) has been considered a …

On priority queues with priority jumps

T Maertens, J Walraevens, H Bruneel - Performance Evaluation, 2006 - Elsevier
In this paper, we investigate a simplified head-of-the-line with priority jumps (HOL-PJ)
scheduling discipline. Therefore, we consider a discrete-time single-server queueing system …

Leveraging frame aggregation for estimating WiFi available bandwidth

L Song, A Striegel - 2017 14th Annual IEEE International …, 2017 - ieeexplore.ieee.org
WiFi has emerged as a pivotal technology for mobile devices offering the potential for
exceptional connectivity speeds. Unfortunately, the performance of WiFi may vary …

Discrete-time queueing models with priorities

J Walraevens - 2004 - biblio.ugent.be
This PhD-dissertation contains analyses of several discrete-time two-class priority queueing
systems. We analyze non-preemptive, preemptive resume as well as preemptive repeat …

Discrete-time GeoX/G/1 queue with preemptive resume priority

Y Lee - Mathematical and Computer Modelling, 2001 - Elsevier
This paper considers a GeoX/G/1 queue with preemptive resume priority. Service times of
messages of each priority class are iid according to a general distribution function that may …

[HTML][HTML] Delay analysis of multiclass queues with correlated train arrivals and a hybrid priority/FIFO scheduling discipline

J Walraevens, H Bruneel, D Fiems… - Applied Mathematical …, 2017 - Elsevier
We analyze the delay experienced in a discrete-time priority queue with a train-arrival
process. An infinite user population is considered. Each user occasionally sends packets in …

A performance analysis of a discrete-time priority queueing system with correlated arrivals

MM Ali, X Song - Performance Evaluation, 2004 - Elsevier
We present performance analysis of a discrete-time system with two priority queues and
correlated arrivals. The arrival process to each priority queue consists of the superposition of …