Bandwidth allocation of multiple QOS classes in ATM environment
|Authors||Chan, Jimmy H.S.
Tsang, Danny H.K.
|Source||Proceedings - IEEE INFOCOM , v. 1, 1994, p. 360-367|
|Summary||For future Broadband-ISDN, Asynchronous Transfer Mode (ATM) is designed not only to support a wide range of traffic classes with diverse flow characteristics (e.g., burstiness, bit rate and burst length), but to guarantee the different quality of service (QOS) requirements as well. The QOS may be measured in terms of cell loss probability and maximum cell delay. In this paper, we consider the ATM networks in which the virtual path (VP) concept is implemented. By applying the Markov Modulated Deterministic Process method, we develop an efficient algorithm to compute the minimum capacity required to satisfy all the QOS requirements when multiple classes of on-off sources are multiplexed onto a single VP. Using the result, we then propose a simple algorithm to determine the VP combination to achieve the near optimum of total capacity required for satisfying the individual QOS requirements. Numerical results are also presented to demonstrate the performance of the algorithm when compared to the optimal total capacity required.|
|Rights||© 1994 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: