A Framework for Cooperative Inter-Domain QoS Routing

  • Alexandre Fonte
  • Edmundo Monteiro
  • Marcelo Yannuzzi
  • Xavier Masip-Bruin
  • Jordi Domingo-Pascual
Conference paper
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 196)


Currently, a straightforward way to design BGP-based Traffic Engineering (TE) tools for stub Autonomous Systems (AS) is to rely on selfish routing mechanisms. Although TE tools can find an optimal solution, this optimum represents only a local optimum for outbound traffic. Indeed, this is one of the main limitations of the selfish routing approach. This approach makes the TE tools unaware of the effects of their route choices on transit AS throughout the chosen paths, due to uncoordinated routing decisions, and congestion can occur on distant intra- or inter-domain links. Thus, cooperation among AS is the key to avoid the performance degradation and routing instability caused by the selfish routing approach and it would be fundamental for the future QoS-aware Internet. With these objectives in mind this paper presents and discusses a framework for coordinated Inter-domain QoS Routing (QoSR) decisions among stub and downstream AS taking into account multiple traffic QoS constraints and routing preferences. The paper includes a description of the main mechanisms and algorithms that integrate the framework, and finally a discussion of the implementation issues.


Inter-domain QoS routing Cooperative inter-domain routing 


  1. A. Akella, B. Maggs, S. Seshan, A. Shaikh, and R. Sitaraman. A measurement-based analysis of multihoming. In Proc. of ACM SIGCOMM 2003, August 2003Google Scholar
  2. G. Almes, S. Kalidindi, M. Zekauskas, A one-way delay metric for IPPM, IETF, RFC 2679, September 1999Google Scholar
  3. Network Measurement Tools. Web page accessed at August 2005.Google Scholar
  4. S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang and W. Weiss, An Architecture for Differentiated Services, RFC 2475, December 1998.Google Scholar
  5. Cisco Systems, Optimized Edge Routing. Web page accessed at August 2005.Google Scholar
  6. R. Dai, D. Stahl, and A. Whinston. The economics of smart routing and QoS. In Proc. of the Fifth Inter. Workshop on Networked Group Comm. (NGC’03), 2003.Google Scholar
  7. Internap Network Services. Internap Flow Control Platform. Web page accessed at August 2005.Google Scholar
  8. R. Chang and M. Lo, Inbound Traffic Engineering for Multihomed ASs Using AS Path Prepending. IEEE Network, March/April 2005.Google Scholar
  9. N. Feamster, J. Borkenhagen, and J. Rexford. Guidelines for interdomain traffic engineering. ACM SIGCOMM Comput. Commun. Rev., 33(5): 19 to 30, 2003.Google Scholar
  10. A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford, and F. True, Deriving traffic demands for operational IP networks: Methodology and experience. IEEE/ACM Trans. Networking 9, June 2001.Google Scholar
  11. M. Garey and D. Johnson, Computers and Intractability, A guide to the theory of NP-Completeness. Freeman, San Francisco, 1979.Google Scholar
  12. D. Goldenberg, L. Qiu, H. Xie, Y. Yang, and Y. Zhang. Optimizing cost and performance for multihoming. In Proc. of ACM SIGCOMM 2004, August 2004Google Scholar
  13. T. Griffin. What is the Sound of One Route Flapping? IPAM talk, 2002Google Scholar
  14. T. Griffin, and G. Wilfong. Analysis of the MED Oscillation Problem in BGP. In Proc. of the 10th IEEE International Conf. on Network Protocols (ICNPŠ02), 2002Google Scholar
  15. R. Hancock, G. Karagiannis, J. Loughney and S. Bosh. Next Steps in Signalling. IETF, Internet-draft, November 2004Google Scholar
  16. Infonet Suite Homepage. Web page accessed at August 2005.Google Scholar
  17. IP Monitoring Project (IPMON). Web page accessed at August 2005.Google Scholar
  18. J-Sim Homepage. Web page accessed at August 2005.Google Scholar
  19. F. Kuipers, P. V. Mieghem, T. Korkmaz, and M. Krunz, An Overview of Constraint-Based Path Selection Algorithms for QoS Routing, In IEEE Communications Magazine, December 2002Google Scholar
  20. R. Mahajan, D. Wetherall and T. Anderson. Negotiation based routing between neighboring domains. In Proc. of NSDI, May 2005.Google Scholar
  21. The Internet Mapping Project. Web page accessed at August 2005.Google Scholar
  22. Y. Rekhter, T. Li. A Border Gateway Protocol 4 (BGP-4). IETF, RFC 1771, March 1995Google Scholar
  23. T. Roughgarden and E. Tardos. How bad is selfish routing? Journal of ACM, 49(2):236 to 259, 2002.MathSciNetCrossRefGoogle Scholar
  24. S. Shalunov, B. Teitelbaum. One-way active measurement protocol (OWAMP) requirements. IETF, RFC 3763, April 2004Google Scholar
  25. S. Uhlig, O. Bonaventure, Designing BGP-based outbound traffic engineering techniques for stub ASes. ACM SIGCOMM CCR, October 2004Google Scholar
  26. J. Winick, S. Jamin, and J. Rexford. Traffic engineering between neighboring domains., July 2002.Google Scholar
  27. M. Yannuzzi, A. Fonte, X. Masip, E. Monteiro, S. Sanchez, M. Curado, J. Domingo. A proposal for inter-domain QoS routing based on distributed overlay entities and QBGP. In Proc. of WQoSR2004, LNCS 3266, October 2004Google Scholar

Copyright information

© International Federation for Information Processing 2006

Authors and Affiliations

  • Alexandre Fonte
    • 1
    • 3
  • Edmundo Monteiro
    • 1
  • Marcelo Yannuzzi
    • 2
  • Xavier Masip-Bruin
    • 2
  • Jordi Domingo-Pascual
    • 2
  1. 1.Laboratory of Communications and Telematics, CISUC/DEIUniversity of CoimbraCoimbraPortugal
  2. 2.Departament d’Arquitectura de ComputadorsUniversitat Politecnica de CatalunyaBarcelona, CatalunyaSpain
  3. 3.Polytechnic Institute of Castelo BrancoCastelo BrancoPortugal

Personalised recommendations