Campus Units

Electrical and Computer Engineering

Document Type

Conference Proceeding

Conference

13th International Conference on Computer Communications and Networks

Publication Version

Accepted Manuscript

Link to Published Version

https://doi.org/10.1109/ICCCN.2004.1401655

Publication Date

2004

Journal or Book Title

Proceedings. 13th International Conference on Computer Communications and Networks

First Page

309

Last Page

314

DOI

10.1109/ICCCN.2004.1401655

Conference Title

13th International Conference on Computer Communications and Networks

Conference Date

October 11-13, 2004

City

Chicago, IL

Abstract

Double link failure models, in which any two links in the network fail in an arbitrary order, are becoming critical in survivable optical network design. A significant finding is that designs offering complete dual-failure restorability require almost triple the amount of spare capacity. In this paper, networks are designed to achieve 100% restorability under single link failures, while maximizing coverage against any second link failure in the network. In the event of a single link failure, the restoration model attempts to dynamically find a second alternate link-disjoint end-to-end path to provide coverage against a sequential overlapping link failure. Sub-graph routing (M. T. Frederick et al., Feb. 2003) is extended to provide dual-failure restorability for a network provisioned to tolerate all single-link failures. This strategy is compared with shared-mesh protection. The results indicate that sub-graph routing can achieve overlapping second link failure restorability for 95-99% of connections. It is also observed that sub-graph routing can inherently provide complete dual-failure coverage for ~72-81% of the connections.

Comments

This is a manuscript of a proceeding published as Frederick, Michael T., Pallab Datta, and Arun K. Somani. "Evaluating dual-failure restorability in mesh-restorable WDM optical networks." In Proceedings. 13th International Conference on Computer Communications and Networks (2004): 309-314. DOI: 10.1109/ICCCN.2004.1401655. Posted with permission.

Rights

© 2004 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Copyright Owner

IEEE

Language

en

File Format

application/pdf

Published Version

Share

Article Location

 
COinS