Sciweavers

99 search results - page 12 / 20
» Comparison of Routing and Wavelength Assignment Algorithms i...
Sort
View
AINA
2008
IEEE
14 years 2 months ago
A New Dynamic Wavelength Assignment Scheme in Wavelength-Convertible WBS Networks
—In the paper, we study the wavelength assignment problem in waveband switching (WBS) networks, which is composed of multi-granular optical cross-connect (MG-OXCs) interconnected...
Ching-Fang Hsu, Fang-Sheng Lin, Ke-Kuan Hsu
NETWORKS
2010
13 years 6 months ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...
TON
1998
145views more  TON 1998»
13 years 7 months ago
Adaptive wavelength routing in all-optical networks
Abstract—In this paper we consider routing and wavelength assignment in wavelength-routed all-optical networks with circuitswitching. The conventional approaches to address this ...
Ahmed Mokhtar, Murat Azizoglu
WAOA
2005
Springer
86views Algorithms» more  WAOA 2005»
14 years 1 months ago
SONET ADMs Minimization with Divisible Paths
We consider an optical routing problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic...
Leah Epstein, Asaf Levin
ICPPW
2002
IEEE
14 years 17 days ago
Finding Multiple Routing Paths in Wide-Area WDM Networks
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
Weifa Liang, Xiaojun Shen