Adaptive quality-of-service routing for the Internet (Record no. 1626)

MARC details
000 -LEADER
fixed length control field 03151nas|a2200445 a 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20260817161529.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 060404s2005 th uu|m rtt 0| a1eng d
035 ## - SYSTEM CONTROL NUMBER
System control number .b11984673
099 #9 - LOCAL FREE-TEXT CALL NUMBER (OCLC)
Classification number AIT Diss. no.CS-05-02
100 0# - MAIN ENTRY--PERSONAL NAME
Personal name Kitt Tientanopajai
245 10 - TITLE STATEMENT
Title Adaptive quality-of-service routing for the Internet
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Pathum Thani, Thailand :
Name of publisher, distributor, etc. Asian Institute of Technology,
Date of publication, distribution, etc. 2005
300 ## - PHYSICAL DESCRIPTION
Extent 64 p. :
Other physical details ill.
490 1# - SERIES STATEMENT
Series statement Dissertation ;
Volume/sequential designation no. CS-05-02
500 ## - GENERAL NOTE
General note A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Engineering, Schoool of Advanced Technologies
502 ## - DISSERTATION NOTE
Dissertation note Thesis (Ph.D.) - Asian Institute of Technology, 2005
520 ## - SUMMARY, ETC.
Summary, etc. This 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 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Routers (Computer networks)
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Internet
700 0# - ADDED ENTRY--PERSONAL NAME
Personal name Kanchana Kanchanasut,
Relator term Chairperson
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Ahmed, Kazi Mohiuddin,
Relator term Examination Committee
700 0# - ADDED ENTRY--PERSONAL NAME
Personal name Vatcharaporn Esichaikul,
Relator term Examination Committee
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element Ministry of University Affairs Government of Thailand,
Relator term Scholarship donor
810 2# - SERIES ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element Asian Institute of Technology.
Title of a work Dissertation ;
Volume/sequential designation no. CS-05-02
856 ## - ELECTRONIC LOCATION AND ACCESS
Materials specified Full-Text
Uniform Resource Identifier <a href="http://203.159.5.9/ait-thesis/detail.php?q=B00275">http://203.159.5.9/ait-thesis/detail.php?q=B00275</a>
907 ## - LOCAL DATA ELEMENT G, LDG (RLIN)
a .b11984673
b mnait
c u
902 ## - LOCAL DATA ELEMENT B, LDB (RLIN)
a 240401
998 ## - LOCAL CONTROL INFORMATION (RLIN)
Operator's initials, OID (RLIN) 0
Cataloger's initials, CIN (RLIN) 060327
First date, FD (RLIN) m
-- a
-- u
-- 0
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l mnait
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l mnait
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l mnarc
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l mnarc
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type 20-AIT Publication
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type 40-Archives
909 ## - LOCAL ITEMS USED
Barcode Barcode : 30050120570659
CREATED CREATED : 2006-03-27
RECORD Id RECORD # : i12481385
LPATRON LPATRON : 1021211
LCHKIN LCHKIN : 2009-09-25
RENEWALS # RENEWALS : 0
-- # OVERDUE : 0
-- IUSE3 : 0
-- TOT CHKOUT : 2
-- TOT RENEW : 1
909 ## - LOCAL ITEMS USED
Barcode Barcode : 30050120570626
CREATED CREATED : 2006-03-27
RECORD Id RECORD # : i12481397
LPATRON LPATRON : 1015151
LCHKIN LCHKIN : 2019-03-27
RENEWALS # RENEWALS : 0
-- # OVERDUE : 0
-- IUSE3 : 0
-- TOT CHKOUT : 3
-- TOT RENEW : 7
909 ## - LOCAL ITEMS USED
Barcode Barcode : 30050120570642
CREATED CREATED : 2013-11-29
RECORD Id RECORD # : i12749576
LPATRON LPATRON : 0
LCHKIN LCHKIN : -
RENEWALS # RENEWALS : 0
-- # OVERDUE : 0
-- IUSE3 : 0
-- TOT CHKOUT : 0
-- TOT RENEW : 0
909 ## - LOCAL ITEMS USED
Barcode Barcode : 30050160037346
CREATED CREATED : 2016-01-25
RECORD Id RECORD # : i12873378
LPATRON LPATRON : 0
LCHKIN LCHKIN : -
RENEWALS # RENEWALS : 0
-- # OVERDUE : 0
-- IUSE3 : 0
-- TOT CHKOUT : 0
-- TOT RENEW : 0
Holdings
Withdrawn status Lost status Damaged status Not for loan Home library Current library Shelving location Date acquired Cost, normal purchase price Total checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
      Available for Loans Asian Institute of Technology Library Asian Institute of Technology Library AIT Publications 17/08/2026 50.00   AIT Diss. no.CS-05-02 30050120570659 17/08/2026 1 17/08/2026 20-AIT Publication
      Available for Loans Asian Institute of Technology Library Asian Institute of Technology Library AIT Publications 17/08/2026 50.00   AIT Diss. no.CS-05-02 30050120570626 17/08/2026 2 17/08/2026 20-AIT Publication
      Available for Loans Asian Institute of Technology Library Asian Institute of Technology Library Archives 17/08/2026 50.00   AIT Diss. no.CS-05-02 30050120570642 17/08/2026 3 17/08/2026 20-AIT Publication
      Available for Loans Asian Institute of Technology Library Asian Institute of Technology Library Archives 17/08/2026     AIT Diss. no.CS-05-02 30050160037346 17/08/2026 1 17/08/2026 40-Archives
คัดลอกแล้ว!