Abstract
Asynchronous Transfer Mode (ATM) has been adopted by CCITT as the transport mode for B-ISDN. There are various performance issues that need to be resolved before B-ISDN networks can become a reality. In this paper, some of the performance issues in routing in ATM networks are addressed and the applicability of the routing concepts developed for today’s low bandwidth public and commercial communicatior s networks to B-ISDN networks is discussed.
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
CCITT Study Group XVIII, “ATM Layer Specification for B-ISDN,” Draft Recommendation 1.361, Geneva, Switzerland, January 1990.
CCITT Study Group XVIII, Report R-34, Geneva, Switzerland, June 1990.
J. J. G.-L.-Aceveres, “A New Minimum-Hop Routing Algorithm,” INFOCOM’ 87, pp. 170–180, 1987.
J. M. Akinpelu, “The Overload Performance of Engineered Networks with Nonhierarchical and Hierarchical Routing,” BSTJ, vol. 63, no. 7, pp. 1261–1281, September 1984.
G. R. Ash, A. H. Kafker and K. R. Krishnan, “Servicing and Real-Time Control of Networks with Dynamic Routing,” BSTJ, vol. 60, no. 8, pp. 1821–1845, October 1981.
G. R. Ash, R. H. Cardwell and R. P. Murray, “Design and Optimization of Networks with Dynamic Routing,” BSTJ, vol. 60, no. 8, pp. 1787–1820, October 1981.
G. R. Ash, J.-S. Chen, A. E. Frey and B. D. Huang, “Real Time Network Routing in a Dynamic Class-Of-Service Network,” ITC-13, pp. 187–194, 1991.
A. Bar-Noy and M. Gopal, “Topology Distribution Cost vs Efficient Routing in Large Networks”, Proc. SIGCOMM’90, 242–252, 1990.
C. G. Cassandras, M. H. Kallmes and D. Towsley, “Optimal Routing and Flow Control in Networks with Real Time Traffic”, INFOCOM’ 89, pp. 784–791, 1989.
P. Chemouil, M. Lebourges and P. Gauthier, “Performance Evaluation of Adaptive Traffic Routing in a Metropolitan Network: A Case Study,” GLOBECOM’ 89, pp. 314–318, 1989.
E.W. Dijkstra, “A Note on Two Problems in Connection with Graphs”, Numer. Math., 1, 269–271, 1959.
A. E. Economides, P. A. Ioannou and J. A. Silvester, “Decentralized Adaptive Routing for Virtual Circuit Networks Using Stochastic Learning Automata,” INFOCOM’ 88, pp. 613–622, 1988.
L.R. Ford, Jr. and D. R. Fulkerson, Flows in Networks, Princeton, NJ, Princeton University Press, 1962.
E. Granel et al., “A Comparative Study of Several Dynamic Routing Algorithms with Adaptive Preselection and Selection Phases,” ITC-13, pp. 383–388, 1991.
P. A. Humblet, “Another Adaptive Distributed Shortest Path Algorithm,” IEEE Trans. Comm., vol. 39, no. 6, pp. 995–1003, June 1991.
R. R. Jueneman and G. S. Kerr, “Explicit Path Routing in Communications Networks,” Proc. Int. Conference on Computer Communication, pp. 340–342, 1976.
K. R. Krishnan, “Adaptive State-Dependent Traffic Routing Using On-Line Trunk-Group Measurements,” ITC-13, pp. 407–411, 1991.
K. J. Lee, D. Towsley and M. Choi, “Distributed Algorithms with Constraints in Communication Networks,” INFOCOM’ 87, pp. 188–199, 1987.
K. J. Lee and B. Kadaba, “Distributed Routing Using Topology Database in Large Computer Networks,” INFOCOM’ 88, pp. 593–602, 1988.
G. Ludwig and R. Roy, “Saturation Routing Network Limits,” Proc. IEEE, pp. 1353–1362, 1977.
B. Maglaris, R. Boorstyn, S. Panwar and T. Spirtos, “Routing in BurstySwitched VoicelData Integrated Networks,” INFOCOM’ 87, pp. 162–169, 1987.
B. Maglaris et al., “Routing of Voice and Data in Burst-Switched Networks,” IEEE Trans. Comm., vol. 38, no. 6, pp. 889–897, June 1990.
D. Mitra, R. J. Gibbens and B. D. Huang, “Analysis and Optimal Design of Aggregated LEast Busy Alternative Routing on Symmetric Loss Networks With Trunk Reservations,” ITC-13, pp. 477–482, 1991.
I. Nikolaidis and R. O. Onvural, “A Bibliography on Performance Issues in ATM Networks”, to appear in ACM Computer Communication Review
S. Ohta, K. I. Sato, and I. Tokizawa, “A Dynamically Controllable ATM Transport Network Based on Virtual Path Concept”, GLOBECOM’88, 1272–1276, 1988.
R. O. Onvural and H. G. Perros, Performance Issues in High Speed Networks, Book of Speakers, Telecom’91, Zurich, Sep. 1991.
M. Schwartz and T. E. Stern, “Routing Techniques Used in Computer Communication Networks,” IEEE Trt;lns. Comm., vol. COM-28, no. 4, pp. 265–278, April 1980.
P. Semal, “Performance Evaluation of the Saturation Routing Method,” ITC-13, pp. 389–394, 1991.
W. Stallings, Data and Computer Communications, New York, MacMillan, 198.
A. Tanenbaum, Computer Networks, Englewood Cliffs, NJ, Prentice Hall, 1981.
K. Toyoshima, M. Sasagawa, and I. Zokizawa, “Flexible Surveillance Capabilities for ATM Based Transmission Systems”, ICC’91, 699–704, 1991.
S. Van Hoesel, P. Kellenberg and W. Schooten, “Routing and Multiplex Bundling in a Transmission Network,” ITC-13, pp. 401–406, 1991.
Z. Zhang and H. L. Hartmann, “Optimal Routing in Virtual Circuit Communication Networks,” ITC-13, pp. 395–400, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer Science+Business Media New York
About this chapter
Cite this chapter
Onvural, R.O., Nikolaidis, I. (1992). Routing in ATM Networks. In: Perros, H. (eds) High-Speed Communication Networks. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3450-1_10
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3450-1_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6527-3
Online ISBN: 978-1-4615-3450-1
eBook Packages: Springer Book Archive