|
Abstract : |
We show the existence of eective bandwidths for multiclass Markov uids and other types of sources that are used to model ATM trac. More precisely, we show that when such sources share a buer with deterministic service rate, a constraint on the tail of the buer 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 xed rate called its eective bandwidth. When trac parameters are known, eective 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 eective bandwidth of a source is that it is a characteristic of that source and the acceptable loss probability only. Thus, the eective bandwidth of a source does not depend on the number of sources sharing the buer nor on the model parameters of other types of sources sharing the buer. 2, |
