Sciweavers

99 search results - page 16 / 20
» Comparison of Routing and Wavelength Assignment Algorithms i...
Sort
View
ICC
2008
IEEE
167views Communications» more  ICC 2008»
14 years 2 months ago
Clustering Large Optical Networks for Distributed and Dynamic Multicast
—For a large-scale mesh network with dynamic traffic, maintaining the global state information in a centralized fashion is impractical. Hence, distributed schemes are needed to ...
Mohammad Masud Hasan, Jason P. Jue
NETWORKING
2004
13 years 9 months ago
Traffic Grooming in WDM Ring Networks with the Min-Max Objective
We consider the problem of traffic grooming in WDM ring networks. Previous studies have focused on minimizing aggregate representations of the network cost. In this work, we consid...
Bensong Chen, George N. Rouskas, Rudra Dutta
GLOBECOM
2007
IEEE
13 years 9 months ago
QoT-Aware Routing in Impairment-Constrained Optical Networks
—In this paper, we consider the problem of routing and wavelength assignment (RWA) in all-optical networks, where signals propagate in the optical domain (with no electrical rege...
Jun He, Maïté Brandt-Pearce, Yvan Poin...
COMCOM
2006
80views more  COMCOM 2006»
13 years 7 months ago
The prediction-based routing in optical transport networks
In optical networks, the traditional routing problem is generally decoupled into two subproblems, the route selection and the wavelength assignment. Usual RWA (Routing and Wavelen...
Eva Marín-Tordera, Xavier Masip-Bruin, Serg...
JSAC
2006
157views more  JSAC 2006»
13 years 7 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas