Sciweavers

10 search results - page 1 / 2
» A new method for approximating blocking probability in overf...
Sort
View
CN
2007
79views more  CN 2007»
13 years 4 months ago
A new method for approximating blocking probability in overflow loss networks
Eric W. M. Wong, Andrew Zalesky, Zvi Rosberg, Mosh...
PE
2006
Springer
125views Optimization» more  PE 2006»
13 years 4 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
NETWORKING
2004
13 years 6 months ago
Call-Burst Blocking Probabilities of ON-OFF Traffic Sources under the Bandwidth Reservation Policy
Abstract. We calculate call and burst blocking probabilities (CBP and BBP respectively) in a single link loss system accommodating service-classes of ONOFF traffic calls, either of...
Ioannis D. Moscholios, Michael D. Logothetis
INFOCOM
2007
IEEE
13 years 11 months ago
Performance Evaluation of Loss Networks via Factor Graphs and the Sum-Product Algorithm
— Loss networks provide a powerful tool for the analysis and design of many communication and networking systems. It is well known that a large number of loss networks have produ...
Jian Ni, Sekhar Tatikonda
ANSS
2005
IEEE
13 years 10 months ago
Approximation Techniques for the Analysis of Large Traffic-Groomed Tandem Optical Networks
We consider a traffic-groomed optical network consisting of N nodes arranged in tandem. This optical network is modeled by a tandem queueing network of multi-rate loss queues with...
Alicia Nicki Washington, Chih-Chieh Hsu, Harry G. ...