Sciweavers

302 search results - page 41 / 61
» On Queues with Inter-Arrival Times Proportional to Service T...
Sort
View
PE
2008
Springer
114views Optimization» more  PE 2008»
13 years 7 months ago
Buffer overflow asymptotics for multiplexed regulated traffic
By characterizing the worst case profile, which maximizes the content of a buffer fed with leaky bucket regulated flows in packet telecommunication networks, we derive a tight upp...
Yu Ying, Fabrice Guillemin, Ravi Mazumdar, Catheri...
SIGMETRICS
2003
ACM
131views Hardware» more  SIGMETRICS 2003»
14 years 24 days ago
Classifying scheduling policies with respect to unfairness in an M/GI/1
It is common to evaluate scheduling policies based on their mean response times. Another important, but sometimes opposing, performance metric is a scheduling policy’s fairness....
Adam Wierman, Mor Harchol-Balter
CORR
2010
Springer
83views Education» more  CORR 2010»
13 years 7 months ago
Breaking the Legend: Maxmin Fairness notion is no longer effective
In this paper we analytically propose an alternative approach to achieve better fairness in scheduling mechanisms which could provide better quality of service particularly for re...
Yaser Miaji, Suhaidi Hassan
MASCOTS
1994
13 years 8 months ago
Xmgm: Performance Modeling Using Matrix Geometric Techniques
Over the last two decades a considerable amount of effort has been put in the development and application of matrix geometric techniques for the analysis of queueing systems of wh...
Boudewijn R. Haverkort, Aad P. A. van Moorsel, Dir...
ETT
2002
89views Education» more  ETT 2002»
13 years 7 months ago
Delay analysis of a probabilistic priority discipline
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...
Yuming Jiang, Chen-Khong Tham, Chi Chung Ko