Skip to main content
SpringerLink
Log in

A Hierarchical Routing Method for Load-Balancing

  • Conference paper
High Performance Computing - HiPC 2003 (HiPC 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2913))

Included in the following conference series:

  • 416 Accesses

Abstract

The purpose of routing protocols in a computer network is to maximize network throughput. Shortest-path routing protocols have the disadvantage of causing bottlenecks due to their single-path routing. The shortest path between a source and a destination may become highly congested even when many other paths have low utilization. In this paper, we propose a routing scheme for hierarchically structured computer networks. The proposed hierarchical routing algorithm balances traffic load via unequal paths over the whole network; therefore, it removes bottlenecks and increases network throughput. For each data message to be sent from a source s to a destination d, the proposed routing protocol chooses each of three intermediate nodes from a selected set of network nodes, and routes the data message along a path from s through the three intermediate nodes to d. This increases the effective bandwidth between each pair of nodes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alaettinoǧlu, C., Shankar, A.U.: The Viewserver Hierarchy for Interdomain Routing: Protocols and Evaluation. IEEE Journal on Selected Areas in Communications 13(8), 1396–1410 (1995)

    Article  Google Scholar 

  2. Bahk, S., Zarki, M.E.: Dynamic Multi-path Routing and How it Compares with other Dynamic Routing Algorithms for High Speed Wide Area Networks. In: Proceedings of the 1992 ACM SIGCOMM Conference, October 1992, vol. 22 (1992)

    Google Scholar 

  3. Bak, S., Cobb, J.A.: Randomized Distance-Vector Routing Protocol. In: Proceedings of ACM Symposium on Applied Computing, San Antonio, Texas, February 1999, pp. 78–84 (1999)

    Google Scholar 

  4. Bak, S.: Load-Balanced Routing via Bounded Randomization based on Destination Node. In: Proceedings of the 13th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2001), Anaheim, California, USA (August 2001)

    Google Scholar 

  5. Breslau, L., Estrin, D.: Design of Inter-Administrative Domain Routing Protocols. In: Proc. ACM SIGCOMM 1990, Philadelphia, Pennsylvania, September 1990, pp. 231–241 (1990)

    Google Scholar 

  6. Cole, R., Maggs, B.M., Meyer auf der Heide, F., Mitzenmacher, M., Richa, A.W., Schroeder, K., Sitaraman, R.K., Voecking, B.: Randomized Protocols for low-congestion circuit routing in multistage interconnection networks. In: Procceedings of the 29th Annual ACM Symposium on the Theory of Computing, May 1998, pp. 378–388 (1998)

    Google Scholar 

  7. Bertsekas, D.P.: Dynamic behavior of shortest path routing algorithms for communication networks. IEEE Trans. Automatic Control AC-27, 60–74 (1982)

    Article  MathSciNet  Google Scholar 

  8. Bertsekas, D.P.: Linear Network Optimization: Algorithms and Codes. The MIT Press, Cambridge (1991)

    MATH  Google Scholar 

  9. Cobb, J.A., Gouda, M.G.: Balanced Routing. In: IEEE Proceedings of the International Conference on Network Protocols (1997)

    Google Scholar 

  10. Dijkstra, E.W.: A Note on Two Problems in Connection with Graphs. Numerische Mathematik 1, 269–271 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  11. Dixon, R.C., Pitt, D.A.: Addressing, Bridging, and Source Routing (LAN interconnection). IEEE Network 2(1) (January 1988)

    Google Scholar 

  12. Garcia-Luna-Aceves, J.J.: A Minimum-Hop Routing Algorithm Based on Distributed Information. Computer Networks and ISDN Systems 16, 367–382 (1989)

    Article  MATH  Google Scholar 

  13. Gouda, M.: Protocol verification made simple: a tutorial. Computer Networks and ISDN Systems 25, 969–980 (1993)

    Article  Google Scholar 

  14. Gouda, M.: The Elements of Network Protocol Design. A Wiley-Interscience Publication, John Wiley & Sons, Inc. (1998)

    Google Scholar 

  15. Huitema, C.: Routing in the Internet. Prentice Hall, Englewood Cliffs (1995)

    Google Scholar 

  16. Malkin, G.: RIP Version 2, Internet Request for Comments 1723 (November 1994), Available from http://www.ietf.cnri.reston.va.us

  17. McQuillan, J.M., Richer, I., Rosen, E.C.: The New Routing Algorithm for the ARPANET. IEEE Trans. on Communications COM-28(5), 711–719 (1980)

    Article  Google Scholar 

  18. Moy, J.: Ospf Version 2, Internet Request for Comments 1583 (March 1994), Available from http://www.ietf.cnri.reston.va.us

  19. Murthy, S., Garcia-Luna-Aceves, J.J.: Congestion-Oriented Shortest Multipath Routing. In: Proc. IEEE INFOCOM 1996, San Francisco, California (March 1996)

    Google Scholar 

  20. Murthy, S., Garcia-Luna-Aceves, J.J.: Loop-Free Internet Routing using Hierarchical Routing Trees. In: Proc. IEEE INFOCOM 1997, April 1997, vol. 1, pp. 101–108 (1997)

    Google Scholar 

  21. Nesson, T., Johnsson, S.L.: ROMM Routing on Mesh and Torus Networks. In: Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures (July 1995)

    Google Scholar 

  22. Ramamoorthy, C.V., Tsai, W.: An adaptive hierarchical routing algorithm. In: Proc. IEEE COMPSAC 1983, Chicago, pp. 93–104 (1983)

    Google Scholar 

  23. Segall, Sidi, M.: A Failsafe Distributed Protocol for Minimum Delay Routing. IEEE Trans. on Commun. COM-29(5) (May 1981)

    Google Scholar 

  24. Sidhu, D., Nair, R., Abdallah, S.: Finding Disjoint Paths in Networks. In: Proceedings of the 1991 ACM SIGCOMM Conference (1991)

    Google Scholar 

  25. Valiant, L.G.: A Scheme for Fast Parallel Communication. SIAM Journal on Computing 11(2) (May 1982)

    Google Scholar 

  26. Vutukury, S., Garcia-Luna-Aceves, J.J.: SMART: A Scalable Multipath Architecture for Intra-domain QoS Provisioning. In: Ajmone Marsan, M., Bianco, A. (eds.) QoS-IP 2001. LNCS, vol. 1989, p. 67. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  27. Vutukury, S., Garcia-Luna-Aceves, J.J.: MDVA: A Distance-Vector Multipath Routing Protocol. In: Proceedings of IEEE Infocom 2001, April 22-26 (2001)

    Google Scholar 

  28. Wang, Z., Crowcroft, J.: Shortest Path First with Emergency Exits. In: Proceedings of the 1990 ACM SIGCOMM Conference (1990)

    Google Scholar 

  29. Zaumen, W.T., Garcia-Luna-Aceves, J.J.: Loop-Free Multipath Routing Using Generalized Diffusing Computations. In: Proc. IEEE INFOCOM 1998, San Francisco, California, March 29 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. 3G Core Network Development Team, KTF, KTF Bldg 18th fl. 1321-11 SeoCho-Dong, SeoCho-Gu, Seoul, Korea

    Sangman Bak

Authors
  1. Sangman Bak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Southern California, CA 90089-2562, Los Angeles

    Timothy Mark Pinkston

  2. Department of Electrical Engineering, University of Southern California, CA 90089-2562, Los Angeles, USA

    Viktor K. Prasanna

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bak, S. (2003). A Hierarchical Routing Method for Load-Balancing. In: Pinkston, T.M., Prasanna, V.K. (eds) High Performance Computing - HiPC 2003. HiPC 2003. Lecture Notes in Computer Science, vol 2913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24596-4_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24596-4_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20626-2

  • Online ISBN: 978-3-540-24596-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation