Sciweavers

29 search results - page 1 / 6
» Blocking in Wavelength Routing Networks, Part 1: The Single ...
Sort
View
INFOCOM
1999
IEEE
13 years 8 months ago
Blocking in Wavelength Routing Networks, Part 1: The Single Path Case
Yuhong Zhu, George N. Rouskas, Harry G. Perros
NETWORKING
2000
13 years 5 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
NETWORKS
2002
13 years 4 months ago
Approximation algorithms for constructing wavelength routing networks
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
Refael Hassin, Asaf Levin
INFOCOM
2003
IEEE
13 years 9 months ago
Minimizing Request Blocking in All-Optical Rings
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
Christos Nomikos, Aris Pagourtzis, Stathis Zachos
PODC
1997
ACM
13 years 8 months ago
Dynamic Wavelength Allocation in Optical Networks
This paper proposes algorithms for allocation of wavelengths to connections (lightpaths) in optical wavelength division multiplexed networks, predominantly for ring topologies. Th...
Ornan Ori Gerstel, Galen H. Sasaki, Shay Kutten, R...