TY  - SER
AU  - Bhichate Chiewthanakul
AU  - Teerapat Sanguankotchakorn,
AU  - Rajatheva,R.M.A.P
AU  - Vatcharaporn Esichaikul,
ED  - Khon Kaen University,
TI  - Bandwidth allocation scheme in ATM networks based on virtual path for different quality of service (QoS) requirements
T2  - Research studies project report
PY  - 1999///
CY  - Bangkok
PB  - Asian Institute of Technology
KW  - Asynchronous transfer mode
N1  - A research study submitted in partial fulfillment of the requirement for the degree of Master of  Engineering; Research Studies Project Report (M.Eng.) - Asian Institute of Technology, 1999
N2  - Bandwidth allocation should very important issues in ATM networks, especially when there are random fluctuating demands for service and variations in the service rates. In order to make A TM safe, ATM is designed not only to support a wide range of traffic classes with diverse flow characteristics but also to guarantee the different quality of service (QoS) requirement as well. The QoS may be measured in terms of cell loss probability and maximum cell delay. This study presents the bandwidth allocation by considering the ATM networks in which the virtual path (VP) concept is implemented. In ATM networks, the bandwidth of virtual paths (VPs) are allocated individually for the support of different traffic classes with different QoS requirements within a VP. A VP combination scheme is a way to assign traffic classes to different VPs for satisfying all the QoS requirements. By applying the Markov Modulated Deterministic Process method, the different models of VP combinations are proposed to compute the minimum capacity and buffer size required to satisfy the entire QoS requirements when multiple classes of on-off sources are multiplexed onto VP. Therefore, five different VP combinations for static VP are proposed to determine the VP combination to achieve the optimum of total capacity and total buffer required for satisfying the individual QoS requirements. It is also referred to as static bandwidth allocation schemes, which may not have good utilization of network resources because of no sharing of bandwidth among VPs. Another approach that makes use of some priority among the VPs can satisfy the different QoS requirements while maintaining efficient network use. By revising the cell loss probability function and an algorithm, the different priority assignments of VP combination are proposed to compute the minimum capacity and buffer size as same as static VP scheme. This scheme is referred to as dynamic bandwidth allocation schemes. In this study, the simulation results of these schemes are presented by evaluating their minimum capacity and buffer requirements. The performance differences of these VP schemes are also evaluated
UR  - http://203.159.5.9/ait-thesis/detail.php?q=B12218
ER  -