By Topic

Transport Resource Manager for VPN routing in packet networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Huseyin Uzunalioglu ; Alcatel-Lucent, 600 Mountain Ave., Murray Hill, NJ 07974, USA ; Ramesh Nagarajan ; Gary W. Atkinson

Traffic matrices play a crucial role in designing, dimensioning, and evolving communication networks. Recent measurement studies, however, found that there is generally a mismatch between traffic matrices and the actual network traffic. Since the link sizing and routing plans depend on the traffic matrix, this mismatch would result in inefficient use of the network resources. Traffic Engineering addresses this problem by utilizing alternate paths to distribute the traffic uniformly over the network. However, traffic engineering is applied at yearly or multi-year intervals, and may require re-routing of existing connections. In this paper, we introduce a route selection algorithm that operates during VPN set-up request arrivals to determine the best path for the incoming requests to achieve efficient use of the network resources. Our algorithm utilizes the concept of shadow prices and distributes the traffic uniformly across the network making better use of deployed network resources which in turn minimizes the network operator's overall infrastructure capital and operational expenses. The performance modeling results show that our solution outperforms shortest path and greedy routing algorithms. Furthermore, we show that an approximate lower bound, which may never be achieved by a feasible algorithm, is only 25% better in network cost compared to our solution.

Published in:

Sarnoff Symposium, 2009. SARNOFF '09. IEEE

Date of Conference:

March 30 2009-April 1 2009