Sciweavers

Share
37 search results - page 1 / 8
» Computing Approximate Blocking Probabilities for a Class of ...
Sort
View
INFOCOM
1995
IEEE
9 years 4 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
GLOBECOM
2006
IEEE
9 years 7 months ago
Blocking Model for All-Optical Overlaid-Star TDM Networks
—This paper studies the blocking performance of a class of all-optical overlaid-star TDM networks using a leastcongested-path routing strategy for path selection. An analytical m...
Jun Zheng, Cheng Peng, Gregor von Bochmann
NETWORKING
2000
9 years 2 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
PE
2006
Springer
125views Optimization» more  PE 2006»
9 years 1 months ago
Approximating multi-skill blocking systems by HyperExponential Decomposition
We consider multi-class blocking systems in which jobs require a single processing step. There are groups of servers that can each serve a different subset of all job classes. The...
Geert Jan Franx, Ger Koole, Auke Pot
TELETRAFFIC
2007
Springer
9 years 7 months ago
Analysis and Provisioning of a Circuit-Switched Link with Variable-Demand Customers
We consider a single circuit-switched communication link, depicted by a Erlang multi-class loss queue, where a customer may vary its required bandwidth during its service. We obtai...
Wenhong Tian, Harry G. Perros
books