Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

INFOCOM
1995
IEEE

favoriteEmaildiscussreport

132views Communications» more INFOCOM 1995»

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

13 years 8 months ago

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

Download www.ee.unlv.edu

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

Real-time Traffic

All-optical Networks | Communications | INFOCOM 1995 | Routing | Wavelength Division Multiplexing |

claim paper

Related Content

» Blocking Model for AllOptical OverlaidStar TDM Networks

» Computing Blocking Probabilities in Multiclass Wavelength Routing Networks

» Approximating multiskill blocking systems by HyperExponential Decomposition

» Analysis and Provisioning of a CircuitSwitched Link with VariableDemand Customers

» On the Tradeoff Between Blocking and Dropping Probabilities in Multicell CDMA Networks

» Efficient Approximations for Call Admission Control Performance Evaluations in MultiServic...

» MultiClass Bandwidth Allocation Policy for 3G Wireless Networks

» Approximate analysis of blocking queueing networks with temporal dependence

» On the Concentration of Expectation and Approximate Inference in Layered Networks

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1995
Where	INFOCOM
Authors	Alexander Birman

Comments (0)