Skip to main content
Springer Nature Link
Log in

Fault-Tolerant Dynamic Routing Based on Maximum Flow Evaluation

  • Conference paper
Dependable Computing (LADC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4746))

Included in the following conference series:

  • 466 Accesses

Abstract

This work proposes a fault-tolerant dynamic routing algorithm that employs maximum flow evaluation for route selection, increasing the number of disjoint paths to the destination, enhancing the path redundancy, and so extending the possibility of using detours, or alternative paths if needed. Route distance is employed as a secondary criterion. Routes may be dynamically changed by intermediate routers, which usually have more recent information about topology changes. Formal proofs for correctness of the algorithm are also presented. The proposed algorithm was implemented in a simulation environment and experimental results are presented.

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

Access this chapter

Log in via an institution

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. Huitema, C.: Routing in the Internet, 2nd edn. Prentice Hall, Upper Saddle River (1999)

    Google Scholar 

  2. Labovitz, C., Ahuja, A., Bose, A., Jahanian, F.: Delayed internet routing convergence. In: SIGCOMM, pp. 175–187 (2000)

    Google Scholar 

  3. Java Technology: http://java.sun.com

  4. Ford Jr., L.R., Fulkerson, D.R.: Flows in networks. Princeton University Press (1962)

    Google Scholar 

  5. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms, 2nd edn. McGraw-Hill, New York (1990)

    Google Scholar 

  6. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  7. Faloutsos, M., Faloutsos, P., Faloutsos, C.: On Power-Law Relationships of the Internet Topology. In: SIGCOMM 1999. Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, Cambridge, Massachusetts, USA, pp. 251–262. ACM Press, New York (1999)

    Chapter  Google Scholar 

  8. Medina, A., Matta, I., Byers, J.: On the Origin of Power Laws in Internet Topologies. SIGCOMM Computer Communication Review 30(2), 18–28 (2000)

    Article  Google Scholar 

  9. Chen, Q., Chang, H., Govindan, R., Jamin, S., Shenker, S., Willinger, W.: The Origin of Power-Laws in Internet Topologies Revisited. In: INFOCOM 2002. Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE Computer Society Press, Los Alamitos (2002)

    Google Scholar 

  10. Tangmunarunkit, H., Govindan, R., Jamin, S., Shenker, S., Willinger, W.: Network Topology Generators: Degree-Based vs. Structural. In: SIGCOMM 2002. Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 147–159. ACM Press, New York (2002)

    Chapter  Google Scholar 

  11. Bu, T., Towsley, D.F.: On Distinguishing between Internet Power Law Topology Generators. In: INFOCOM 2002. Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE Computer Society Press, Los Alamitos (2002)

    Google Scholar 

  12. Pei, D., Zhang, B., Massey, D., Zhang, L.: An analysis of convergence delay in path vector routing protocols. Computer Networks 50(3) (2006)

    Google Scholar 

  13. Sahoo, A., Kant, K., Mohapatra, P.: Improving bgp convergence delay for large-scale failures. In: DSN 2006. The 7th IEEE/IPIP International Conference on Dependable Systems and Networks, Philadelphia, U.S.A (2006)

    Google Scholar 

  14. Wong, T., Jacobson, V., Alaettinoglu, C.: Internet Routing Anomaly Detection and Visualization. In: DSN 2005. The 6th IEEE/IPIP International Conference on Dependable Systems and Networks, Yokohama, Japan (2005)

    Google Scholar 

  15. Zhang, H., Arora, A., Liu, Z.: A Stability-Oriented Approach to Improving BGP Convergence. In: SRDS 2004. The 23rd IEEE International Symposium on Reliable Distributed Systems, Florianópolis, Brazil (2004)

    Google Scholar 

  16. Wang, L., Massey, D., Patel, K., Zhang, L.: FRTR: A scalable mechanism for global routing table consistency. In: DSN 2004. Proceedings of the IEEE/IFIP International Conference on Dependable Systems and Networks, Florence, Italy, pp. 465–474 (2004)

    Google Scholar 

  17. Pei, D., Wang, L., Massey, D., Wu, S.F., Zhang, L.: A Study of Packet Delivery Performance During Routing Convergence. In: DSN 2003. The 4th IEEE/IPIP International Conference on Dependable Systems and Networks, San Francisco, U.S.A (2003)

    Google Scholar 

  18. Chandrashekar, J., Duan, Z., Zhang, Z.L., Krasky, J.: Limiting Path Exploration in BGP. In: INFOCOM 2004. The 24th IEEE INFOCOM, Miami, USA, IEEE Computer Society Press, Los Alamitos (2005)

    Google Scholar 

  19. Pei, D., Zhao, X., Wang, L., Massey, D., Mankin, A., Wu, S., Zhang, L.: Improving BGP Convergence through Consistency Assertions. In: INFOCOM 2002. The 21st IEEE INFOCOM, New York, USA, IEEE Computer Society Press, Los Alamitos (2002)

    Google Scholar 

  20. Duarte Jr. E.P., Santini, R., Cohen, J.: Delivering packets during the routing convergence latency interval through highly connected detours. In: DSN 2004. Proceedings of the IEEE/IFIP International Conference on Dependable Systems and Networks, Florence, Italy, pp. 495–504 (2004)

    Google Scholar 

  21. Gomory, R.E., Hu, T.C.: Multi-terminal network flows. SIAM Journal on Applied Mathematics 9, 551–556 (1961)

    Article  MATH  MathSciNet  Google Scholar 

  22. Funagalli, A., Valcarenghi, L.: Restauration vs. WDM Protection: Is There an Optimal Choice? IEEE Network (2000)

    Google Scholar 

  23. Rosen, E., Viswanathan, A., Callon, R.: RFC 3031: Multi-Protocol Label Switchin (2001)

    Google Scholar 

  24. Hellstrand, F., Sharma, V.: RFC 3469: Framework for MPLS-based Recovery (2004)

    Google Scholar 

  25. Correia, R.B., Pirmez, L., et al.: Rerroteamento Parcial Pró-Ativo em Redes Baseadas em Circuito Virtual no Suporte ao Gerenciamento de Desempenho Pró-Ativo. In: SBRC 2005. XXIII Simpósio Brasileiro de Redes de Computadores, Fortaleza, Brazil (2005)

    Google Scholar 

  26. Medhi, D.: A Perspective on Network Restoration. Handbook of Optimization in Telecommunications (2005)

    Google Scholar 

  27. Puype, B., Yan, Q., Colle, D., et al.: Multi-Layer Traffic Engineering in Data Centric Optical Networks. In: COST266-IST OPTIMIST Workshop on Optical Networks, Budapest, Hungary (2003)

    Google Scholar 

  28. Tanaka, S., et al.: Field Test of GMPLS All Optical Path Rerouting. IEEE Photonics Technology Letters 17(3) (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Federal University of Paraná (UFPR), Dept. of Informatics – P.O. Box 19018, 81531-990 Curitiba, Brazil

    Jonatan Schroeder & Elias Procópio Duarte Jr.

Authors
  1. Jonatan Schroeder
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Elias Procópio Duarte Jr.
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrea Bondavalli Francisco Brasileiro Sergio Rajsbaum

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schroeder, J., Duarte, E.P. (2007). Fault-Tolerant Dynamic Routing Based on Maximum Flow Evaluation. In: Bondavalli, A., Brasileiro, F., Rajsbaum, S. (eds) Dependable Computing. LADC 2007. Lecture Notes in Computer Science, vol 4746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75294-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75294-3_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75293-6

  • Online ISBN: 978-3-540-75294-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics