Abstract
In this paper the utilisation of the Probability of Congestion (PC) as a bandwidth allocation decision parameter is presented. We assume short buffers at the switch nodes to cope with cell level multiplexation contention (“bufferless” environments). Therefore, delay and cell delay variations are strongly bounded. Moreover, the Cell Loss Ratio (CLR) becomes the critical performance parameter. The validity of PC utilisation is compared with quality of service parameters in bufferless environments. The convolution algorithm is an accurate approach for Connection Admission Control (CAC) in ATM networks with small buffers. However, the convolution approach has a considerable computation cost, in terms of calculation and memory. To overcome these drawbacks, a new method of evaluation is proposed and analysed: the Enhanced Convolution Approach (ECA). In complex scenarios, with ECA, PC calculation can be carried out in real time while maintaining the desired accuracy. Several experiments have been carried out to compare the demanded bandwidth evaluated by: analytical methods, simulations and measurements in actual ATM switches. The main contribution of this paper is the proposal and analysis of ECA to the PC-evaluation for use in CAC schemes
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35388-3_42
Chapter PDF
References
Ash, R. (1969). Basic Probability Theory. John Wiley & Sons.
Bolla, R. Davoli, F. and Marchese, M. (1997) Bandwidth Allocation and Admission Control in ATM Networks With Service Separation. IEEE Comunications Magazine. Vol 35 No. 5 130–137.
Castelli, P. Cavallero, E. And Tonietti, A. (1991) Policing And Call Admission
Problems in ATM Networks. Teletraffic and Datatraffic, ITC-13 847–852. Del. 122 (1991). Progress Report on the CAC and Policing Experiments. COST.
Decina, M. And Toniatti, T. (1992) Bandwidth Allocation and Selective Discarding for VBRV and Bursty Data Calls in ATM Networks. International Journal of Digital and Analog Communications Systems.
Marzo, J.L. Domingo, J. Fabregat, R. and Sole-Pareta, J. (1995) Dynamic Routing Based on a Single Parameter: Link Congestion Probability. High Performance Networking VI. IFIP. Chapman & Hall. 307–318
Gallasi, G. Rigolio, G. and Fratta, L. (1989). ATM: Bandwidth Assignment and Bandwidth Enforcement Policies. Globecom 89.
Guerin, R. Ahmadi, H. and Naghshineh, M. (1991) Equivalent Capacity and its Application to Bandwidth Allocation in High-Speed Networks. IEEE Journal On Selected Areas In Communications, Vol 9, N7, 968–98.
Hogg, R. Allen, V. And Craig T. (1989) Introduction to Mathematical Statistics. Maxwell MacMillan Int Ed.
Handel, R. Huber, M. N. And Schroder, S. (1994) ATM Networks. Concepts, Protocols and Applications. Addison-Wesley.
Hee-Jeon, Y. and Viniotis, I. (1993) Feasibility of Performance Objectives in ATM Network Nodes with MMPP Arrival Processes. Modeling and Performance Evaluation Of ATM Technology (C-15). 119–134.
Hui, J. Y. (1988) Resource Allocation for Broadband Networks. IEEE Journal on Selected Areas in Communications, Vol 6 N 9, 1598–1608.
Iversen, V.B. and Yun Liu. (1990) The Performance of Convolution Algorithms for Evaluating the Total Load in an ISDN System. Ninth Nordic Teletraffic Seminar, Norway.
Iversen, V.B. and Bohn-Nielsen, A. (1991) Statistical Multiplexing In ATM-Networks. RACE 1022.
Kaltenmorgen, B. (1992) FIDBP. Connection Acceptance Control. BAF-ProjectFIDBP-92301-Cd-Cc/A.
Kleinvewillinghdfer-Kopp, R. and Kaltenmorgen, B. (1991) Connection Acceptance Control In ATM Networks. Studie des Forschunginstitus der DBP Telekom, Forschungsbereich 5 ‘Vermittlung and Netze’
Kroner, H. (1990) Algorithms For Call Acceptance Control Published At ICC’89Basic Propierties And Preliminary Study. RACE 1022. UST_123_026_CD_CC.
Kuhn, P.J. (1994). Performance Modelling and Traffic Engineering For Broadband Communication Networks. North Holland Broadband Comm.
Marzo, J.L. Fabregat, R. Domingo, J. and Sole-Pareta, J. (1993). Fast Calculation Of The Cac Convolution Algorithm Using The Multinomial Distribution Function. UK TT Symposium. Performance Engineering In Telecommunications Networks. BT Laboratories Ipswich UK.
Miah, B. and Scharf, E. (1994) A Real Time Management System for the Two-Level CAC Algorithm. 11 UK Teletraffic Symposium. Cambridge.
Miyao, Y. (1993) Bandwidth Allocation in ATM Networks that Guarantee Multiple QOS Requirements. ICC93, 1398–1403.
Ohta, S. and Sato, K. I. (1992) Dynamic Bandwidth Control of the Virtual Path in an Asynchronous Transfer Mode Network IEEE Transaction on Communications, Vol. 40, N°. 7.
R1022. (1990) Updated Results of Traffic Simulation of the Policing Experiment. Technology For ATD.
Race 2061 (1994) Exploit, Results Of Experiments On Traffic Control Using Real Aplications. Deliverable 28.
Ramalho, M. F. and Scharf, E. (1994). Fuzzy Logic Based Techniques for CAC in ATM Networks. 11 UK Teletraffic Symposium. Cambridge.
Saito, H. (1992) CAC in an ATM Network using Upper Bound of Cell Loss Probability. IEEE Transactions on Communications. 40, 1512–1521.
Wright, D. J. and Michael T. (1989) A Characterization of Telecommunication Services in the 1990’s. Infocom 89. 624–631.
Yang, T. and Li, H. (1993) Individual Cell Loss Probabilities and Backgroung Effects in ATM Networks. IEEE ICC33, 1373–1379.
Yang, T. and Tsang, H. K. (1995). A Novel Approach to Estimating the CLP in an ATM Multiplexer Loaded with Homogeneous On-Off Sources. IEEE Transaction on Communications.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Marzo, J.L., Domingo-Pascual, J., Fabregat, R., Solé-Pareta, J. (1998). Enhanced Convolution Approach for Connection Admission Control in ATM Networks. In: van As, H.R. (eds) High Performance Networking. HPN 1998. IFIP — The International Federation for Information Processing, vol 8. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35388-3_10
Download citation
DOI: https://doi.org/10.1007/978-0-387-35388-3_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5397-4
Online ISBN: 978-0-387-35388-3
eBook Packages: Springer Book Archive