Sciweavers

46 search results - page 1 / 10
» Computing Blocking Probabilities in Multi-class Wavelength R...
Sort
View
INFOCOM
1995
IEEE
13 years 8 months ago
Computing Approximate Blocking Probabilities for a Class of All-Optical Networks
W e study a class of all-optical networks using wavelength division multiplexing and wavelength routing in which a connection between a pair of nodes in the network is assigned a ...
Alexander Birman
NETWORKING
2000
13 years 6 months ago
Computing Blocking Probabilities in Multi-class Wavelength Routing Networks
We present an approximate analytical method to compute efficiently the call blocking probabilities in wavelength routing networks with multiple classes of calls. The model is fairl...
Sridhar Ramesh, George N. Rouskas, Harry G. Perros
ICC
2007
IEEE
136views Communications» more  ICC 2007»
13 years 11 months ago
A Forward-Backward Optical Wavelength Path Establishment Scheme with Low Blocking Probability in WDM Networks
—we study dynamic routing and wavelength assignment scheme when there are any available wavelengths on a route in the wavelength-routed networks. An optical wavelength path reque...
Shinsuke Nagai, Hirotada Kawakami, Saneyasu Yamagu...
EUC
2004
Springer
13 years 10 months ago
Dynamic Routing and Wavelength Assignment in WDM Networks with Ant-Based Agents
In this paper, we propose an ant-based algorithm for dynamic routing and wavelength assignment (RWA) in WDM optical networks under the wavelength continuity constraint. By adopting...
Son-Hong Ngo, Xiaohong Jiang, Susumu Horiguchi, Mi...
TON
1998
145views more  TON 1998»
13 years 4 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