<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Adaptive quality-of-service routing for the Internet</title>
  </titleInfo>
  <name type="personal">
    <namePart>Kitt Tientanopajai</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Kanchana Kanchanasut</namePart>
    <role>
      <roleTerm type="text">Chairperson</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Ahmed, Kazi Mohiuddin</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Vatcharaporn Esichaikul</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="corporate">
    <namePart>Ministry of University Affairs Government of Thailand</namePart>
    <role>
      <roleTerm type="text">Scholarship donor</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="marc">series</genre>
  <genre authority="marc">technical report</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">th</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Pathum Thani, Thailand</placeTerm>
    </place>
    <publisher>Asian Institute of Technology</publisher>
    <dateIssued>2005</dateIssued>
    <issuance>continuing</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <extent>64 p. : ill.</extent>
  </physicalDescription>
  <abstract>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.</abstract>
  <note>A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Engineering, Schoool of Advanced Technologies</note>
  <note>Thesis (Ph.D.) - Asian Institute of Technology, 2005</note>
  <subject authority="lcsh">
    <topic>Routers (Computer networks)</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Internet</topic>
  </subject>
  <relatedItem type="series">
    <titleInfo>
      <title>Dissertation ; no. CS-05-02</title>
    </titleInfo>
    <name type="corporate">
      <namePart>Asian Institute of Technology.</namePart>
      <namePart/>
    </name>
  </relatedItem>
  <identifier type="uri">http://203.159.5.9/ait-thesis/detail.php?q=B00275</identifier>
  <location>
    <url displayLabel="Full-Text">http://203.159.5.9/ait-thesis/detail.php?q=B00275</url>
  </location>
  <recordInfo>
    <recordCreationDate encoding="marc">060404</recordCreationDate>
    <recordChangeDate encoding="iso8601">20260817161529.0</recordChangeDate>
  </recordInfo>
</mods>
