Discrete Time Queueing Systems (original) (raw)

Computer Networks and Systems, 1994

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 networkwide basis, multiple events may occur during each slot.

sanqi li hasn't uploaded this paper.

Let sanqi know you want this paper to be uploaded.

Ask for this paper to be uploaded.