Title :
Exact queueing analysis of discrete time tandems with arbitrary arrival processes
Author :
Neely, Michael J.
Author_Institution :
Southern California Univ., CA, USA
Abstract :
We consider a discrete time tandem of queues serving fixed length packets, where each queue can serve a single packet during a timeslot. Arrivals and departures take place at each stage according to arbitrary stochastic processes. Using the sample path techniques and stochastic coupling methods, we present an exact analysis of the queue occupancy distribution at each stage when all queues operate according to the furthest-to-go service discipline. Explicit expressions for average queue occupancies are provided in terms of the average occupancy in a single queue with a superposition of the original inputs. To our knowledge, this is the first analysis of a multi-input multi-output queueing network yielding exact solutions for general arrival processes.
Keywords :
MIMO systems; discrete time systems; queueing theory; scheduling; stochastic processes; telecommunication services; arbitrary arrival processes; discrete time tandems; exact queueing analysis; furthest-to-go service discipline; multiinput multioutput queueing network; nearest-to-go service discipline; network calculus; packet scheduling; queue occupancy distribution; sample path techniques; stochastic coupling methods; stochastic processes; Calculus; Computer networks; Network topology; Quantum computing; Queueing analysis; Routing; Steady-state; Stochastic processes; Telecommunication traffic; Traffic control;
Conference_Titel :
Communications, 2004 IEEE International Conference on
Print_ISBN :
0-7803-8533-0
DOI :
10.1109/ICC.2004.1312912