Abstract
Generalized Processor Sharing (GPS) is realized as the most important ideal fluid scheduling discipline in guaranteed QoS networks. The well-known problem of GPS-based rate-proportional servers is the bandwidth delay coupling which leads to inefficient resource utilization. In this paper we introduce the concept of non rate-proportional (or arbitrary) weighting of sessions in GPS systems. Such an approach in a GPS node of network constrained by leaky buckets can handle bandwidth and delay parameters independently, thus allowing better utilization of network resources. Moreover, we show that even under the traditional bandwidth delay coupled system (rate-proportional weighting) it is possible to determine tighter delay bounds of sessions than that of presented in earlier papers. A numerically inexpensive algorithm, which works in any arbitrary weighted GPS system is also presented for computing delay bounds. Besides the analytical work numerical examples are also shown.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J.C.R. Bennett and H. Zhang. Hierarchical packet fair queueing algorithms. In Proceedings ACM SIGCOMM’96, pages 143–156, August 1996.
D. Clark, S. Shenker, and L. Zhang. Supporting real-time applications in an integrated services packet network: Architetcture and mechanism. In Proceedings of ACM SIGCOMM’92, pages 14–26, Baltimore, Maryland, August 1992.
Alan Demers, Srinivasan Keshav, and Scott Shenker. Analysis and simulation of a fair queueing algorithm. In SIGCOMM Symposium on Communications Architectures and Protocols, pages 1–12, Austin, Texas, September 1989. ACM. also in Computer Communications Review, 19 (4), Sept. 1989.
L. Kleinrock. Queueing Systems, Volume 2: Computer Applications. Wiley, 1976.
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, 1(3):344–357, June 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, 2(2):137–150, April 1994.
H. Zhang. Service disciplines for guaranteed performance service in packet-switching networks. In Proceedings of the IEEE, 83(10), October 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szabó, R., Barta, P., Németh, F., Bíró, j. (2000). Worst-Case Deterministic Delay Bounds for Arbitrary Weighted Generalized Processor Sharing Schedulers. In: Pujolle, G., Perros, H., Fdida, S., Körner, U., Stavrakakis, I. (eds) Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks. NETWORKING 2000. Lecture Notes in Computer Science, vol 1815. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45551-5_61
Download citation
DOI: https://doi.org/10.1007/3-540-45551-5_61
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67506-8
Online ISBN: 978-3-540-45551-6
eBook Packages: Springer Book Archive