A simple analysis of average queueing delay in tree networks

Authors:
E. Modiano;J. E. Wieselthier;A. Ephremides
Affiliations:
Lincoln Lab., MIT, Lexington, MA;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 3

Worst-case traffic in a tree network of ATM multiplexers

IEEE/ACM Transactions on Networking (TON)
Path-wise performance in a tree-type network: Per-stream loss probability, delay, and delay variance analyses

Performance Evaluation
Performance analysis and prediction on VEGA grid

ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	754.84

Visualization

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