Discrete Time Queueing Systems
- 329 Downloads
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.
KeywordsTime Slot Discrete Time Markov Chain Switching Element State Transition Diagram Bernoulli Process
Unable to display preview. Download preview PDF.