Skip to main content

A Novel Multi-path Routing Protocol

  • Conference paper
Networking and Mobile Computing (ICCNMC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3619))

Included in the following conference series:

  • 563 Accesses

Abstract

The paper advocates a different view of routing protocols according to technology trends nowadays. A Link State Multi-Path routing protocol, LSMP, is thereby introduced. This new hop-count based multi-path routing protocol has novel failure recovery mechanism, which is simple and effective. Through analysis and simulation, our protocol shows much faster convergence and better traffic balancing than traditional routing protocols. We propose LSMP to create an efficient routing architecture supporting Traffic Engineering (TE), while at the same time reducing complexity of a routing system.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Molinero-Fernández, P.: Circuit Switching In The Internet, Dissertation, Stanford University (2003)

    Google Scholar 

  2. Hedrick, C.: Information Protocol. RFC 1058, IETF (1988)

    Google Scholar 

  3. Moy, J.: OSPF Version 2, RFC1247, IETF (1991)

    Google Scholar 

  4. Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An architecture for Differentiated Service, RFC2475, IETF (1998)

    Google Scholar 

  5. Baker, F., Chan, K., Smith, A.: Management Information Base for the Differentiated Service Architecture, RFC3289, IETF (2002)

    Google Scholar 

  6. Bernet, Y., Blake, S., Grossman, D., Smith, A.: An Informal Management model for Diffserv Routers, RFC3290, IETF (2002)

    Google Scholar 

  7. Braden, R., Clark, D., Shenker, S.: Integrated Service in the internet Architecture: An overview, RFC1633, IETF (1994)

    Google Scholar 

  8. Guerin, R.A., Orda, A., Williams, D.: QoS routing mechanisms and OSPF Extensions. In: GLOBECOM (1997)

    Google Scholar 

  9. Apostolopoulos, G., Guerin, R., Kamat, S.: Implementation and performance measurements of QoS routing extensions to OSPF. In: INFOCOM (1999)

    Google Scholar 

  10. Li, X., King-Shan, L., Jun, W., Nahrstedt, K.: QoS extension to BGP. In: 10th IEEE International Conference (2002)

    Google Scholar 

  11. Apostolopoulos, G., Williams, D., Kamat, S., Guerin, R., Orda, A., Przygienda, T.: QoS Routing Mechanisms and OSPF Extensions, RFC 2676, IETF (1999)

    Google Scholar 

  12. Jong-Joon, H., Seung-Hoon, K., Kyoon-Ha, L.: QoS routing schemes for supporting load balancing. In: IEEE HSNMC (2002)

    Google Scholar 

  13. Yu-Kung, K., Copeland, J.A.: Scalability of Routing Advertisement for QoS Routing in an IP Network with Guaranteed QoS. In: GLOBECOM (2000)

    Google Scholar 

  14. Harmatos, J.: A heuristic algorithm for solving the static weight optimisation problem in OSPF networks. In: GLOBECOM (2001)

    Google Scholar 

  15. Sahoo, A.: An OSPF based load sensitive QoS routing algorithms using alternate path. Computer Comunications and Networks (2002)

    Google Scholar 

  16. Zhang, P., Bai, X., Kantola, R.: A routing scheme for optimizing multiple classes in a DiffServ network. In: HPSR (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bai, X., Matuszewski, M., Shuping, L., Kantola, R. (2005). A Novel Multi-path Routing Protocol. In: Lu, X., Zhao, W. (eds) Networking and Mobile Computing. ICCNMC 2005. Lecture Notes in Computer Science, vol 3619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534310_77

Download citation

  • DOI: https://doi.org/10.1007/11534310_77

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28102-3

  • Online ISBN: 978-3-540-31868-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics