By Topic

Heuristic algorithms for path selection in private ATM 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

2 Author(s)
Xuedong Jiang ; Dept. of Ind. Eng., Dalhousie Univ., Halifax, NS, Canada ; Tao Yang

The path selection problem is formulated as a shortest path problem with multiple constraints which is known to be NP-complete. We propose heuristic algorithms to find a minimum hop path satisfying the constraints of end-to-end delay requirement, maximum load level on each of its link and minimum probability to pass the local call admission control. The spirit of the proposed heuristic is to transform the constrained shortest path problem into an unconstrained shortest path problem. Simulation study over a large number of randomly generated networks shows that in most cases it is better than existing heuristic algorithms in terms of the call blocking ratio

Published in:

Computer Communications and Networks, 1997. Proceedings., Sixth International Conference on

Date of Conference:

22-25 Sep 1997