Adaptive bandwidth scheduling in B-ISDN
An important issue for providing guaranteed performance service is the suitable design of a critical component at switching nodes, the Bandwidth Scheduling Algorithm. B-ISDN traffic is heterogeneous unpredictable requiring varied qualities of service (QoS) in terms of delay, delay jitter, throughput and loss rate. The bandwidth scheduling algorithm must be designed in such a way that it can satisfy the individual QoS requirements for traffic streams.
In this paper, we address several issues involved in the analysis, design and implementation of bandwidth scheduling algorithms. We present a new framework, based on adaptive approach, for bandwidth scheduling algorithms that are sensitive to individual QoS requirements.
Unable to display preview. Download preview PDF.
- R.Cruz,“A Calculus for network delay, Part 1:Network elements in isolation”, IEEE Transaction of Information Theory, 37(1), 1991.Google Scholar
- D.Ferrari,“Client Requirements for Real-Time Communication Services”, IEEE Communication Magazine, Nov. 1990.Google Scholar
- D.Ferrari, D.Verma,“A Scheme for Real-Time Channel Establishment in Wide Area Networks”, IEEE J. on Selected Areas in Comm., Vol. 8, No.3, April 1990.Google Scholar
- H.D.Hoang,“Some Issues of Cell-Switching Nodes”, P&T Journal, No.1, 1996, VNPT.Google Scholar
- J.R.Jackson, “Queues with dynamic priority discipline”, Management Science Journal, Vol. 8(1), 1961.Google Scholar
- R.Jain,“Congestion Control and Traffic Management in ATM Networks: Recent Advances and A Survey”, Computer Networks & ISDN System Journal, Oct. 1996.Google Scholar
- A.Parekh,G.Gallager,“A Generalized Processor Sharing Approach to flow control in Integrated service Networks:The single node case”, Proc. of INFOCOM'92,Vol. 2,May 1992.Google Scholar
- J.Ren,J.Mark,J.Wong,“A dynamic priority queueing approach to traffic regulation and scheduling in B-ISDN”,Proc. of GLOBECOM'94.Google Scholar