Admission control and routing in ATM networks using inferences frommeasured buffer occupancy
Courcoubetis, C.; Kesidis, G.; Ridder, A.; Walrand, J.; Weber, R.
Communications, IEEE Transactions on
Volume 43, Issue 234, Feb/Mar/Apr 1995 Page(s):1778 - 1784
Digital Object Identifier 10.1109/26.380228
Summary:Addresses the issue of call acceptance and routing in ATM
networks. The goal is to design an algorithm that guarantees bounds on
the fraction of cells lost by a call. The method proposed for call
acceptance and routing does not require models describing the traffic.
Each switch estimates the additional fraction of cells that would be
lost if new calls were routed through the switch. The routing algorithm
uses these estimates. The estimates are obtained by monitoring the
switch operations and extrapolating to the situation where more calls
are routed through the switch. The extrapolation is justified by a
scaling property. To reduce the variance of the estimates, the switches
calculate the cell loss that would occur with virtual buffers. A way to
choose the sizes of the virtual buffers in order to minimize the
variance is discussed. Thus, the switches constantly estimate their
spare capacity. Simulations were performed using Markov fluid sources to
test the validity of the approach
View citation and abstract |
Cart
