A new method for approximating blocking probability in overflow loss networks

DOI10.1016/J.COMNET.2006.12.007zbMATH Open1120.68028OpenAlexW2165390190WikidataQ61606332 ScholiaQ61606332MaRDI QIDQ2372095FDOQ2372095

Authors: Eric W. M. Wong, Andrew Zalesky, Zvi Rosberg, Moshe Zukerman 

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

Recommendations

• On the accuracy of the OPC approximation for a symmetric overflow loss model
• A Note on Evaluating the Overflow Probability Using the Infinite Queue
• Approximation for overflow moments of a multiservice link with trunk reservation
• Fast simulation of blocking probabilities in loss networks
• A reduced load approximation accounting for link interactions in a loss network

zbMATH Keywords

blocking probabilityErlang's fixed-point approximationoverflow loss networkoverflow priority classificationreduced-load approximation

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)

Cited In (1)

• On the accuracy of the OPC approximation for a symmetric overflow loss model

This page was built for publication: A new method for approximating blocking probability in overflow loss networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372095)