A comparison of the sliding window and the leaky bucket

DOI10.1007/BF01158434zbMath0845.90050MaRDI QIDQ1906870

Ward Whitt, Arthur W. Berger

Publication date: 15 September 1996

Published in: Queueing Systems (Search for Journal in Brave)

zbMATH Keywords

high-speed communication networkssliding-windowleaky-bucketpartial characterization of point processes

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (1)

Heavy-traffic extreme-value limits for queues

Cites Work

• Extremes and related properties of random sequences and processes
• Asymptotics for open-loop window flow control
• Maximum Values in Queueing Processes
• Heavy-traffic asymptotic expansions for the asymptotic decay rates in theBMAP/G/1 queue
• Logarithmic asymptotics for steady-state tail probabilities in a single-server queue
• Exponential Approximations for Tail Probabilities in Queues II: Sojourn Time and Workload
• Exponential Approximations for Tail Probabilities in Queues, I: Waiting Times
• Extreme Values in the GI/G/1 Queue

This page was built for publication: A comparison of the sliding window and the leaky bucket