File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: 2-Line segment topology aggregation mechanism for QoS routing

Title2-Line segment topology aggregation mechanism for QoS routing
Authors
Issue Date2007
Citation
Ieee Region 10 Annual International Conference, Proceedings/Tencon, 2007 How to Cite?
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. © 2006 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/99664
References

 

Author Affiliations
  1. The University of Hong Kong
DC FieldValueLanguage
dc.contributor.authorLi, SSSen_HK
dc.contributor.authorLui, KSen_HK
dc.date.accessioned2010-09-25T18:39:25Z-
dc.date.available2010-09-25T18:39:25Z-
dc.date.issued2007en_HK
dc.identifier.citationIeee Region 10 Annual International Conference, Proceedings/Tencon, 2007en_HK
dc.identifier.urihttp://hdl.handle.net/10722/99664-
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.en_HK
dc.languageengen_HK
dc.relation.ispartofIEEE Region 10 Annual International Conference, Proceedings/TENCONen_HK
dc.title2-Line segment topology aggregation mechanism for QoS routingen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailLui, KS:kslui@eee.hku.hken_HK
dc.identifier.authorityLui, KS=rp00188en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/TENCON.2006.344213en_HK
dc.identifier.scopuseid_2-s2.0-34547595978en_HK
dc.identifier.hkuros120702en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-34547595978&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.scopusauthoridLi, SSS=18134158600en_HK
dc.identifier.scopusauthoridLui, KS=7103390016en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats