A new method for approximating blocking probability in overflow loss networks
DOI10.1016/j.comnet.2006.12.007zbMath1120.68028OpenAlexW2165390190WikidataQ61606332 ScholiaQ61606332MaRDI QIDQ2372095
Andrew Zalesky, Eric W. M. Wong, Moshe Zukerman, Zvi Rosberg
Publication date: 10 July 2007
Published in: Computer Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comnet.2006.12.007
blocking probabilityErlang's fixed-point approximationoverflow loss networkoverflow priority classificationreduced-load approximation
Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
This page was built for publication: A new method for approximating blocking probability in overflow loss networks