By Topic

Adjustable multi-constrained routing with a novel evaluation method

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

3 Author(s)
Yong Cui ; Dept. of Comput. Sci., Tsinghua Univ., Beijing, China ; Ke Xu ; Jianping Wu

Quality-of-service routing (QoSR) with multiple constraints, which seeks to find a feasible path satisfying multiple constraints simultaneously, is a challenging problem of the next-generation networks. For its NP-complete complexity, we propose an adjustable heuristic based on converting multiple QoS weights to a single metric with energy functions. By applying the breadth-first search (BFS) to Dijkstra's algorithm with adjustable depth, BFS _MCP (BFS for multi-constrained paths) can adjust its time complexity according to the CPU load on a router in real time. Thus, it has an extensive adaptability. Additionally, we propose a novel approach to performance evaluation by generating QoS constraints, named weight-proportion simulation. Generating QoS constraints similar to QoS applications, this method extends the original success ratio, only used in relative performance comparison, to the evaluation of absolute performance. By this method, extensive simulations show that BFS improves the performance greatly. The main contribution of the paper includes a heuristic for multi-constrained routing and a novel approach to performance evaluation.

Published in:

Performance, Computing, and Communications Conference, 2003. Conference Proceedings of the 2003 IEEE International

Date of Conference:

9-11 April 2003