Nikolenko, Sergey and Kogan, Kirill
Single and Multiple Buffer Processing.
Encyclopedia of Algorithms.
Springer Science+Business Media New York, New York, pp. 1-9.
Buffer management policies are online algorithms that control a limited buffer of packets with homogeneous or heterogeneous characteristics, deciding whether to accept new packets when they arrive, which packets to process and transmit, and possibly whether to push out packets already residing in the buffer. Although settings differ, the problem is always to achieve the best possible competitive ratio, i.e., find a policy with good worst-case guarantees in comparison with an optimal offline clairvoyant algorithm. The policies themselves are often simple, simplicity being an important advantage for implementation in switches; the hard problem is to find proofs of lower
and especially upper bounds for their competitive ratios. Thus, this problem is more theoretical in nature, although the resulting throughput guarantees are important tools in the design of network elements. Comprehensive surveys of this field have been given in the past by Goldwasser and
Epstein and van Stee.
||Buffer management policies; Admission control; Online algorithms
||16 Jan 2015 13:40
||30 Nov 2016 12:32
Actions (login required)