Abstract
ATM networks are supposed to transport all sorts of information covering voice and video with a wide variety of coding schemes and bandwidth requirements, and a wide spectrum of data from low-rate interactive applications through LAN/MAN interconnection up to high resolution animation graphics and graphics data base browsing. Despite many proposals made to date, some problems remain in providing a resource allocation and congestion control scheme suitable for all these services, particularly those with high peak bit rate or unpredictable burstiness.
In this paper we examine some of the resource allocation techniques currently under discussion in the literature from the point of view of carrying packet data services. Not only is the traffic handling performance studied but we also compare the complexity and cost of their implementations.
The proposed techniques fall into three categories: 1 - connection level bandwidth allocation, 2 - burst level bandwidth allocation and 3 - burst level buffer allocation. These particular techniques demonstrate a trade-off between the traffic performance and the complexity of implementation. From the efficiency of traffic handling point of view it is shown that the three techniques have their own areas of efficiency; namely the techniques 1, 2 and 3 are efficient when the access bit rate is restricted respectively to a small, modest or large proportion of the network trunk bit rates.
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
Boyer and Tranchier, A reservation principle with application to the ATM traffic control, Computer Networks and ISDN Systems 24 (1992) 321–334.
Doshi, Performance of in-call buffer window reservation/allocation scheme for short intermittent file transfers over broadband packet notworks, Preprint
Doshi and Heffes, Performance of an in-call buffer window reservation/allocation scheme for long file transfers, IEEE J. on Selected Areas in Commun., Vol. 9, No. 7, Sep 1991.
Doshi and Heffes, Overload performance of an adaptive, buffer-window allocation scheme for a class of high speed networks, in Teletraffic and Datatraffic in a Period of Change, Jensen and Iversen (eds.), pp 441–446, Elsevier, 1991. (proc. ITC13, Copenhagen, June 1991).
W. Fischer, E.-H. Goeldner, N. Huang: The Evolution from LAN/MAN to Broadband ISDN. Proc. ICC ’91, paper 39. 3, Denver, Co., June 1991.
Hahne, Kalmanek and Morgan, Fairness and congestion control an a large ATM data network with dynamically adjustable windows, in Teletraffic and Datatraffic in a Period of Change, Jensen and Iversen (eds.), pp 867–872, Elsevier, 1991. (proc. ITC13, Copenhagen, June 1991).
Kalmanek, Kanakia and Keshav, Rate controlled servers for very high-speed networks, Proc. GLOBECOM 90, Dec. 1990, pp 12–20
Mitra, Mitrani, Ramakrishnan, Sery, and Weiss, A unified set of proposals for control and design of high speed data networks, Proc. 7th ITC Specialist Seminar, paper 12. 4, Morristown, New Jersey, Oct 1990.
E. Wallmeier, A connection acceptance algorithm for ATM networks based on mean and peak bit rates, Int. J. of Digital and Analog Commun. Systems, vol. 3, pp 143–153 (1990).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Worster, T., Fischer, W., Davis, S.P. (1993). Resource Allocation for Packet Data Traffic on ATM: Problems and Solutions. In: Gerner, N., Hegering, HG., Swoboda, J. (eds) Kommunikation in Verteilten Systemen. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78091-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-78091-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56482-9
Online ISBN: 978-3-642-78091-2
eBook Packages: Springer Book Archive