A simple analysis of average queueing delay in tree networks

DOI10.1109/18.485740MaRDI QIDQ4885704zbMATH OpenOpenAlexFDO

Authors Jeffrey E. Wieselthier, Anthony Ephremides, Eytan Modiano

Publication date 28 July 1996

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/210445d8ab26472fc2c10ca2c42bbaaaffef1cc5

zbMATH Keywords

average queueing delayconstant service timepriority disciplinestandem queuetree network of discrete-time queues

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• Equivalent Models for Queueing Analysis of Deterministic Service Time Tree Networks
• scientific article; zbMATH DE number 1263200
• The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks
• A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events

Cited in

(6)

• Equivalent Models for Queueing Analysis of Deterministic Service Time Tree Networks
• scientific article; zbMATH DE number 4022327 (Why is no real title available?)
• Delay analysis of a unidirectional bus network with an erasure station
• On the stochastic end-to-end delay analysis in sink trees under independent and dependent arrivals
• Constant time per edge is optimal on rooted tree networks
• Reduction of a polling network to a single node

This page was built for publication: A simple analysis of average queueing delay in tree networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4885704)