Blocking Probabilities for an Underloaded or Overloaded Link with Trunk Reservation

DOI10.1137/S0036139903426599zbMath1091.94002OpenAlexW2031950454MaRDI QIDQ5700584

Charles Knessl, John A. Morrison

Publication date: 28 October 2005

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0036139903426599

zbMATH Keywords

queueingasymptoticsblockingtrunk reservation

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queueing theory (aspects of probability theory) (60K25) Communication theory (94A05)

Related Items (3)

Optimal trunk reservation for an overloaded link ⋮ Asymptotic analysis of a loss model with trunk reservation. I: Trunks reserved for fast traffic ⋮ Asymptotic Analysis of a Loss Model with Trunk Reservation II: Trunks Reserved for Slow Traffic

This page was built for publication: Blocking Probabilities for an Underloaded or Overloaded Link with Trunk Reservation