Improved quasi-path restoration in mesh networks

Authors:
Maulin Patel;R. Chandrasekaran;S. Venkatesan
Affiliations:
Philips Research N.A., Briarcliff Manor, NY and University of Texas at Dallas, Richardson, TX;University of Texas at Dallas, Richardson, TX;University of Texas at Dallas, Richardson, TX
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2008

Citing 14
Cited 0

A new approach to the maximum-flow problem

Journal of the ACM (JACM)
The hop-limit approach for spare-capacity assignment in survivable networks

IEEE/ACM Transactions on Networking (TON)
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks

IEEE/ACM Transactions on Networking (TON)
Restoration strategies and spare capacity requirements in self-healing ATM networks

IEEE/ACM Transactions on Networking (TON)
Two-Commodity Flow

Journal of the ACM (JACM)
An efficient primary-segmented backup scheme for dependable real-time communication in multihop networks

IEEE/ACM Transactions on Networking (TON)
Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels

IEEE/ACM Transactions on Networking (TON)
Comparing Restoration Concepts Using Optimal Network Configurations with Integrated Hardware and Routing Decisions

Journal of Network and Systems Management
Shared risk link group (SRLG)-diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networks

IEEE/ACM Transactions on Networking (TON)
A Distributed Algorithm for Path Restoration in Circuit Switched Communication Networks

SRDS '05 Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems
Resilience in multilayer networks

IEEE Communications Magazine
Dimensioning of survivable WDM networks

IEEE Journal on Selected Areas in Communications
Novel algorithms for shared segment protection

IEEE Journal on Selected Areas in Communications
Failure protection in layered networks with shared risk link groups

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Restoration of disrupted traffic is critical in today's high-speed self-healing telecommunication networks. A restoration scheme dynamically discovers alternate paths bypassing the failed component. This paper presents an (online) improved quasi-path restoration (IQPR) scheme. IQPR is derived from the two-commodity max-flow algorithm. The running time complexity of IQPR is O(|V|3). Therefore, IQPR is computationally more efficient and more scalable than path restoration (PR). IQPR is faster (in restoration speed) and less complex than PR, and more economical (in spare capacity requirement) than link restoration (LR). Thus, it provides a good alternative to PR when quick restoration of disrupted traffic is desired. The (offline) spare capacity planning problem deals with the allocation of spare capacity to each link in the network, such that the spare capacity requirement is minimized, while guaranteeing the desired level of restoration in the event of a link failure. The spare capacity allocation problems for LR, original quasi-path restoration (OQPR), IQPR, link-disjoint path restoration (LDPR) and PR are formulated as integer linear programming problems. Numerical results illustrate that the restoration schemes studied can be sorted from the least efficient to the most efficient (in the spare capacity requirement) in the following order: LR, OQPR, IQPR, LDPR and PR. The experimental analysis shows that network topology and demand patterns have a significant impact on the spare capacity savings offered by one scheme over the other. Merits and demerits of these schemes are also discussed.