000			03667nas|a2200421 a 4500
005			20260817161400.0
008			110114s2010 th uu|m rtt 0| a1eng d
035			_a.b12089047
099		9	_aAIT Thesis no.ICT-10-12
100	0		_aKarin Ngamkajornvivat
245	1	0	_aAccess network resource allocation through utility maximization to delay sensitive traffic
260			_aPathum Thani, Thailand : _bAsian Institute of Technology, _c2010
300			_a34 leaves : _bill. + _e1 online resource
490	1		_aThesis ; _vno. ICT-10-12
500			_aA Submitted in partial fulfillment of the requirements for thedegree of Master of Engineering inInformation and Communications Technologies, School of Engineering and Technology
520			_aThe need of effective congestion control in a network is continuously growing sincethe increasing rate of bandwidth demand is greater than the deployment of the com-munication capacity in access networks. Usage-based pricing is an alternative chargingscheme which is developed for the rate control purpose. This thesis extends the exist-ing algorithms of usage-based pricing which use optimization as a tool to find efficientresource allocation.This thesis considers access network resource allocation for delay sensitive traffic.We incorporate the time-varying property of traffic demands into the existing frame-works of resource allocation based on network utility maximization (NUM). A timeslotted system is considered, where transmission resource are allocated in terms of thenumber of time slots. Each user is assumed to have a utility function which reflectsthe satisfaction level and is modified from existing functions to take into account thedalay sensitivity of traffic demands.The NUM problem with our proposed utility functions is then used as a congestioncontrol algorithm for an access network. The proposed algorithm is evaluated throughcomputer simulation. In the simulation experiments, we study the influences of framesize, number of users and traffic characteristics over the allocation performance. Theperformance is measured in terms of the percentage of successfully delivered packets.The simulation results show that the new algorithm outperforms the baseline techniqueusing the first-in-first-out (FIFO) allocation.
502			_aThesis (M.Eng.) - Asian Institute of Technology, 2010
650		0	_aInternet service providers
700	0		_aPoompat Saengudomlert, _eChairperson
700	0		_aTeerawat Issariyakul, _eCo-Chairperson
700	1		_aRajatheva, R.M.A.P, _eExamination Committee
710	2		_aRoyal Thai Government Fellowship, _eScholarship Donor
810	2		_aAsian Institute of Technology. _tThesis ; _vno. ICT-10-12
856			_3Full-Text _uhttp://203.159.5.9/ait-thesis/detail.php?q=B03159
907			_a.b12089047 _bmnait _cu
902			_a240402
998			_b0 _c110114 _dm _ea _fu _g0
962			_a000:001:PDF:b1208904:000485:0:0:0:0:0:0 _tAbstract-AIT Thesis no.ICT-10-12 _vn
945			_lmnait
945			_lmnait
945			_lmnarc
942			_c20
942			_c40
909			_aBarcode : 30050120822548 _bCREATED : 2011-01-14 _cRECORD # : i12655089 _dLPATRON : 1012683 _eLCHKIN : 2018-01-17 _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 3 _iTOT CHKOUT : 3 _jTOT RENEW : 2
909			_aBarcode : 30050120822530 _bCREATED : 2011-01-14 _cRECORD # : i12655090 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0
909			_aBarcode : 30050160097720 _bCREATED : 2016-04-29 _cRECORD # : i12966836 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0
999			_c1088 _d1088