Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Queueing Systems: Theory and Applications
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Performance and stability of communication networks via robust exponential bounds
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
Large Deviations and the Generalized Process Sharing Schedulin: Upper and Lower Bounds, Part I, Two Queue Systems
Bounds, Approximations & Applications for a Two-Queue GPS System
Bounds, Approximations & Applications for a Two-Queue GPS System
Statistical analysis of the generalized processor sharing scheduling discipline
IEEE Journal on Selected Areas in Communications
Large deviations and the generalized processor sharing scheduling for a two-queue system
Queueing Systems: Theory and Applications
Large deviations and the generalized processor sharing scheduling for a multiple-queue system
Queueing Systems: Theory and Applications
Tail probabilities of low-priority waiting times and queue lengths in {MAP}/{GI}/1 queues
Queueing Systems: Theory and Applications
An analytical model for generalized processor sharing scheduling with heterogeneous network traffic
Proceedings of the 2007 ACM symposium on Applied computing
Performance analysis of an integrated scheduling scheme in the presence of bursty MMPP traffic
Journal of Systems and Software
Hi-index | 0.00 |
In this paper we study the performance of a multiplexer using the Generalized Processor Sharing (GPS) scheduling to serve Markov Modulated Fluid Sources (MMFSs). We focus on a two-queue GPS system serving two classes of sources. By using a bounding approach combined with an approximation approach and by taking advantage of the specific structure of MMFSs, we are able to derive a lower bound and an upper bound approximation on queue length distributions for each class of the GPS system. Numerical investigations show that the lower bound and the upper bound approximation are very accurate. Hence our work greatly improves the earlier results on GPS scheduling in [15, 17] which are obtained for a more general stochastic model. Application of our performance bounds to call admission control and bandwidth sharing is also illustrated, and a comparison with FIFO and strict priority in different scenarios is presented. We show that the flexibility provided by GPS does not provide much better performance than FIFO and priority when the classes only have loss requirements. However, this flexibility provides better performance when the classes exhibit delay requirements as well as loss requirements.