Title :
A simple analysis of average queueing delay in tree networks
Author :
Modiano, Eytan ; Wieselthier, Jeffrey E. ; Ephremides, Anthony
Author_Institution :
Lincoln Lab., MIT, Lexington, MA, USA
fDate :
3/1/1996 12:00:00 AM
Abstract :
We develop an approach to the analysis of average queueing delay in a tree network of discrete-time queues with constant service time. The analysis of such systems is pertinent to packet-switched data networks with fixed-length packets. Our solution is based on considering an equivalent network, in which at each node packets in transit are given priority over exogenous arrivals. The solution to the equivalent model is easily computed, and, hence, the solution to the original model can be obtained
Keywords :
data communication; delays; packet switching; queueing theory; average queueing delay; constant service time; discrete-time queues; equivalent network; fixed-length packets; packet-switched data networks; tree networks; Data communication; Delay effects; Information technology; Intelligent networks; Laboratories; Performance analysis; Predictive models; Queueing analysis; Telecommunication traffic; Traffic control;
Journal_Title :
Information Theory, IEEE Transactions on
