Please use this identifier to cite or link to this item:

Modified fair queueing for finite buffer in ATM networks

Authors Lai, A.M.O.
Tsang, D.H.K. View this author's profile
Issue Date 1999
Source IEEE International Conference on Communications , v. 1, 1999, p. 193-198
Summary Service scheduling scheme that controls the order of servicing cells within an ATM node is very important in providing guaranteed services. Much attention of recent research have been paid on emulating the General Processor Sharing (GPS) system as closely as possible with low computational complexity. The primary motivation of emulating the GPS system is to provide traffic isolation and thus to achieve a maximum delay bound. This delay bound is guaranteed by guaranteeing the minimum bandwidth. However, after guaranteeing the minimum bandwidth, some excess bandwidth might be leftover and we argue that it should be used more intelligently to improve other system performance. In this paper, we propose a novel scheduling scheme that guarantees each traffic stream a minimum bandwidth while achieving a low cell loss probability in a finite buffer ATM node. © 1999 IEEE.
ISSN 0536-1486
ISBN 0-7803-5284-X
Rights © 1999 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Language English
Format Article
Access View full-text via DOI
View full-text via Scopus
Files in this item:
File Description Size Format
icc99_arthur.pdf 222500 B Adobe PDF