A FAIR BUFFER ALLOCATION SCHEME

Citation
J. Heinanen et K. Kilkki, A FAIR BUFFER ALLOCATION SCHEME, Computer communications, 21(3), 1998, pp. 220-226
Citations number
9
Categorie Soggetti
Computer Science Software Graphycs Programming","Computer Science Hardware & Architecture","Computer Science Information Systems","Computer Science Information Systems","Computer Science Hardware & Architecture","Computer Science Software Graphycs Programming
Journal title
ISSN journal
01403664
Volume
21
Issue
3
Year of publication
1998
Pages
220 - 226
Database
ISI
SICI code
0140-3664(1998)21:3<220:AFBAS>2.0.ZU;2-R
Abstract
An appropriate service for data traffic in Asynchronous Transfer Mode (ATM) networks requires large buffers in network nodes. However, large buffers without a proper allocation scheme may lead to an unsatisfact ory quality of service. Most present allocation schemes either necessi tate a complicated queueing system or they do not offer a sufficient f airness. This paper describes a rather simple buffer management scheme that results in fair allocation of bandwidth among competing connecti ons by using only a FIFO buffer. The performance and fairness of the a llocation scheme has been analysed by means of a simulation program. ( C) 1998 Published by Elsevier Science B.V.