This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Performability of an Algorithm for Connection Admission Control
July 2001 (vol. 50 no. 7)
pp. 724-733

Abstract—Connection admission control (CAC) in broadband, ATM-based telecommunication networks is a problem of recognized importance. Its solution calls for real-time algorithms that can accurately decide whether a connection request may be granted without compromising specified quality of service (QoS) requirements. We consider an algorithm for this purpose that accommodates variable bit rate (VBR) connections and is based on effective bandwidth computations. Arriving VBR traffic streams are assumed to be leaky-bucket regulated and are represented by worst-case, periodic, on-off, fluid sources that are randomly phased. Moreover, certain traffic classes may benefit from statistical multiplexing (S-VBR), while others may not (NS-VBR). We then evaluate the ability of such a CAC algorithm to perform in the presence of fluctuating channel capacity, where the performability variable $Y_T$ is the fraction of some specified busy period $T$ during which the quality of service requirement is violated. A general base model that supports $Y_T$ is then formulated and instances of the resulting performability model are constructed and solved using UltraSAN. In particular, the evaluation experiments reveal some interesting differences in how QoS degrades with respect to the control of S-VBR vs. NS-VBR traffic.

[1] Performance Evaluation and Design of Multiservice Networks, Final Report of the COST 224 Project, J.W. Roberts, ed., Commission of the European Communities, Luxembourg, 1992.
[2] J.Y. Hui, “Resource Allocation for Broadband Networks,” IEEE J. Selected Areas in Comm., pp. 1598-1608, June 1988.
[3] F.P. Kelly, “Effective Bandwidths at Multi-Class Queues,” Queueing Systems, vol. 9, pp. 5-16, 1991.
[4] A.I. Elwalid, D. Mitra, and R.H. Wentworth, “A New Approach for Allocating Buffers and Bandwidth to Heterogeneous, Regulated Traffic in an ATM Node,” IEEE J. Selected Areas in Comm., pp. 1115-1127, Aug. 1995.
[5] J.F. Meyer, S. Montagna, R. Paglino, and A. Puglisi, “Admission Control of Mixed VBR Sources in Broadband Networks,” int'l patent application no. PCT/IT 98/00373, 1998.
[6] J.F. Meyer, “Performability: A Retrospective and Some Pointers to the Future,” Performance Evaluation, vol. 14, nos. 3-4, pp. 139-156, Feb. 1992.
[7] J.F. Meyer, “Performability Evaluation: Where It Is and What Lies Ahead,” Proc. 1995 IEEE Int'l Computer Performance and Dependability Symp., pp. 334-343, Apr. 1995.
[8] W.H. Sanders, W.D. Obal II, M.A. Qureshi, and F.K. Widjanarko, “TheUltraSANModeling Environment,” Performance Evaluation, vol. 24, no. 1, pp. 89-115, 1995.
[9] J.F. Meyer, “Performability of Algorithms for Connection Admission Control,” Proc. Int'l Conf. Dependable Systems and Networks, pp. 181-190, June 2000.

Index Terms:
Broadband telecommunication networks, connection admission control (CAC), effective bandwidth, performability, variable bit rate (VBR) traffic.
Citation:
John F. Meyer, "Performability of an Algorithm for Connection Admission Control," IEEE Transactions on Computers, vol. 50, no. 7, pp. 724-733, July 2001, doi:10.1109/12.936238
Usage of this product signifies your acceptance of the Terms of Use.