Bursty traffic and finite capacity queues
From MaRDI portal
Publication:1385352
DOI10.1023/A:1018991225935zbMATH Open0896.90099MaRDI QIDQ1385352FDOQ1385352
Authors: Fergal Toomey 
Publication date: 26 April 1998
Published in: Annals of Operations Research (Search for Journal in Brave)
Recommendations
Cited In (23)
- MODELING BURST TRAFFIC USING A MAP WITH A TREE STRUCTURE
- Large deviation properties of constant rate data streams sharing a buffer with long-range dependent traffic in critical loading
- Analysis of traffic correlation attacks on router queues
- Volume and duration of losses in finite buffer fluid queues
- An efficient implementation of bypass queue under bursty traffic
- Compliance of the Token-Bucket Model with Markovian Traffic
- Burst ratio in the finite-buffer queue with batch Poisson arrivals
- Interlaced processes on the circle
- State-dependent Beneš buffer model with fast loading and output rates
- Asymptotic Analysis of a Queueing Model With Bursty Traffic
- On ``catastrophic behavior of queueing networks
- Responsive buffers - properties in the fluid flow limit
- Characterisation of the output process of a discrete-time \(GI/D/1\) queue, and its application to network performance
- Stochastically bounded burstiness for communication networks
- The burst factor and its impact on buffer performance
- Protecting bursty applications against traffic aggressiveness
- A large deviation principle with queueing applications
- Cell/packet loss behavior in a statistical multiplexer with bursty input
- Traffic overflow in closed queueing models
- Impact of bursty traffic on queues
- Chernoff bounds for mean overflow rates
- Data network models of burstiness
- Burstiness in broadband integrated networks
This page was built for publication: Bursty traffic and finite capacity queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1385352)
