Skip to main content

Policy-Driven Traffic Engineering for Intra-domain Quality of Service Provisioning

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2511))

Abstract

Given the emergence of IP networks and the Internet as the multiservice network of the future, it is plausible to consider its use for transporting demanding traffic with high bandwidth and low delay and packet loss requirements. Emerging technologies for scalable quality of service such as Differentiated Services and MPLS can be used for premium quality traffic. We are looking at the problem of intra-domain provisioning in an automated manner from an Internet Service Provider’s (ISPs) point of view, i.e. we want to satisfy the contracts with our customers while optimising the use of the network resources. We need to be able to dynamically guide the behaviour of such an automated provisioning system in order to be able to meet the high-level business objectives. The emerging policy-based management paradigm is the means to achieve this requirement. In this paper we devise first a non-linear programming formulation of the traffic engineering problem and show that we can achieve the objectives and meet the requirements of demanding customer traffic through the means of an automated provisioning system. We extend the functionality of the automated system through policies. We define resource provisioning policies, and we present example scenarios of their enforcement.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Blake, et al., “An Architecture for Differentiated Services”, IETF Informational RFC-2475, December 1998

    Google Scholar 

  2. E. Rosen, A. Viswanathan, R. Callon, “Multiprotocol Label Switching Architecture”, IETF Standards Track RFC-3031, January 2001

    Google Scholar 

  3. D. Goderis, et al. “Service Level Specification Semantics and Parameters”, IETF draft-tequila-sls-01.txt, December 2001 (available at: http://www.ist-tequia.org/sls )

  4. M. Sloman, “Policy Driven Management For Distributed Systems”, Journal of Network and Systems Management, vol. 2, no. 4, pp. 333–360, December 1994.

    Article  Google Scholar 

  5. P. Flegkas, P. Trimintzios, G. Pavlou, “A Policy-based Quality of Service Management Architecture for IP DiffServ Networks”, IEEE Network Magazine, vol. 16, no. 2, pp. 50–56, March/April 2002.

    Article  Google Scholar 

  6. P. Trimintzios, et al., “A Management and Control Architecture for Providing IP Differentiated Services in MPLS-based Networks”, IEEE Communications Magazine, vol. 39, no. 5, May 2001

    Google Scholar 

  7. D. Grossman, “New Terminology and Clarifications for DiffServ”, IETF Informational RFC 3260, April, 2002

    Google Scholar 

  8. T. Li, and Y. Rekhter, “Provider Architecture for Differentiated Services and Traffic Engineering (PASTE)” IETF Informational RFC-2430, October 1998

    Google Scholar 

  9. Z. Wang, and J. Crowcroft, “Quality of Service Routing for Supporting Multimedia Applications”, IEEEJSAC, vol. 14, no. 7, pp. 1228–1234, September 1996

    Google Scholar 

  10. D. Bertsekas, Nonlinear Programming, (2nd ed.) Athena Scientific, 1999

    Google Scholar 

  11. D. Eppstein, “Finding k-shortest paths”, SIAM J. on. Computing, vol. 28, no 2, pp. 652–673, 1998

    Article  MATH  MathSciNet  Google Scholar 

  12. E. W. Zegura, K. L. Calvert, and S. Bhattacharjee. “How to model an internetwork”, In Proceedings of IEEE INFOCOM 96, vol. 2, pp. 594–602, USA, March 1996

    Google Scholar 

  13. J. Strassner, et al., “Policy Core LDAP Schema”, IETF draft-ietf-policy-core-schema-14.txt, January 2002

    Google Scholar 

  14. B. Moore et al., “Policy Core Information Model-Version 1 Specification”, IETF Standards Track RFC-3060, February 2001

    Google Scholar 

  15. D. Awduche, et al. “Overview and Principles of Internet Traffic Engineering”, IETF Informational RFC-3272, May 2002

    Google Scholar 

  16. F. Le Faucheur, et al. “Requirements for support of Diff-Serv-aware MPLS Traffic Engineering”, IETF Internet draft, <draft-ietf-tewg-diff-te-reqts-05.txt>, work in progress, June 2002

    Google Scholar 

  17. A. Feldmann and J. Rexford, “IP Network Configuration for Intradomain Traffic Engineering”, IEEE Network Magazine, vol. 15, no. 5, pp. 46–57, September 2001

    Article  Google Scholar 

  18. P. Aukia, et al. “RATES: A Server for MPLS Traffic Engineering”, IEEE Network Magazine, vol. 14, no. 2, pp. 34–41, March 2000

    Article  Google Scholar 

  19. B. Fortz, and M. Thorup, “Internet Traffic Engineering by Optimizing OSPF Weights”, In Proc. of IEEE INFOCOM 2000, pp. 519–528, Israel, March 2000

    Google Scholar 

  20. M. Kodialam, and T.V. Lakshman, “Minimum Interference Routing with Applications to Traffic Engineering”, in Proc. IEEE INFOCOM00, pp. 884–893 March 2000

    Google Scholar 

  21. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice Hall, 1993

    Google Scholar 

  22. D. Mitra, and K. G. Ramakrishnan, “A Case Study of Multiservice, Multipriority Traffic Engineering Design for Data Networks”, In Proc. IEEE GLOBECOM 99, pp. 1087–1093, Brazil, December 1999

    Google Scholar 

  23. D. Mitra, J.A. Morrison and K.G. Ramakrishnan, “Virtual Private Networks: Joint Resource Allocation and Routing Design”, In Proc. IEEE INFOCOM 99, USA, March 1999

    Google Scholar 

  24. F. Poppe, et al. “Choosing the Objectives for Traffic Engineering in IP Backbone Networks Based on Quality-of-Service Requirements”, In Proc. Workshop on Quality of future Internet Services (QofIS’00), pp. 129–140, Germany, September 2000

    Google Scholar 

  25. S. Suri, et al. “Profile-based Routing: A New Framework for MPLS Traffic Engineering”, In Proc. of the 2nd International Workshop on Quality of future Internet Services (QofIS’01), pp. 138–157, Portugal, September 2001

    Google Scholar 

  26. Z. Wang, Y. Wang, and L. Zhang, “Internet Traffic Engineering without Full Mesh Overlaying”, In Proc. of IEEE INFOCOM 2001, Alaska, April 2001

    Google Scholar 

  27. Y. Breitbart, M. Garofalakis, A. Kumar and R. Rastogi, “Optimal Configuration of OSPF Aggregates”, In Proc. of IEEE INFOCOM02, New York, USA, June 2002

    Google Scholar 

  28. S. Chen, K. Nahrstedt, “An Overview of Quality-of-Service Routing for the Next Generation High-Speed Networks: Problems and Solutions”, IEEE Network Magazine, vol. 12, no. 6, pp. 64–79, November 1998

    Article  Google Scholar 

  29. A. Elwalid, C. Jin, S H. Low, and I. Widjaja, “MATE: MPLS Adaptive Traffic Engineering”, In Proc. of IEEE INFOCOM2001, pp. 1300–1309, Alaska, USA, April 2001

    Google Scholar 

  30. Z. Cao, Z. Wang, and E. Zegura, “Performance of Hashing-based Schemes for Internet Load Balancing”, In Proc. of IEEE INFOCOM 00, pp. 332–341, March 2000

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Trimintzios, P., Flegkas, P., Pavlou, G. (2002). Policy-Driven Traffic Engineering for Intra-domain Quality of Service Provisioning. In: Stiller, B., Smirnow, M., Karsten, M., Reichl, P. (eds) From QoS Provisioning to QoS Charging. QofIS ICQT 2002 2002. Lecture Notes in Computer Science, vol 2511. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45859-X_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-45859-X_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44356-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics