Tight bounds for the tail of the packet waiting time distribution in buffered networks

DOI10.1002/DAC.504zbMath0991.68005OpenAlexW2044849929MaRDI QIDQ2762339

Alan Pearmain, Jonathan M. Pitts, Eric M. Scharf, John Schormans

Publication date: 10 September 2002

Published in: International Journal of Communication Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/dac.504

zbMATH Keywords

queueing networksATM networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Exponential Approximations for Tail Probabilities in Queues, I: Waiting Times

This page was built for publication: Tight bounds for the tail of the packet waiting time distribution in buffered networks