000			03947nas|a2200385 i 4500
005			20260817171024.0
008			230399s1999 th uzm rtt 00| a1eng d
035			_a.b11782559
099		9	_aAIT RSPR no. TC-99-04
100	0		_aBhichate Chiewthanakul
245	1	0	_aBandwidth allocation scheme in ATM networks based on virtual path for different quality of service (QoS) requirements
260			_aBangkok : _bAsian Institute of Technology, _c1999
300			_a85 p.
490	1		_aResearch studies project report ; _vno. TC-99-04
500			_aA research study submitted in partial fulfillment of the requirement for the degree of Master of Engineering
502			_aResearch Studies Project Report (M.Eng.) - Asian Institute of Technology, 1999
520			_aBandwidth 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.
650		0	_aAsynchronous transfer mode
700	0		_aTeerapat Sanguankotchakorn, _eChairperson
700	1		_aRajatheva, R.M.A.P, _eExamination Committee
700	0		_aVatcharaporn Esichaikul, _eExamination Committee
710	2		_aKhon Kaen University, _eScholarship donor
810	2		_aAsian Institute of Technology. _tResearch studies project report ; _vno. TC-99-04
856			_3Full-Text _uhttp://203.159.5.9/ait-thesis/detail.php?q=B12218
907			_a.b11782559 _bmnait _cu
902			_a240331
998			_b0 _c000323 _dm _ea _fu _g0
945			_lmnait
945			_lmnarc
942			_c22
942			_c40
909			_aBarcode : 30050120552673 _bCREATED : 2013-11-06 _cRECORD # : i12731778 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0
909			_aBarcode : 30050120348965 _bCREATED : 2016-08-06 _cRECORD # : i13025144 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0
999			_c10602 _d10602