IEEE/ACM Transactions on Networking (TON)
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing algorithms for packet-switched networks
IEEE/ACM Transactions on Networking (TON)
The busy period in the fluid queue
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Tail Asymptotics for the Busy Period in the GI/G/1 Queue
Mathematics of Operations Research
On a reduced load equivalence for fluid queues under subexponentiality
Queueing Systems: Theory and Applications
Scheduling strategies and long-range dependence
Queueing Systems: Theory and Applications
Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
User-level performance of elastic traffic in a differentiated-services environment
Performance Evaluation
Sample-path large deviations for generalized processor sharing queues with Gaussian inputs
Performance Evaluation - Long range dependence and heavy tail distributions
A sample path relation for the sojourn times in G/G/1-PS systems and its applications
Queueing Systems: Theory and Applications
GPS scheduling: selection of optimal weights and comparison with strict priorities
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
ACM SIGMETRICS Performance Evaluation Review
On the stability of the multi-queue multi-server processor sharing with limited service
Queueing Systems: Theory and Applications
Computers and Operations Research
Hi-index | 0.00 |
We consider networks where traffic is served according to the Generalised Processor Sharing (GPS) principle. GPS-based scheduling algorithms are considered important for providing differentiated quality of service in integrated-services networks. We are interested in the workload of a particular flow i at the bottleneck node on its path. Flow i is assumed to have long-tailed traffic characteristics. We distinguish between two traffic scenarios, (i) flow i generates instantaneous traffic bursts and (ii) flow i generates traffic according to an on/off process. In addition, we consider two configurations of feed-forward networks. First we focus on the situation where other flows join the path of flow i. Then we extend the model by adding flows which can branch off at any node, with cross traffic as a special case. We prove that under certain conditions the tail behaviour of the workload distribution of flow i is equivalent to that in a two-node tandem network where flow i is served in isolation at constant rates. These rates only depend on the traffic characteristics of the other flows through their average rates. This means that the results do not rely on any specific assumptions regarding the traffic processes of the other flows. In particular, flow i is not affected by excessive activity of flows with ‘heavier-tailed’ traffic characteristics. This confirms that GPS has the potential to protect individual flows against extreme behaviour of other flows, while obtaining substantial multiplexing gains.