Cart (Loading....) | Create Account
Close category search window
 

State-dependent optimal routing in MPLS-based networks with heterogeneous flow holding times

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
$31 $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

2 Author(s)
Peng He ; Sch. of Inf. Technol. & Eng., Ottawa Univ., Ont., Canada ; Regnier, J.

This study investigates routing in a MPLS-based (multi-protocol label switching) IP network with heterogeneous holding time traffic (for example, an IP call versus an IP conference). Our basic idea is to exploit the large differences existing in the holding time of different types of traffic to make more efficient resource allocation decisions in the admission and routing processes. In particular, we investigate the concept of vacating, in which requests with short holding times vacate the bandwidth to requests with long holding times. Based on an analytical framework we developed, we analyze the vacating idea and propose several state-dependent routing schemes, namely preventive-vacating routing (PW), preemptive-vacating routing (PEV) and restricted-access routing (RAR). Both the analytical and simulation results indicate that within an effective range we found in traffic mix, our vacating schemes outperform the traditional LLR+TR (least loaded routing+trunk reservation) and Diff-SDR (differentiated dynamic shortest-distance routing scheme) S. Yang et al., (2001). Moreover, we deduce an approximated expression to compute the cost of accepting a long or short request, which leads to an approximated least cost routing (A-LCR) scheme. Through simulation study, A-LCR presents not only its good performing in network throughput, but also its particular flow control mechanism.

Published in:

Next Generation Internet Networks, 2005

Date of Conference:

18-20 April 2005

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.