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

Shekhar Srivastava and Deep Medhi ()
Additional contact information
Shekhar Srivastava: University of Missouri-Kansas City
Deep Medhi: University of Missouri-Kansas City

Journal of Combinatorial Optimization, 2006, vol. 12, issue 1, No 7, 97-125

Abstract: 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.

Keywords: Diversity constraint; Tunnel-based networks; Optimization formulation; Lagrangian decomposition algorithm (search for similar items in EconPapers)
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-006-8907-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:12:y:2006:i:1:d:10.1007_s10878-006-8907-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-006-8907-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().