Title of article
Analysis of Optimal Sets of Survivable Paths in Undirected Simple Graph Applicable for Optical Networks
Author/Authors
Bogdanowicz، نويسنده , , Z.R.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
5
From page
1
To page
5
Abstract
In this work we introduce and describe optimal sets of survivable paths defined on an undirected simple graph G. An optimal set of survivable paths in G corresponds to a set of mesh-restored lightpaths in an optical network that minimizes the number of optical channels. We present several fundamental properties of optimal sets of survivable paths in G.
Keywords
ROUTING , Network survivability , shortest paths
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2005
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454068
Link To Document