Finite buffer scheduling scheme with statistical guarantee for VBR traffic in ATM networks
|Authors||Lai, Arthur M.O.
Tsang, Danny H.K.
|Source||Conference Record / IEEE Global Telecommunications Conference, v. 1, 1998, p. 640-645|
|Summary||A novel service scheduling scheme, the Earliest Deadline First for Finite Buffer (EDF-FB) scheme, is proposed. This scheme provides a statistical Quality-of-Service (QoS) guarantee in a per-VC or per-flow queueing environment with finite buffer size. The scheme is also based on the well-known Earliest Deadline First (EDF). By incorporating buffer occupancy information to avoid buffer overflow in the scheme, a statistical QoS guarantee with a lower cell loss rate compared with the EDF scheme is provided.|
|Rights||© 1998 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.|
View full-text via Scopus
View full-text via Web of Science
Files in this item: