Advertisement

(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective

  • Luca Cittadini
  • Giuseppe Di Battista
  • Massimo Rimondini
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5344)

Abstract

The Internet is a huge and complex network in which Internet Service Providers (ISPs) compete for revenue. In order to support the establishment of commercial agreements, routing in the Internet must therefore allow each ISP to autonomously set up its own routing policies while ensuring global connectivity. The Border Gateway Protocol (BGP) allows to achieve both these goals, and is the currently adopted protocol for Internet routing.

It can be shown that the interaction of not-so-unlikely BGP configurations adopted at different ISPs can cause permanent oscillations of routing. Several models and algorithms have been proposed in the literature to study routing oscillations. The goal of this paper is to provide a survey of state of the art contributions in this field with an emphasis on the algorithmic aspects.

Keywords

Internet Service Provider Border Gateway Protocol Stable Path Stable Routing Commercial Relationship 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Rekhter, Y., Li, T., Hares, S.: A Border Gateway Protocol 4 (BGP-4). RFC 4271 (Draft Standard) (January 2006)Google Scholar
  2. 2.
    Griffin, T.G., Shepherd, F.B., Wilfong, G.: The stable paths problem and interdomain routing. IEEE/ACM Trans. on Networking 10(2), 232–243 (2002)CrossRefGoogle Scholar
  3. 3.
    Carlzon, M.: Bgp oscillations when peering with loopback addresses. In: Proc. AINA 2006 (2006)Google Scholar
  4. 4.
    Varadhan, K., Govindan, R., Estrin, D.: Persistent route oscillations in inter-domain routing. Computer Networks 32(1), 1–16 (2000)CrossRefGoogle Scholar
  5. 5.
    Kin Chau, C.: Policy-based routing with non-strict preferences. In: Proc. SIGCOMM 2006, pp. 387–398 (2006)Google Scholar
  6. 6.
    Griffin, T.G., Sobrinho, J.L.: Metarouting. In: Proc. SIGCOMM 2005, pp. 1–12 (2005)Google Scholar
  7. 7.
    Sobrinho, J.L.: An algebraic theory of dynamic network routing. IEEE/ACM Trans. on Networking 13(5), 1160–1173 (2005)CrossRefGoogle Scholar
  8. 8.
    Griffin, T.G., Wilfong, G.T.: A safe path vector protocol. In: Proc. INFOCOM 2000, pp. 490–499 (2000)Google Scholar
  9. 9.
    Griffin, T.G., Wilfong, G.: An analysis of bgp convergence properties. Proc. SIGCOMM 1999 29(4), 277–288 (1999)Google Scholar
  10. 10.
    Griffin, T.G., Shepherd, F.B., Wilfong, G.: Policy disputes in path-vector protocols. In: Proc. ICNP 1999, pp. 21–30 (1999)Google Scholar
  11. 11.
    Gao, L., Rexford, J.: Stable internet routing without global coordination. In: Proc. SIGMETRICS 2000, pp. 307–317 (2000)Google Scholar
  12. 12.
    Cittadini, L., Di Battista, G., Rimondini, M.: How Stable is Stable in Interdomain Routing: Efficiently Detectable Oscillation-Free Configurations. Technical Report RT-DIA-132-2008, Università Roma Tre (July 2008)Google Scholar
  13. 13.
    Fabrikant, A., Papadimitriou, C.: The complexity of game dynamics: Bgp oscillations, sink equilibria, and beyond. In: Proc. SODA, pp. 844–853 (2008)Google Scholar
  14. 14.
    Jaggard, A.D., Ramachandran, V.: Robust path-vector routing despite inconsistent route preferences. In: Proc. ICNP 2006, pp. 270–279 (2006)Google Scholar
  15. 15.
    Feamster, N., Johari, R., Balakrishnan, H.: Implications of autonomy for the expressiveness of policy routing. IEEE/ACM Trans. on Networking 15(6), 1266–1279 (2007)CrossRefGoogle Scholar
  16. 16.
    Jaggard, A.D., Ramachandran, V.: Robustness of class-based path-vector systems. In: Proc. ICNP 2004, pp. 84–93 (October 2004)Google Scholar
  17. 17.
    Rawat, A., Shayman, M.A.: Preventing persistent oscillations and loops in ibgp configuration with route reflection. Computer Networks 50(18), 3642–3665 (2006)CrossRefzbMATHGoogle Scholar
  18. 18.
    Di Battista, G., Erlebach, T., Hall, A., Patrignani, M., Pizzonia, M., Schank, T.: Computing the types of the relationships between autonomous systems. IEEE/ACM Trans. on Networking 15(2), 267–280 (2007)CrossRefGoogle Scholar
  19. 19.
    Gao, L., Griffin, T., Rexford, J.: Inherently safe backup routing with BGP. In: Proc. INFOCOM 2001, pp. 547–556 (2001)Google Scholar
  20. 20.
    Ahronovitz, E., Konig, J.-C., Saad, C.: A distributed method for dynamic resolution of bgp oscillations. In: Proc. IPDPS 2006 (April 2006)Google Scholar
  21. 21.
    Bremler-Barr, A., Afek, Y., Schwarz, S.: Improved bgp convergence via ghost flushing. In: Proc. INFOCOM 2003, vol. 2, pp. 927–937 (2003)Google Scholar
  22. 22.
    Cobb, J.A., Gouda, M.G., Musunuri, R.: A stabilizing solution to the stable path problem. In: Proc. Self-Stabilizing Systems, pp. 169–183 (2003)Google Scholar
  23. 23.
    Ee, C.T., Ramachandran, V., Chun, B.G., Lakshminarayanan, K., Shenker, S.: Resolving inter-domain policy disputes. Technical Report UCB/EECS-2007-27, EECS Department, University of California, Berkeley (February 2007)Google Scholar
  24. 24.
    Klockar, T., Carr-Motyčková, L.: Preventing oscillations in route reflector-based i-bgp. In: Proc. ICCCN 2004, pp. 53–58 (2004)Google Scholar
  25. 25.
    Luo, J., Xie, J., Hao, R., Li, X.: An approach to accelerate convergence for path vector protocol. In: Proc. GLOBECOM 2002, vol. 3, pp. 2390–2394 (2002)Google Scholar
  26. 26.
    Musunuri, R., Cobb, J.A.: A complete solution for ibgp stability. In: Proc. IEEE International Conference on Communications (ICC 2004), vol. 2, pp. 1177–1181 (June 2004)Google Scholar
  27. 27.
    Pei, D., Zhao, X., Wang, L., Massey, D., Mankin, A., Wu, S.F., Zhang, L.: Improving bgp convergence through consistency assertions. In: Proc. INFOCOM 2002, vol. 2, pp. 902–911 (2002)Google Scholar
  28. 28.
    Zhang, H., Arora, A., Liu, Z.: A stability-oriented approach to improving bgp convergence. In: Proc. IEEE Intl. Symposium on Reliable Distributed Systems 2004, pp. 90–99 (2004)Google Scholar
  29. 29.
    Basu, A., Ong, C.-H.L., Rasala, A., Shepherd, F.B., Wilfong, G.: Route oscillations in i-bgp with route reflection. In: Proc. SIGCOMM 2002 (2002)Google Scholar
  30. 30.
    Griffin, T.G., Wilfong, G.: On the correctness of ibgp configuration. Proc. SIGCOMM 2002 32(4), 17–29 (2002)Google Scholar
  31. 31.
    Griffin, T.G., Wilfong, G.T.: Analysis of the med oscillation problem in bgp. In: Proc. ICNP 2002, pp. 90–99 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Luca Cittadini
    • 1
  • Giuseppe Di Battista
    • 1
  • Massimo Rimondini
    • 1
  1. 1.Roma Tre UniversityItaly

Personalised recommendations