IEEE/ACM Transactions on Networking · 1993 · 561 citations · 15 references
ComputingComputer ScienceComputer SystemsComputer NetworksProbability TheoryQueuing TheoryBuffer ManagementNetwork Performance AnalysisQueueing AnalysisQueueing NetworksQueueing SystemsQueueing TheoryBandwidthBuffer Occupancy DistributionLoss Probability EstimationNetwork Traffic ModelingNon-markovian Queueing NetworksService Rate Analysis
The authors show the existence of effective bandwidths for multiclass Markov fluids and other types of sources that are used to model ATM traffic. More precisely, it is shown that when such sources share a buffer with deterministic service rate, a constraint on the tail of the buffer occupancy distribution is a linear constraint on the number of sources. That is, for a small loss probability one can assume that each source transmits at a fixed rate called its effective bandwidth. When traffic parameters are known, effective bandwidths can be calculated and may be used to obtain a circuit-switched style call acceptance and routing algorithm for ATM networks. The important feature of the effective bandwidth of a source is that it is a characteristic of that source and the acceptable loss probability only. Thus, the effective bandwidth of a source does not depend on the number of sources sharing the buffer or the model parameters of other types of sources sharing the buffer.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
15
Effective bandwidths at multi-class queues
F. P. Kelly · Queueing Systems · 1991 · 467 citations
Large Deviations for a General Class of Random Vectors
Richard S. Ellis · The Annals of Probability · 1984 · 403 citations · Full text