Abstract
Consider the processor sharing node (PSN) of Figure 3.1 which is, for our purposes, a switch output port as well. A PSN consists of a bank of synchronized, discrete-time FIFO queues sharing an output link with a service capacity of one cell per unit time (c cells/s). Let N be the number of FIFO queues that have bandwidth guarantees, e.g., FIFO queues handling CBR or VBR traffic.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Discussion and References
L. Zhang. VirtualClock: A new traffic control algorithm for packet-switched networks. ACM. Trans. Comp. Sys., Vol. 9, No. 2:pp. 101–124, May 1991.
S.J. Golestani. A self-clocked fair queueing scheme for broadband applications. In IEEE INFOCOM Proc., pages 636–646, 1994.
J.W. Roberts. Virtual spacing for flexible traffic control. International Journal of Communication Systems, Vol. 7:pages 307–318, 1994.
H. Zhang and S. Keshay. Comparison of rate-based service disciplines. In Proc. ACM SIGCOMM, pages 2–12, 1993.
C.R. Kalmanek, H. Kanakia, and S. Keshay. Rate controlled servers for very high-speed networks. In Proc. IEEE Globecom, 1990.
R.L. Cruz. Service burstiness and dynamic burstiness measures: a framework. J. High-Speed Networks, Vol. 1, No. 2:pages 105–127, 1992.
A. Hung and G. Kesidis. Bandwidth scheduling for wide-area ATM networks using virtual finishing times. IEEE/ACM Trans. Networking, Vol. 4, No. 1:pp. 49–54, Feb. 1996.
H. Ohsaki, M. Murata, H. Suzuki, C. Ikeda, and H. Miyahara. Rate-based congestion control for ATM networks. ACM SIGCOMM, Computer Communication Review,pages pages 60–72, 1995.
N.R. Figueira and J. Pasquale. An upper bound on delay for the VirtualClock service discipline. IEEE/ACM Trans. Networking, Vol. 3, No. 4:pages 399–408, Aug. 1995.
G.G. Xie and S.S. Lam. Delay guarantee of Virtual Clock server. IEEE/ACM Trans. Networking, Vol. 3, No. 6:pages 683–689, Dec. 1995.
R. Cruz. Quality of service guarantees in virtual circuit switched networks. IEEE JSAC, Vol. 13, No. 6:pages 10481056, Aug. 1995.
H. Zhang. Service disciplines for guaranteed performance service in packet-switching networks. Proc. of the IEEE, Vol. 83, No. 10, Oct. 1995.
G. de Veciana and G. Kesidis. Bandwidth allocation for multiple qualities of service using generalized processor sharing. IEEE Trans. Info. Th., Vol. 42, No. 1:pp. 268–271, Jan. 1996.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kesidis, G. (1996). Bandwidth Scheduling for a Single Node. In: ATM Network Performance. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-4568-9_3
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4568-9_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4570-2
Online ISBN: 978-1-4757-4568-9
eBook Packages: Springer Book Archive