03947nas|a2200385 i 4500 20260817171024.0 230399s1999 th uzm rtt 00| a1eng d .b11782559 AIT RSPR no. TC-99-04 Bhichate Chiewthanakul Bandwidth allocation scheme in ATM networks based on virtual path for different quality of service (QoS) requirements Bangkok : Asian Institute of Technology, 1999 85 p. Research studies project report ; no. TC-99-04 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 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. Asynchronous transfer mode Teerapat Sanguankotchakorn, Chairperson Rajatheva, R.M.A.P, Examination Committee Vatcharaporn Esichaikul, Examination Committee Khon Kaen University, Scholarship donor Asian Institute of Technology. Research studies project report ; no. TC-99-04 Full-Text http://203.159.5.9/ait-thesis/detail.php?q=B12218 .b11782559 mnait u 240331 0 000323 m a u 0 mnait mnarc 22 40 Barcode : 30050120552673 CREATED : 2013-11-06 RECORD # : i12731778 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 Barcode : 30050120348965 CREATED : 2016-08-06 RECORD # : i13025144 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 10602 10602 0 0 0 0 MAIN MAIN mnait 2026-08-17 50.00 0 AIT RSPR no. TC-99-04 30050120552673 2026-08-17 17:10:24 3 2026-08-17 22 0 0 0 0 MAIN MAIN mnarc 2026-08-17 0 AIT RSPR no. TC-99-04 30050120348965 2026-08-17 17:10:24 2026-08-17 40