Overflow probability for a discrete-time queue with non-stationary multiplexed input

DOI10.1023/A:1019134726750MaRDI QIDQ1859073zbMATH OpenFDO

Authors Yanyan Li, Kazutomo Kobayashi, Yukio Takahashi

Publication date 17 February 2003

Published in Telecommunication Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1019134726750

Mathematics Subject Classification ID

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

Recommendations

• Asymptotics for transient and stationary probabilities for finite and infinite buffer discrete time queues
• Overflow behavior in queues with many long-tailed inputs
• Exact overflow asymptotics for queues with many Gaussian inputs
• Overflow and losses in a network queue with a self-similar input
• Overflow Asymptotics for large Communications Systems with General Markov Fluid Sources

Cited in

(7)

• Asymptotics for transient and stationary probabilities for finite and infinite buffer discrete time queues
• Overflow and losses in a network queue with a self-similar input
• On a lower asymptotic bound of the overflow probability in a fluid queue with a heterogeneous fractional input
• Lévy processes with two-sided reflection
• On the Overflow Process from a Finite Markovian Queue
• Exact overflow asymptotics for queues with many Gaussian inputs
• A Note on Evaluating the Overflow Probability Using the Infinite Queue

This page was built for publication: Overflow probability for a discrete-time queue with non-stationary multiplexed input

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