Abstract
Routing problems are frequently encountered when designing and managing telecommunication networks. Today, routing problems are affected by the growing sizes of networks, which increase the complexity, and by introduction of new services and technologies, which rise the demands. Rather than resorting to entirely heuristic algorithms and/or large data bases with off-line precomputed routing information for various situations, we propose a new decomposition method whereby any routing algorithm is speeded up considerably, thus permitting the deployment of well founded routing algorithms even for real time purposes. Our work presents the method in formal terms and compares it to other, existing methods of network decomposition. To investigate the performance of our method with respect to complexity reduction and optimality of routing results, we outline a possible application to a real problem and study parts it numerically. It is found that considerable time savings can be made at a limited cost in terms of non-optimality of the final solution. We also discuss the fact that in real-time applications with non-constant traffics, this nominal degradation might be more than compensated for by the prompt delivery.
Chapter PDF
Similar content being viewed by others
References
Antonio, J., Huang, G., and Tsai, W. (1991) A Fast Distributed Shortest Path Algorithm for a Class of Hierarchically Structured Data Networks, in Proc. IEEE Globecom ’81, Phoenix, Arizona.
Arvidsson, Å. (1994) Real Time Management of Virtual Paths, in Proc. IEEE Globecom ’8.4., San Francisco, California.
Arvidsson, Å. (1995) Traffic Management in ATM Networks — A Proposal for Imperfect Traffic Information, in Proc. Second Polish Teletraffic Seminar, Gdansk.
Arvidsson, Å., Holender, T., and Karlsson, T. (1996) Reduction of Routing Complexity by a Novel Multilayer Decomposition Method, in Proc. Fourth IFIP Int. Workshop on Perf. Mod. and Eval. of ATM Netw., Ilkley.
Dimitrijević, D., Maglaris, B., and Boorstyn, R. (1994) Routing in Multidomain Networks. IEEE/ACM Trans. on Networking, 2, 252–62.
Everitt, B. (1993) Cluster Analysis. Edward Arnold, London.
Gagnaire, M., Kofman, D. and Korezlioglu, H. (1995) An Analytical Descrip-tion of the Packet Train Model for LAN Traffic Characterization, in Perf. Modelling and Eval. of ATM Netw., 1. Chapman & Hall, London.
Garcia-Luna-Aceves, J. (1987) Regional Node Routing, in Proc. IEEE Globe-com ’87, Tokyo.
Hagouel, J. (1983) Issues in Routing for Large and Dynamic Networks. Ph.D. dissertation, Columbia University, New York.
Heijenk, G. and Niemegeers, I. (1995) Modelling the Reassembly Buffer in a Connectionless Server, in Perf. Modelling and Eval. of ATM Netw., 1. Chapman & Hall, London.
Kar, G., Madden, B., and Gilbert, R. (1988) Heuristic Layout Algorithms for Network Management Presentation Services. IEEE Network, 2, 29–36.
Kamimura, K. (1991) An Efficient Method for Determining Economical Con-figuration of Elementary Packet Switched Networks. IEEE Trans. On Commun., 39, 278–88.
Karlsson, T. (1995) An Evaluation of the Benefits Using Hierarchical Algo- rithms. Master thesis, Lund Institute of Technology, Lund (in Swedish).
Kaufman, L. and Rousseeuw, P. (1990) Finding Groups in Data: An Intro-duction to Cluster Analysis. Wiley, New York.
Kleinrock, L. (1970) Queuing Systems, vol. 2: Computer Applications. Wiley Inter-science, New York.
Kleinrock, L. and Kamoun, F. (1977) Hierarchical Routing for Large Networks: Performance Evaluation and Optimization. Computer Networks, 1, 155–74.
Kleinrock, L. and Kamoun, F. (1980) Optimal Clustering Structures for Hierarchical Topological Design of Large Computer Networks. Computer Networks, 10, 221–48.
Leland, W., Taqqu, M., Willinger, W., and Wilson, D. (1994) On the Self-Similar Nature of Ethernet Traffic (Extended Version). IEEE/ACM Trans. on Networking, 2, 1–15.
Paxson, V. and Floyd, S. (1994) Wide-Area Traffic: The Failure of Poisson Modeling, in Proc. ACM Sigcomm 94, London.
Saksena, V. (1989) Topological Analysis of Packet Networks. IEEE J. on Sel. Areas in Commun., 7, 1243–52.
Szybicki, E. and Bean, A. (1979) Advanced Routing in Local Telephone Networks; Performance of Proposed Call Routing Algorithms, in Proc. 9th Internat. Teletraffic Cong., Torremolinos.
Vickers, B. and Suda, T. (1994) Connectionless Service for Public ATM Networks. IEEE Commun. Mag., 32, 34–42.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 IFIP Published by Chapman & Hall
About this chapter
Cite this chapter
Arvidsson, Å. (1997). Routing Complexity Reduction by Multilayer Decomposition. In: Kouvatsos, D. (eds) ATM Networks. ATM 1996. IFIP Advances in Information and Communication Technology. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35185-8_10
Download citation
DOI: https://doi.org/10.1007/978-0-387-35185-8_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-5041-2950-3
Online ISBN: 978-0-387-35185-8
eBook Packages: Springer Book Archive