Sciweavers

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

5

CN
2007

favoriteEmaildiscussreport

79views more CN 2007»

A new method for approximating blocking probability in overflow loss networks

13 years 4 months ago

A new method for approximating blocking probability in overflow loss networks

Download www.ee.cityu.edu.hk

Eric W. M. Wong, Andrew Zalesky, Zvi Rosberg, Mosh

Real-time Traffic

CN 2007 |

claim paper

Related Content

» Approximating multiskill blocking systems by HyperExponential Decomposition

» CallBurst Blocking Probabilities of ONOFF Traffic Sources under the Bandwidth Reservation ...

» Performance Evaluation of Loss Networks via Factor Graphs and the SumProduct Algorithm

» Approximation Techniques for the Analysis of Large TrafficGroomed Tandem Optical Networks

» An ONOFF MultiRate Loss Model of Finite Sources

» Performance Analysis of Reassembly and Multiplexing Queueing with LongRangeDependent Input...

» Protection and Restoration from Link Failures in DWDM Networks A CrossLayer Study

» On the impact of soft handoff in cellular systems

» QoS Guaranteed Voice Traffic Multiplexing Scheme over VoIP Network Using DiffServ

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2007
Where	CN
Authors	Eric W. M. Wong, Andrew Zalesky, Zvi Rosberg, Moshe Zukerman

Comments (0)