Sciweavers

Share
INFOCOM
1995
IEEE

Computing Approximate Blocking Probabilities for a Class of All-Optical Networks

9 years 3 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 path and a wavelength on that path. Moreover, on the links of that path no other connection can share the assigned wavelength. Using a generalized reduced load approximation scheme we calculate the blocking probabilities for the optical network model for two routing schemes: Fixed Routing and Least Loaded Routing.
Alexander Birman
Added 26 Aug 2010
Updated 26 Aug 2010
Type Conference
Year 1995
Where INFOCOM
Authors Alexander Birman
Comments (0)
books