A dynamic call admission scheme for VBR traffic in ATM networks

The role of call admission control (CAC) in high-speed networks is to maintain the network utilization at a high level, while ensuring that the quality of service (QoS) requirements of the individual calls are met. We use the term static CAC to describe schemes that always allocate the same bandwidth to a specific group of multiplexed calls, independent of the other traffic sharing the link. Dynamic CAC, on the other hand, denotes a scheme in which the bandwidth allocation to a group of calls sharing a queue is influenced by the traffic in other queues destined for the same outgoing link. We propose a generic dynamic call admission scheme for VBR and ABR traffic whose aim is to reduce the blocking rate for VBR calls at the expense of a higher blocking rate for ABR calls. Our scheme is generic because it builds up on a pre-existing static scheme, e.g., one based on a simple notion of effective bandwidth. Our simple approach results in a significant reduction of the blocking rate for VBR traffic (several orders of magnitude), if the bandwidth requirements of a single call are a reasonably small fraction of the link capacity. At the same time, the deterioration of service for ABR traffic can be contained.

[1]  Pawel Gburzynski,et al.  A regression approach to equivalent bandwidth characterization in ATM networks , 1997, Proceedings Fifth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[2]  W. Richard Stevens,et al.  TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms , 1997, RFC.

[3]  Raj Jain,et al.  Performance and Buffering Requirements of Internet Protocols over ATM ABR and UBR Services , 1998, IEEE Commun. Mag..

[4]  Dan Grossman,et al.  Multiprotocol Encapsulation over ATM Adaptation Layer 5 , 1993, RFC.

[5]  Per Gunningberg,et al.  How a large ATM MTU causes deadlocks in TCP data transfers , 1995, TNET.

[6]  Robert Morris,et al.  Impact of ATM switching and flow control on TCP performance: measurements on an experimental switch , 1995, Proceedings of GLOBECOM '95.

[7]  Hui Zhang,et al.  Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.

[8]  D. Mitra,et al.  Stochastic theory of a data-handling system with multiple sources , 1982, The Bell System Technical Journal.

[9]  Raj Jain,et al.  UBR+: improving performance of TCP over ATM-UBR service , 1997, Proceedings of ICC'97 - International Conference on Communications.

[10]  Pawel Gburzynski,et al.  Equivalent bandwidth characterization for real-time CAC in ATM networks , 1998, J. High Speed Networks.

[11]  S. Ramaswamy,et al.  An Adaptive Feedback Control Based Cell Scheduler for ATM Networks , 2000 .

[12]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[13]  Robert T. Braden,et al.  Requirements for Internet Hosts - Communication Layers , 1989, RFC.

[14]  Sally Floyd,et al.  Dynamics of TCP Traffic over ATM Networks , 1995, IEEE J. Sel. Areas Commun..

[15]  T. V. Lakshman,et al.  The drop from front strategy in TCP and in TCP over ATM , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[16]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

[17]  Kiran M. Rege,et al.  Equivalent bandwidth and related admission criteria for ATM systems—a performance study , 1994 .