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

An ultra-fast shared path protection scheme - distributed partial information management, part II

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)
Dahai Xu ; Dept. of Comput. Sci. & Eng., State Univ. of New York, USA ; Chunming Qiao ; Yizhi Xiong

For pt.I see Chunming Qiao and Dahai Xu, INFOCOM'02, p.302-11, (2002). This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, it is shown that a heuristic algorithm can also have better overall performance than its time-consuming, integer linear programming (ILP) based counterparts in the online case, which is non-intuitive. The proposed heuristic algorithm is useful for developing effective shared path (mesh) protection schemes that establish survivable connections in modern networks. The advantage of our heuristic algorithm over existing algorithms for finding a pair of link (or node) disjoint paths, active path (AP) and backup path (BP), comes from the following salient feature. It uses a so-called potential backup cost (PBC) function when selecting an AP in the first phase, in order to take into consideration the backup bandwidth needed by the corresponding BP yet to be chosen in the second phase. The PBC function is derived mathematically based on a rigorous statistical analysis of experimental data. While the use of PBC only requires partial aggregate information on existing connections and distributed control, it can also be applied even more effectively when complete information is available.

Published in:

Network Protocols, 2002. Proceedings. 10th IEEE International Conference on

Date of Conference:

12-15 Nov. 2002

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.