By Topic

Heuristic constraint-path routing decision system

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

4 Author(s)
Goodridge, W. ; Dept. of Eng. Math., Dalhousie Univ., Halifax, NS, Canada ; Robertson, W. ; Phillips, William J. ; Sivakumar, S.

Heuristic QoS algorithms under strict constraints perform poorly in terms of finding a path that is suitable for a user's QoS needs-the multiple constraint path problem (MCP). Exact QoS algorithms, on the other hand, guarantee that a path satisfying user needs would be found and offer a more realistic approach for solving the MCP problem in view of the fact that the NP-complete character of graphs are not common in real networks. This fact has driven approaches like the SAMCRA and A*prune algorithms. However, these algorithms still have very high running times relative to heuristic approaches. When QoS routing algorithms are used in online traffic engineering (TE) environments it may be necessary to route thousands of traffic flows each minute. Exact algorithms simply cannot work in such environments. We propose a heuristic algorithm that is suitable for working in an online TE environment. Simulations show that this algorithm produce high success rates in terms of finding suitable constraint paths for user flows while at the same time having execution times comparable to another heuristic based algorithms.

Published in:

Communication Networks and Services Research Conference, 2005. Proceedings of the 3rd Annual

Date of Conference:

16-18 May 2005