Discrete-Time Queues with Constant Service Rate

Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 537)


This chapter provides the necessary background on discrete-time queues with constant service rates. Well-known formulae for the queue occupancy processes are explained. Leaky buckets and associated “(σ, p) constraints” on cell arrival processes are then described. Simple statistical queueing results based on large deviations effective bandwidths approximations are given. Finally, the “worst-case” traffic under (σ, p) and peak-rate constraints is explained.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    At any given time, a queue is said to be “busy” when it is not empty and is said to be “idle” when it is empty. A queue’s occupancy is thereby a sequence of busy periods separated by idle periods.Google Scholar
  2. 2.
    Recall that, under VBR service, the SCR traffic descriptor is an upper bound on EAn and that p ∈(SCR,PCR) is the transmission bandwidth allocated to the connection.Google Scholar

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  1. 1.E&CE DeptUniversity of WaterlooWaterlooCanada

Personalised recommendations