Abstract
Since ATM switches are intented to be simple and inexpensive, a significant part of the network cost is in the cost of the links. A way of increasing the traffic we can send over these expensive links is to transmit compressed ATM cells. This idea, although it seems very simple, is a new one for ATM and as we show it can signicantly increase the useful bandwidth of a typical ATM network. In this paper the CAC algorithm that can be effectively used in a network which uses this compression scheme is also described and the results that can be achieved when this algorithm is used in a real network are presented. This CAC algorithm is based on Large Deviation Theory: the large deviation rate-function (entropy) of compressed (and thus more bursty) ATM traffic can be estimated from measurements of trffic activity. The entropy can be used to determine the bandwidth requirement of the traffic.
Supported by a Marie Curie Research Training Grant under TMR activity 3.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
I. Papaefstathiou, Hardware implementation of a Gb/sec network compressor, White Paper, http://www.cl.cam.ac.uk/ip207/hard.ps.
I. Papaefstathiou, Accelerating ATM: On-line compression of ATM streams, 18th IEEE IPCCC’99, Phoenix, Arizona, 10–12 February 1999.
I. Papaefstathiou, Compressing ATM streams, IEEE Data Compression Conference 1999 (DCC’99), Utah, 29–31 March 1999.
I. Papaefstathiou, Complete Framework for low level, on-line ATM Compression, Submitted for publication, http://www.cl.cam.ac.uk/ ip207/comp.ps.
Andrew Moore and Simon Crosby, An experimental conguration for the evaluation of CAC algorithms, Performance Evaluation Review, Vol 27:3, December 1999.
Andrew Moore and Raymond Russell, Evaluation of a Practical Connection Admission Control for ATM Networks Based on On-line Measurements, in preparation, 1999.
Joseph Y. Hui, Resource Allocation for Broadband Networks, IEEE JSAC, 6(9):1598–1608, December 1988.
N.M. Mitrou and D.E. Pendarakis, Cell Level Statistical Multiplexing in ATM Networks: Analysis Dimensioning and Call Acceptance Control w.r.t QoS Criteria, In Broadband Technologies, New Jersey, October 1990.
James Appleton, Modelling a Connection Acceptance Strategy for ATM Networks, In Broadband Technologies, New Jersey, October 1990.
F.P. Kelly, Effective Bandwidths at Multi-Class Queues, Queueing Systems, 9:5–16, 1991.
R. Guerin and H. Ahmadi and Naghshineh, Equivalent Capacity and its application to bandwidth allocation in high speed networks, IEEE JSAC, 9:968–981, 1991.
C. Courcoubetis and G. Kesidis and A. Ridder and J. Walrand and R. Weber, Admission Control and Routing in ATM Networks using Inferences from Measured Bu er Occupancy, Technical Report, University of California, Berkeley, EECS Department, UCB, California, CA94720, 1991.
Simon Crosby and Ian Leslie and John Lewis and Raymond Russell and Fergal Toomey and Brian McGurk, Practical Connection Admission Control for ATM Networks Based on On-line Measurements, Computer Communications, January 1998.
N. G. Duffield and J. T. Lewis and Neil O’Connell and Raymond Russell and Fergal Toomey, The Entropy of an Arrivals Process: a Tool for Estimating QoS Parameters of ATM Traffic, Proceedings of the 11th UK Teletraffic Symposium, Cambridge, March 1994.
N.G. Duffield and J.T. Lewis and N. O’Connell and R. Russell and F. Toomey Entropy of ATM Traffic Streams, IEEE Journal on Selected Areas in Communications, Special issue on advances in the fundamentals of networking-part 1, 13(6), August 1995.
J. Ziv and A. Lempel, A Universal Algorithm for Sequential Data Compression, IEEE Trans. Information Theory, Vol IT-23, No 3, May 1978, pp 337–343.
Ecole Polytechnique Federale de Lausanne, Application REQUested IP over ATM, Technical Report, http://lrcwww.ep.ch/arequipa/, July 1997.
E. Fiala and D. Greeve, Data Compression with Finite Windows, Communications of the ACM, Vol 32, No 4, April 1989, pp 490–505.
National Institute of Standards and Technology, NIST ATM/HFC Network Simulator: Operation and Programming Guide, March 1995.
I. M. Leslie and D. R. McAuley, Fairisle: An ATM Network, Computer Communications Review, 21(4):327–336, September 1991.
V. Paxson and S. Floyd, Wide-Area Traffic: The Failure of Poisson Modeling, Proceedings ACM SIGCOMM 94, London, UK, August 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Papaefstathiou, I. (2000). Measurement Based Connection Admission Control Algorithm for ATM Networks that Use Low Level Compression. In: Delgado, J., Stamoulis, G.D., Mullery, A., Prevedourou, D., Start, K. (eds) Telecommunications and IT Convergence Towards Service E-volution. IS&N 2000. Lecture Notes in Computer Science, vol 1774. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46525-1_4
Download citation
DOI: https://doi.org/10.1007/3-540-46525-1_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67152-7
Online ISBN: 978-3-540-46525-6
eBook Packages: Springer Book Archive