𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new method for approximating blocking probability in overflow loss networks

✍ Scribed by Eric W.M. Wong; Andrew Zalesky; Zvi Rosberg; Moshe Zukerman

Book ID
118435190
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
446 KB
Volume
51
Category
Article
ISSN
1389-1286

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A new convolution algorithm for loss pro
A new convolution algorithm for loss probability analysis in multiservice networks
✍ Qian Huang; King-Tim Ko; Villy BΓ¦k Iversen πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 403 KB

Performance analysis in multiservice loss systems generally focuses on accurate and efficient calculation methods for traffic loss probability. Convolution algorithm is one of the existing efficient numerical methods. Exact loss probabilities are obtainable from the convolution algorithm in systems

A new method for approximating passive n
A new method for approximating passive network functions
✍ H. J. Carlin; P. Kotiveeriah πŸ“‚ Article πŸ“… 1974 πŸ› John Wiley and Sons 🌐 English βš– 736 KB

## Abstract The problem of efficiently approximating real frequency data, which represents either measured information of a physical system or idealized curves to be realized by rational positive real (PR) or bounded real (BR) functions is considered. The final rational function is guaranteed in ad