Abstract
The Generalized Processor Sharing (GPS) schedulingdiscipline is an important scheduling mechanism that can support both class isolation and bandwidth sharing among different service classes, thus making itan appealing choice for networks providing multiple services with Quality-of-Service guarantees. In this paper, we study a broad classof GPS networks known as Consistent Relative Session Treatment}(CRST) GPS networks and establish closed-form end-to-end performance boundsfor CRST GPS networks. This result generalizes the results of Parekhand Gallager (1994) where simple, closed-form end-to-end performancebounds are derived for a special sub-class of CRST GPS networks, theso-called Rate Proportional Processor Sharing (RPPS) GPS networks, but performance bounds for the general CRST GPS networks do not haveclosed-form. Our result is obtained through the notion of CRSTpartition, which in fact yields a broader class of CRST GPS networksthan the one originally defined in (Parekh and Gallager, 1993). Moreover,our approach is quite general. It not only applies to the deterministicanalysis of GPS networks, but can also be employed in the study of GPSnetworks in a stochastic setting.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. Chang, “Stability, queue length, and delay of deterministic and stochastic queueing networks,” IEEE Transactions on Automatic Control, vol. 39, no.5, pp. 913–931, 1994.
D.D. Clark, S. Shenker, and L. Zhang, “Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism,” in Proc. ACM SIGCOMM, 1992.
R.L. Cruz, “A calculus for network delay, Part I: Network elements in isolation,” IEEE Transactions on Information Theory, vol. 37, no.1, pp. 114–131, 1991.
R.L. Cruz, “Quality of service guarantees in virtual circuit switched networks,” IEEE Journal on Selected Areas in Communications, vol. 13, no.6, pp. 1048–1056, 1995.
R.L. Cruz, and H. Liu, “End-to-end queueing delay in ATM networks,” Journal of High Speed Networks, vol. 3, no.4, pp. 413–427, 1994.
A. Demers, S. Keshav, and S. Shenker, “Analysis and Simulation of a Fair Queueing Algorithm,” in Proceedings of Sigcomm’89: Communication Architectures and Protocols, Austin, TX, 1989, pp. 1–12.
S.J. Golestani, “Network delay analysis of a class of fair queueing algorithms,” IEEE Journal on Selected Areas in Communications, vol. 13, no.6, pp. 1057–1070, 1995.
A.K. Parekh and R.G. Gallager, “A generalized processor sharing approach to flow control in integrated services networks—The single node case,” IEEE/ACM Transactions on Networking, vol. 1, no.3, pp. 344–357, 1993.
A.K. Parekh and R.G. Gallager, “A generalized processor sharing approach to flow control in integrated services networks—The multiple node case,” IEEE/ACM Transactions on Networking, vol. 2, no.2, pp. 137–150, 1994.
J.S. Turner, “New directions in communications (or which way to the information age?),” IEEE Communications Magazine, vol. 24, no.10, pp. 8–15, 1986.
O. Yaron and M. Sidi, “Generalized Processor Sharing Networks with Exponentially Bounded Burstiness Arrivals,” in Proc. IEEE INFOCOM, 1994.
Z.-L. Zhang, “End-to-End Support for Statistical Guarantees in Multimedia Networks,” Ph.D. Thesis, Computer Science Department, University of Massachusetts at Amherst, 1996. Available from http:// www.cs.umn.edu/~zhzhang/papers.html.
Z.-L. Zhang, D. Towsley, and J. Kurose, “Statistical analysis of the generalized processor sharing scheduling discipline,” IEEE Journal of Selected Areas in Communications, vol. 13, no.6, pp. 1071–1080, 1995.
Z.-L. Zhang, Z. Liu, J. Kurose, and D. Towsley, “Call admission control schemes under the generalized processor sharing scheduling discipline,” Telecommunication Systems, vol. 7, pp. 125–152, 1997.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zhang, ZL., Liu, Z. & Towsley, D. Closed-Form Deterministic End-to-End Performance Bounds for the Generalized Processor Sharing Scheduling Discipline. Journal of Combinatorial Optimization 1, 457–481 (1998). https://doi.org/10.1023/A:1009707231276
Issue Date:
DOI: https://doi.org/10.1023/A:1009707231276