Congestion Avoiding Mechanism Based on Inter-domain Hierarchy

  • Marc-Antoine Weisser
  • Joanna Tomasik
  • Dominique Barth
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4982)

Abstract

Inter-domain routing is ensured by BGP. BGP messages carry no information concerning quality parameters of routes. Our goal is to provide domains with information regarding the congestion state of other domains without any changes in BGP. A domain, which is aware of congested domains, can choose a bypass instead of a route exhibiting possible QoS problems. We propose a distributed mechanism sending alert messages in order to notify domains about other domains congestion state. Our solution avoids flooding the Internet with signaling messages. It limits the number of alerts by taking advantage of the hierarchical structure of the Internet set by P2C and P2P relationships. Our algorithm is heuristic because it is a solution to an NP-complete and inapproximable problem. We prove these properties using the Steiner problem in directed acyclic graphs. The simulation runs show that our mechanism significantly diminishes the number of unavailable domains and routes compared to those obtained with “pure” BGP routing and with a theoretical centralised mechanism.

Keywords

inter-domain QoS distributed algorithm 

References

  1. 1.
    Weisser, M.A., Tomasik, J.: A distributed algorithm for inter-domain resources provisioning. In: Proc. of EuroNGI, April 2006, pp. 9–16 (2006)Google Scholar
  2. 2.
    Farrel, A., Vasseur, J.-P., RFC, J.A.: 4655 - A Path Computation Element (PCE)-Based Architecture. Technical report (August 2006)Google Scholar
  3. 3.
    Ge, Z., Figueiredo, D.R., Jaiswal, S., Gao, L.: The hierarchical structure of the logical Internet graph. In: Proc. of SPIE ITCOM 2001, July 2001, pp. 208–222 (2001)Google Scholar
  4. 4.
    Subramanian, L., Agarwal, S., Rexford, J., Katz, R.H.: Characterizing the Internet hierarchy from multiple vantage points. In: Proc. of IEEE INFOCOM 2002, June 2002, vol. 2, pp. 618–627 (2002)Google Scholar
  5. 5.
    Gao, L.: On inferring autonomous system relationships in the Internet. IEEE/ACM Transactions on Networking 9(6), 733–745 (2001)CrossRefGoogle Scholar
  6. 6.
    Battista, G.D., Erlebach, T., Hall, A., Patrignani, M., Pizzonia, M., Schank, T.: Computing the types of the relationships between autonomous systems. IEEE/ACM Transactions on Networking 15(2), 267–280 (2007)CrossRefGoogle Scholar
  7. 7.
    Weisser, M., Tomasik, J.: Innapproximation proofs for directed Steiner tree and network problems. Technical report, PRiSM UVSQ (June 2007)Google Scholar
  8. 8.
    Cristallo, G., Jacquenet, C.: An Approach to Inter-domain Traffic Engineering. In: Proc. of WTC 2002 (September 2002)Google Scholar
  9. 9.
    Xiao, L., Lui, K.S., Wang, J., Nahrstedt, K.: QoS extension to BGP. In: Proc. of ICNP 2002, November 2002, pp. 100–109 (2002)Google Scholar
  10. 10.
    Okumu, I., Mantar, H., Hwang, J., Chapin, S.: Inter-domain qos routing on diffserv networks: a region-based approach. Comp. Comm. 28(2), 174–188 (2005)CrossRefGoogle Scholar
  11. 11.
    Subramanian, L., Caesar, M., Ee, C.T., Handley, M., Mao, M., Shenker, S., Stoica, I.: HLP: a next generation inter-domain routing protocol. In: Proc. of SIGCOMM 2005, August 2005, pp. 13–24. ACM Press, New York (2005)Google Scholar
  12. 12.
    Raghavachari, B., Veerasamy, J.: Approximation algorithms for mixed postman problem. SIAM J. on Discrete Mathematics 12(4), 425–433 (1999)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Gao, L., Griffin, T.G., Rexford, J.: Inherently safe backup routing with BGP. Proc. of INFOCOM 2001 1, 547–556 (2001)Google Scholar
  14. 14.
    Rekhter, Y., Li, T., Hares, S.: RFC 4271 - (BGP-4). Technical report (January 2006)Google Scholar
  15. 15.
    Weisser, M.A., Tomasik, J.: Automatic induction of inter-domain hierarchy in randomly generated network topologies. In: Proc. of CNS 2007, pp. 77–84 (2007)Google Scholar
  16. 16.
    Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: An approach to universal topology generation. In: Proc. of MASCOT 2001, August 2001, pp. 346–354 (2001)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2008

Authors and Affiliations

  • Marc-Antoine Weisser
    • 1
  • Joanna Tomasik
    • 1
  • Dominique Barth
    • 2
  1. 1.SupélecGif-Sur-YvetteFrance
  2. 2.PRiSMUniversity of VersaillesVersaillesFrance

Personalised recommendations