Campus Units

Electrical and Computer Engineering

Document Type

Conference Proceeding

Conference

IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies

Publication Version

Accepted Manuscript

Link to Published Version

https://doi.org/10.1109/INFCOM.2000.832576

Publication Date

2000

Journal or Book Title

Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies

Volume

3

First Page

1761

Last Page

1770

DOI

10.1109/INFCOM.2000.832576

Conference Title

IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies

Conference Date

March 26-30, 2000

City

Tel Aviv, Israel

Abstract

This paper considers the problem of dynamically establishing dependable connections (D-connections) with specified failure restoration guarantees in wavelength-routed wavelength division multiplexed (WDM) networks. We call a connection with fault-tolerant requirements a D-connection. We recommend using a proactive approach to fault-tolerance wherein a D-connection is identified with the establishment of a primary and a backup lightpath at the time of honoring the connection request. However, the backup lightpath may not be available to a connection throughout its existence. Upon occurrence of a fault, a failed connection is likely to find its backup path available with a certain specified guarantee. We develop algorithms to select routes and wavelengths to establish D-connections with specified failure restoration guarantees. The algorithms are based on a technique called primary-backup multiplexing. We present an efficient and computationally simple method to estimate the average number of connections per link for which the backup paths are not readily available upon occurrence of a link failure. This measure is used for selecting suitable primary and backup lightpaths for a connection. We conduct extensive simulation experiments to evaluate the effectiveness of the proposed algorithms on different networks. The results show that the blocking performance gain is attractive enough to allow some reduction in guarantee. In particular, under the light load conditions, more than 90% performance gain is achieved at the expense of less than 10% guarantee reduction.

Comments

This is a manuscript of a proceeding published as Mohan, G., and Arun K. Somani. "Routing dependable connections with specified failure restoration guarantees in WDM networks." In Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. vol. 3, pp. 1761-1770. IEEE, 2000. DOI: 10.1109/INFCOM.2000.832576. Posted with permission.

Rights

© 2000 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