Abstract
Multimedia applications require guaranteed QOS, which will be provided by multimedia networks, such as ATM, by resource reservation. The complexity of routing and allocating resources for ATM applications vary according with applications end-to-end constraints, and essentially range from P to NP complete problems (Wang et al (1995)). In this paper, we expand the class of known P type, constrained routing problems, by including two applications of significance in ATM, namely loss sensitive ABR traffic, and delay sensitive VBR traffic. For such routing problems, we present a O (N 4) polynomial time algorithm, prove its correctness, and illustrate its effectiveness with simulation experiments.
Chapter PDF
Similar content being viewed by others
References
Georgiadis, L., Guerin, R. and Penis, V. (1996) Efficient Network QoS Provisioning Based on per Node Traffic Shaping. INFOCOM96, vol. 1, 102–110.
Ling, T. and Shroff, N. (1996) Scheduling Real-Time Traffic in ATM Networks. INFOCOM96, vol. 1, 198–205.
Mascolo, S., Cavendish, D. and Gerla, M. (1996) ATM Rate Based Congestion Control Using a Smith Predictor: an EPRCA Implementation. INFOCOM’96, vol. 2, 569–576.
Wang, Z. and Crowcroft, J. (1995) Bandwidth-Delay Based Routing Algorithms. GLOBECOM 95, 2129–2133.
Various contributors (1994) PNNI Draft Specification. ATM Forum 94–0471R9.
Parekh, A. K. and Gallager, R. (1994) A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case. IEEE/ACM Transactions on Networking, Vol. 2, No. 2, 137–150.
Parekh, A. K. and Gallager, R. (1993) A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case. IEEE/ACM Transactions on Networking, Vol. 1, No. 3, 344–357.
Bassin, R. (1992) Approximation Schemes for the Restricted Shortest Path Problem. Mathematics of Operations Research, vol. 17, no. 1, 36–42.
Cormen, Leiserson and Rivest (1990) Introduction to Algorithms, McGraw-Hill.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Cavendish, D., Gerla, M. (1997). On Routing with QOS Constraints in ATM Networks. In: Tantawy, A. (eds) High Performance Networking VII. HPN 1997. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35279-4_10
Download citation
DOI: https://doi.org/10.1007/978-0-387-35279-4_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5401-8
Online ISBN: 978-0-387-35279-4
eBook Packages: Springer Book Archive