| 000 | 03151nas|a2200445 a 4500 | ||
|---|---|---|---|
| 005 | 20260817161529.0 | ||
| 008 | 060404s2005 th uu|m rtt 0| a1eng d | ||
| 035 | _a.b11984673 | ||
| 099 | 9 | _aAIT Diss. no.CS-05-02 | |
| 100 | 0 | _aKitt Tientanopajai | |
| 245 | 1 | 0 | _aAdaptive quality-of-service routing for the Internet |
| 260 |
_aPathum Thani, Thailand : _bAsian Institute of Technology, _c2005 |
||
| 300 |
_a64 p. : _bill. |
||
| 490 | 1 |
_aDissertation ; _vno. CS-05-02 |
|
| 500 | _aA dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Engineering, Schoool of Advanced Technologies | ||
| 502 | _aThesis (Ph.D.) - Asian Institute of Technology, 2005 | ||
| 520 | _aThis thesis presents a path-vector protocol to support QoS-based routing. The protocol allows nodes in the network to exchange paths, and construct new paths using the distributed algorithm implemented. Explicit paths provided by the protocol could be used for both QoS and best-effort services. To maintain the scalability, the protocol reduces the number of paths by using a clustering method. The method searches and removes paths based on similarity of measurements of path metrics. The results from simulations show that the protocol scales quite well to the size of the network and is capable to provides paths for different kinds of constraints. The clustering algorithm dramatically reduces the number of paths compared to a generic path-vector algorithm. Still, the algorithm can achieve higher average success rate of QoS path setup, and smaller average number of hops compared to the existing QoS path computation algorithms. | ||
| 650 | 0 | _aRouters (Computer networks) | |
| 650 | 0 | _aInternet | |
| 700 | 0 |
_aKanchana Kanchanasut, _eChairperson |
|
| 700 | 1 |
_aAhmed, Kazi Mohiuddin, _eExamination Committee |
|
| 700 | 0 |
_aVatcharaporn Esichaikul, _eExamination Committee |
|
| 710 | 2 |
_aMinistry of University Affairs Government of Thailand, _eScholarship donor |
|
| 810 | 2 |
_aAsian Institute of Technology. _tDissertation ; _vno. CS-05-02 |
|
| 856 |
_3Full-Text _uhttp://203.159.5.9/ait-thesis/detail.php?q=B00275 |
||
| 907 |
_a.b11984673 _bmnait _cu |
||
| 902 | _a240401 | ||
| 998 |
_b0 _c060327 _dm _ea _fu _g0 |
||
| 945 | _lmnait | ||
| 945 | _lmnait | ||
| 945 | _lmnarc | ||
| 945 | _lmnarc | ||
| 942 | _c20 | ||
| 942 | _c40 | ||
| 909 |
_aBarcode : 30050120570659 _bCREATED : 2006-03-27 _cRECORD # : i12481385 _dLPATRON : 1021211 _eLCHKIN : 2009-09-25 _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 2 _jTOT RENEW : 1 |
||
| 909 |
_aBarcode : 30050120570626 _bCREATED : 2006-03-27 _cRECORD # : i12481397 _dLPATRON : 1015151 _eLCHKIN : 2019-03-27 _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 3 _jTOT RENEW : 7 |
||
| 909 |
_aBarcode : 30050120570642 _bCREATED : 2013-11-29 _cRECORD # : i12749576 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 909 |
_aBarcode : 30050160037346 _bCREATED : 2016-01-25 _cRECORD # : i12873378 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 999 |
_c1626 _d1626 |
||