Recurrence times of buffer overflows in Jackson networks

DOI10.1109/18.179346zbMATH Open0795.68009OpenAlexW2155228409MaRDI QIDQ4034435FDOQ4034435

Authors 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)

Recommendations

• Optimally efficient estimation of the statistics of rare events in queueing networks
• Fast simulation of buffer overflows in tandem networks of \(GI/GI/1\) queues
• Efficient simulation of buffer overflow probabilities in Jackson networks with feedback
• Buffer overflow asymptotics for a buffer handling many traffic sources
• Asymptotically optimal importance sampling for Jackson networks with a tree topology

Cited in

(4)

• On probability estimation of buffer overflow for communication networks
• Rare events for stationary processes.
• Self-prevention of socket buffer overflow
• Asymptotics of first passage times for random walk in an orthant

This page was built for publication: Recurrence times of buffer overflows in Jackson networks

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