Recurrence times of buffer overflows in Jackson networks

DOI10.1109/18.179346zbMath0795.68009OpenAlexW2155228409MaRDI QIDQ4034435

Michael R. Frater, Sean P. Meyn

Publication date: 16 May 1993

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.179346

zbMATH Keywords

Markov processesJackson networksbuffer overflows

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items

Rare events for stationary processes. ⋮ Asymptotics of first passage times for random walk in an orthant