Skip to main content
SpringerLink
Log in

Traffic engineering of tunnel-based networks with class specific diversity requirements

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Tunnel-based networks such as Multi-protocol Label switching (MPLS) are suitable for providing diversity guarantees to different service classes or customers. Based on the number of active tunnels to handle, router capabilities can be taxed due to the limited amount of memory and/or processing power of these routers. In this paper, we present a mixed-integer linear program formulation for a traffic engineering problem where such tunnel restrictions are taken into account in addition to standard capacity constraints while addressing diversity requirement of services. Due to large size of the formulation, we also present an accompanied solution approach based on Lagrangian relaxation and sub-gradient optimization. We then present results towards impact of diversity constraint upon the tunneling and capacity restrictions. We observed that the networks having higher amounts of capacity and demands with higher level of survivability are much more sensitive to number of allowed tunnels in the network. The impact is even more prominent for sparsely-connected, large-sized networks.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Applegate D, Thorup M (2003) Load Optimal MPLS routing with N + M Labels. In Proceedings of INFOCOM, San Francisco, IEEE

  • Bahiense L, Barahoma F, Porto O (2003) Solving Steiner Tree Problem in Graphs with Lagrangian Relaxation. Journal of Combinatorial Optimization, 7:259–282

    Article  MATH  MathSciNet  Google Scholar 

  • Gavish B, Trudeau P, Dror M, Gendreau M, Mason L (1989) Fiberoptic Circuit Network Design under Reliability Constraints. IEEE Journal on Selected Areas of Communication, 7(8):1181–1187

    Article  Google Scholar 

  • Held M, Wolfe P, Crowder H (1974) Validation of Sub-Gradient Optimization. Mathematical Programming, 62–88

  • Holmberg K, Hellstrand J (1998) Solving the uncapicitated network design problem by a Lagrangian heuristic and branch-and-bound. Operations Research, 46:247–259

    Article  MATH  MathSciNet  Google Scholar 

  • ILOG Corporation, USA. Manual of Cplex Callable Libraries

  • Kodialam M, Lakshman TV (2001) Dynamic Routing of Locally Restorable Bandwidth Guaranteed Tunnels Using Aggregate Link Information. In Proceedings of INFOCOM, 376–385

  • Medhi D (1991) Diverse Routing for Survivability in a fiber-based Sparse Network. In Proceedings of International Conference on Communications (ICC’91), IEEE 672–676

  • Medina A, Taft N, Salamatian K, Bhattacharyya S, Diot C (2002) Traffic Matrix Estimation: Existing Techniques and New Directions. In Proceeding of SIGCOMM. ACM

  • Minoux M (1986) Mathematical Programming—Theory and Algorithms. J. Wiley & Sons

  • Mitra D, Ramakrishnan K (1999) A case study of Multiservice, Multipriority Traffic Engineering Design of Data Networks. In Proceedings of GLOBECOM. IEEE

  • Pióro M, Medhi D (2004) Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann Publishers

  • Srivastava S, Krithikaivasan B, Medhi D, Pióro M (2003) Traffic Engineering in the Presence of Tunneling and Diversity Constraints: Formulation and Lagrangean Decomposition Approach. In Proceedings of 18th International Teletraffic Congress, Berlin, Elsevier Science, 461–470

  • Srivastava S, Thirumalasetty SR, Medhi D (2005) Network Traffic Engineering with varied levels of Protection in Next Generation Internet. In Girard A, Sansó B, Vázquez-Abad F, editors, Performance Evaluation and Planning Methods for the Next Generation Internet: GERAD 25 th Anniversary GERAD Volume. Springer

  • Stamatelakis D, Grover WD (2000) Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles (p-cycles). IEEE Transactions on Communications, 48(4):1262–1265

    Article  Google Scholar 

  • Wu TH (1992) Fiber Network Service Survivability, Artech House

  • Xiao X, Hannan A, Bailey B, Ni L (2000) Traffic Engineering with MPLS in the Internet. IEEE Network, 28–33

Download references

Author information

Author notes

  1. Shekhar Srivastava

    Present address: Schema, Inc., Rochelle Park, New Jersey, USA

Authors and Affiliations

  1. Computer Science & Electrical Engineering Department, University of Missouri-Kansas City, Kansas City, MO, 64110

    Shekhar Srivastava & Deep Medhi

Authors
  1. Shekhar Srivastava
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Deep Medhi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Deep Medhi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Srivastava, S., Medhi, D. Traffic engineering of tunnel-based networks with class specific diversity requirements. J Comb Optim 12, 97–125 (2006). https://doi.org/10.1007/s10878-006-8907-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-006-8907-x

Keywords

Search

Navigation