Computable exponential bounds for intree networks with routing

In this paper, we refine the calculus proposed previously by Chang et al. (1994). The new calculus, including network operations for multiplexing, input-output relation, and routing, allows us to compute tighter exponential bounds for the tail distributions of queue lengths in intree networks with r...

Full description

Saved in:
Bibliographic Details
Published inProceedings of INFOCOM'95 Vol. 1; pp. 197 - 204 vol.1
Main Authors Cheng-Shang Chang, Jay Cheng
Format Conference Proceeding
LanguageEnglish
Published IEEE 1995
Subjects
Autoregressive processes
Bandwidth
Calculus
Computer networks
Distributed computing
Equations
Random variables
Routing
Stochastic processes
Upper bound
Online AccessGet full text

Cover

More Information
Summary:In this paper, we refine the calculus proposed previously by Chang et al. (1994). The new calculus, including network operations for multiplexing, input-output relation, and routing, allows us to compute tighter exponential bounds for the tail distributions of queue lengths in intree networks with routing. In particular, if external arrival processes and routing processes are either Markov arrival processes or autoregressive processes, the stationary queue length at a local node is stochastically bounded above by the sum of a constant and an Erlang random variable. The decay rate of the Erlang random variable is not greater than (in some cases equal to) the decay rate of the tail distribution of the stationary queue length. The number of stages of the Erlang random variable is the number of external arrival processes and routing processes contributing to its queue length. For the single queue case, both the lower and upper-bounds are derived.
ISBN:081866990X
9780818669903
ISSN:0743-166X
2641-9874
DOI:10.1109/INFCOM.1995.515877