File Download
 
Links for fulltext
(May Require Subscription)
 
Supplementary

Conference Paper: 2-Line segment topology aggregation mechanism for QoS routing
  • Basic View
  • Metadata View
  • XML View
Title2-Line segment topology aggregation mechanism for QoS routing
 
AuthorsLi, SSS1
Lui, KS1
 
Issue Date2007
 
CitationIeee Region 10 Annual International Conference, Proceedings/Tencon, 2007 [How to Cite?]
DOI: http://dx.doi.org/10.1109/TENCON.2006.344213
 
AbstractIn the distance-vector routing protocols, a node advertises only the best or the most representative path information to its neighbors. Unfortunately, the best path may not be well-defined in a network with two or more constraints. Previous studies have shown that in order not to have any QoS information loss, information of several paths should be advertised. This is not scalable and a line segment representation is developed to aggregate information of several paths. The mechanism solves the scalability problem at the expense of some information accuracy loss. In this paper, we study a variation of the line segment representation aiming at reducing information loss without much increase in advertisement overhead. The performance of our mechanism is justified by extensive simulations. © 2006 IEEE.
 
DOIhttp://dx.doi.org/10.1109/TENCON.2006.344213
 
ReferencesReferences in Scopus
 
DC FieldValue
dc.contributor.authorLi, SSS
 
dc.contributor.authorLui, KS
 
dc.date.accessioned2010-09-25T18:39:25Z
 
dc.date.available2010-09-25T18:39:25Z
 
dc.date.issued2007
 
dc.description.abstractIn the distance-vector routing protocols, a node advertises only the best or the most representative path information to its neighbors. Unfortunately, the best path may not be well-defined in a network with two or more constraints. Previous studies have shown that in order not to have any QoS information loss, information of several paths should be advertised. This is not scalable and a line segment representation is developed to aggregate information of several paths. The mechanism solves the scalability problem at the expense of some information accuracy loss. In this paper, we study a variation of the line segment representation aiming at reducing information loss without much increase in advertisement overhead. The performance of our mechanism is justified by extensive simulations. © 2006 IEEE.
 
dc.description.natureLink_to_subscribed_fulltext
 
dc.identifier.citationIeee Region 10 Annual International Conference, Proceedings/Tencon, 2007 [How to Cite?]
DOI: http://dx.doi.org/10.1109/TENCON.2006.344213
 
dc.identifier.doihttp://dx.doi.org/10.1109/TENCON.2006.344213
 
dc.identifier.hkuros120702
 
dc.identifier.scopuseid_2-s2.0-34547595978
 
dc.identifier.urihttp://hdl.handle.net/10722/99664
 
dc.languageeng
 
dc.relation.ispartofIEEE Region 10 Annual International Conference, Proceedings/TENCON
 
dc.relation.referencesReferences in Scopus
 
dc.title2-Line segment topology aggregation mechanism for QoS routing
 
dc.typeConference_Paper
 
<?xml encoding="utf-8" version="1.0"?>
<item><contributor.author>Li, SSS</contributor.author>
<contributor.author>Lui, KS</contributor.author>
<date.accessioned>2010-09-25T18:39:25Z</date.accessioned>
<date.available>2010-09-25T18:39:25Z</date.available>
<date.issued>2007</date.issued>
<identifier.citation>Ieee Region 10 Annual International Conference, Proceedings/Tencon, 2007</identifier.citation>
<identifier.uri>http://hdl.handle.net/10722/99664</identifier.uri>
<description.abstract>In the distance-vector routing protocols, a node advertises only the best or the most representative path information to its neighbors. Unfortunately, the best path may not be well-defined in a network with two or more constraints. Previous studies have shown that in order not to have any QoS information loss, information of several paths should be advertised. This is not scalable and a line segment representation is developed to aggregate information of several paths. The mechanism solves the scalability problem at the expense of some information accuracy loss. In this paper, we study a variation of the line segment representation aiming at reducing information loss without much increase in advertisement overhead. The performance of our mechanism is justified by extensive simulations. &#169; 2006 IEEE.</description.abstract>
<language>eng</language>
<relation.ispartof>IEEE Region 10 Annual International Conference, Proceedings/TENCON</relation.ispartof>
<title>2-Line segment topology aggregation mechanism for QoS routing</title>
<type>Conference_Paper</type>
<description.nature>Link_to_subscribed_fulltext</description.nature>
<identifier.doi>10.1109/TENCON.2006.344213</identifier.doi>
<identifier.scopus>eid_2-s2.0-34547595978</identifier.scopus>
<identifier.hkuros>120702</identifier.hkuros>
<relation.references>http://www.scopus.com/mlt/select.url?eid=2-s2.0-34547595978&amp;selection=ref&amp;src=s&amp;origin=recordpage</relation.references>
</item>
Author Affiliations
  1. The University of Hong Kong