Dependable WDM networks with edge-disjoint P-cycles

Chuan-Ching Sue, Yung Chiao Chen, Min Shao Shieh, Sy Yen Kuo

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In this paper, we propose a fault tolerant mechanism on the optical network design with edge-disjoint P-cycles (EDPC). EDPC is a special type of traditional P-cycles, that is, no common edges are allowed to exist between any two P-cycles. Previously published schemes for computing P-cycles are time consuming and do not survive multiple link failures when P-cycles have common edges. Instead of using the complex ILP, a heuristic method based on link state routing which is compatible to the traditional open shortest path first (OSPF) network protocol is proposed to speed up the construction of EDPC. The results show that the EDPC method can tolerate more link failures and improve the restoration efficiency for traditional P-cycles with the decrease of two working units for every two P-cycles.

Original languageEnglish
Pages (from-to)804-814
Number of pages11
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3358
Publication statusPublished - 2004 Dec 1

Fingerprint

Inductive logic programming (ILP)
WDM Networks
Heuristic methods
Fiber optic networks
Wavelength division multiplexing
Restoration
Disjoint
Network protocols
Cycle
Network Protocols
Optical Design
Optical Networks
Heuristic Method
Network Design
Fault-tolerant
Shortest path
Speedup
Routing

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{ac0336ff45ec4011a9bce201c59a7165,
title = "Dependable WDM networks with edge-disjoint P-cycles",
abstract = "In this paper, we propose a fault tolerant mechanism on the optical network design with edge-disjoint P-cycles (EDPC). EDPC is a special type of traditional P-cycles, that is, no common edges are allowed to exist between any two P-cycles. Previously published schemes for computing P-cycles are time consuming and do not survive multiple link failures when P-cycles have common edges. Instead of using the complex ILP, a heuristic method based on link state routing which is compatible to the traditional open shortest path first (OSPF) network protocol is proposed to speed up the construction of EDPC. The results show that the EDPC method can tolerate more link failures and improve the restoration efficiency for traditional P-cycles with the decrease of two working units for every two P-cycles.",
author = "Chuan-Ching Sue and Chen, {Yung Chiao} and Shieh, {Min Shao} and Kuo, {Sy Yen}",
year = "2004",
month = "12",
day = "1",
language = "English",
volume = "3358",
pages = "804--814",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

Dependable WDM networks with edge-disjoint P-cycles. / Sue, Chuan-Ching; Chen, Yung Chiao; Shieh, Min Shao; Kuo, Sy Yen.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 3358, 01.12.2004, p. 804-814.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Dependable WDM networks with edge-disjoint P-cycles

AU - Sue, Chuan-Ching

AU - Chen, Yung Chiao

AU - Shieh, Min Shao

AU - Kuo, Sy Yen

PY - 2004/12/1

Y1 - 2004/12/1

N2 - In this paper, we propose a fault tolerant mechanism on the optical network design with edge-disjoint P-cycles (EDPC). EDPC is a special type of traditional P-cycles, that is, no common edges are allowed to exist between any two P-cycles. Previously published schemes for computing P-cycles are time consuming and do not survive multiple link failures when P-cycles have common edges. Instead of using the complex ILP, a heuristic method based on link state routing which is compatible to the traditional open shortest path first (OSPF) network protocol is proposed to speed up the construction of EDPC. The results show that the EDPC method can tolerate more link failures and improve the restoration efficiency for traditional P-cycles with the decrease of two working units for every two P-cycles.

AB - In this paper, we propose a fault tolerant mechanism on the optical network design with edge-disjoint P-cycles (EDPC). EDPC is a special type of traditional P-cycles, that is, no common edges are allowed to exist between any two P-cycles. Previously published schemes for computing P-cycles are time consuming and do not survive multiple link failures when P-cycles have common edges. Instead of using the complex ILP, a heuristic method based on link state routing which is compatible to the traditional open shortest path first (OSPF) network protocol is proposed to speed up the construction of EDPC. The results show that the EDPC method can tolerate more link failures and improve the restoration efficiency for traditional P-cycles with the decrease of two working units for every two P-cycles.

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

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

M3 - Article

VL - 3358

SP - 804

EP - 814

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -