Analysis of polling systems
The analysis of random polling systems
Operations Research
Queuing analysis of polling models
ACM Computing Surveys (CSUR)
IEEE/ACM Transactions on Networking (TON)
Determining end-to-end delay bounds in heterogeneous networks
Multimedia Systems - Special issue on the fifth workshop on network and operating system support for digital audio and video 1995 (NOSSDAV)
A closed form solution for the asymmetric random polling system with correlated Levy input process
Mathematics of Operations Research
Large deviations analysis of the generalized processor sharing policy
Queueing Systems: Theory and Applications
On the performance of generalized processor sharing servers under long-range dependent traffic
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Advances in modeling and engineering of Longe-Range dependent traffic
Finite buffer queue with generalized processor sharing and heavy-tailed input processes
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Advances in modeling and engineering of Longe-Range dependent traffic
Generalized processor sharing with light-tailed and heavy-tailed input
IEEE/ACM Transactions on Networking (TON)
Approximating Low Latency Queueing Buffer Latency
AICT '08 Proceedings of the 2008 Fourth Advanced International Conference on Telecommunications
Simulating the performance of a class-based weighted fair queueing system
Proceedings of the 40th Conference on Winter Simulation
Fundamentals of Queueing Theory
Fundamentals of Queueing Theory
Analysis of a two-class FCFS queueing system with interclass correlation
ASMTA'12 Proceedings of the 19th international conference on Analytical and Stochastic Modeling Techniques and Applications
| Hi-index | 0.00 |
This paper presents an approximating model for a 2-class weighted fair queueing (or random polling) model. The approximating system can be analyzed analytically to obtain mean performance measures such as expected delay. We show through a formal argument that the approximation works well when the overall utilization of the system @r is small. Based on simulation experiments, we develop a modified version of the approximation that is accurate for a wide range of @r. Finally, we extend the approximation to more complex queueing scenarios, such as the low-latency-queueing discipline and systems with more than 2 classes.