Advertisement

Discrete Time Queueing Systems

Chapter
  • 329 Downloads

Abstract

The study of continuous time queueing systems goes back to the early work of Erlang. However a somewhat different model, that of discrete time queueing systems, has recently been the subject of increasing attention. In a discrete time model time is assumed to be “slotted”. That is, time consists of a concatenation of fixed length intervals known as slots. Events are constrained to take place during these slots. For instance, a discrete time queue might accept at most one packet during a slot and service at most one packet during a slot. On a network-wide basis, multiple events may occur during each slot.

Keywords

Time Slot Discrete Time Markov Chain Switching Element State Transition Diagram Bernoulli Process 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  1. 1.Department of Electrical EngineeringSUNY Stony BrookStony BrookUSA

Personalised recommendations