Full restoration of multiple faults in WDM networks without wavelength conversion

Chuan-Ching Sue, Jun Ying Yeh, Chin Yu Huang

Research output: Contribution to journalConference article

Abstract

This paper addresses the problem of achieving full restoration and tolerating as many faults as possible in wavelength division multiplexing (WDM) networks without the capability of wavelength conversion. The problem of finding the maximum number of faults that can be tolerated is modeled as a constrained ring cover set problem, which is a decomposition problem with exponential complexity. The Face Decomposition Algorithm (PDA) that can tolerate one or more faults is proposed. From the results, we know that the maximum number of faults tolerated can be extended from one significantly under various network topologies.

Original languageEnglish
Pages (from-to)400-405
Number of pages6
JournalProceedings of the Asian Test Symposium
Publication statusPublished - 2004 Dec 1
EventProceedings of the Asian Test Symposium, ATS'04 - Kenting, Taiwan
Duration: 2004 Nov 152004 Nov 17

Fingerprint

Optical frequency conversion
Wavelength division multiplexing
Restoration
Decomposition
Personal digital assistants
Topology

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

@article{25dac99347b74bbf93d4d8bd60da8eec,
title = "Full restoration of multiple faults in WDM networks without wavelength conversion",
abstract = "This paper addresses the problem of achieving full restoration and tolerating as many faults as possible in wavelength division multiplexing (WDM) networks without the capability of wavelength conversion. The problem of finding the maximum number of faults that can be tolerated is modeled as a constrained ring cover set problem, which is a decomposition problem with exponential complexity. The Face Decomposition Algorithm (PDA) that can tolerate one or more faults is proposed. From the results, we know that the maximum number of faults tolerated can be extended from one significantly under various network topologies.",
author = "Chuan-Ching Sue and Yeh, {Jun Ying} and Huang, {Chin Yu}",
year = "2004",
month = "12",
day = "1",
language = "English",
pages = "400--405",
journal = "Proceedings of the Asian Test Symposium",
issn = "1081-7735",
publisher = "IEEE Computer Society",

}

Full restoration of multiple faults in WDM networks without wavelength conversion. / Sue, Chuan-Ching; Yeh, Jun Ying; Huang, Chin Yu.

In: Proceedings of the Asian Test Symposium, 01.12.2004, p. 400-405.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Full restoration of multiple faults in WDM networks without wavelength conversion

AU - Sue, Chuan-Ching

AU - Yeh, Jun Ying

AU - Huang, Chin Yu

PY - 2004/12/1

Y1 - 2004/12/1

N2 - This paper addresses the problem of achieving full restoration and tolerating as many faults as possible in wavelength division multiplexing (WDM) networks without the capability of wavelength conversion. The problem of finding the maximum number of faults that can be tolerated is modeled as a constrained ring cover set problem, which is a decomposition problem with exponential complexity. The Face Decomposition Algorithm (PDA) that can tolerate one or more faults is proposed. From the results, we know that the maximum number of faults tolerated can be extended from one significantly under various network topologies.

AB - This paper addresses the problem of achieving full restoration and tolerating as many faults as possible in wavelength division multiplexing (WDM) networks without the capability of wavelength conversion. The problem of finding the maximum number of faults that can be tolerated is modeled as a constrained ring cover set problem, which is a decomposition problem with exponential complexity. The Face Decomposition Algorithm (PDA) that can tolerate one or more faults is proposed. From the results, we know that the maximum number of faults tolerated can be extended from one significantly under various network topologies.

UR - http://www.scopus.com/inward/record.url?scp=13244250966&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=13244250966&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:13244250966

SP - 400

EP - 405

JO - Proceedings of the Asian Test Symposium

JF - Proceedings of the Asian Test Symposium

SN - 1081-7735

ER -