File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Hierarchical QoS routing in delay-bandwidth sensitive networks

TitleHierarchical QoS routing in delay-bandwidth sensitive networks
Authors
Issue Date2000
Citation
Conference On Local Computer Networks, 2000, p. 579-588 How to Cite?
AbstractLarge networks are often structured hierarchically by grouping nodes into different domains in order to deal with he scaling problem. In such networks, it is infeasible to maintain the detailed network information at every router. Therefore, topology information of domains are summarized before broadcasted. This process is called topology aggregation. Hierarchical routing protocols are then used to find a route among the domains. We study several basic problems associated with hierarchical QoS routing, including (1) how to make QoS-aware topology aggregation, (2) how to represent the aggregated network state, and (3) how to find an end-to-end route based on aggregated information. The novelty in this research is our new network QoS representation which is line segments on the delay-banadwidth plane. We also present a distributed routing mechanism that works with our representation. Our theoretical and simulation results show that the protocol achieves scalability and improved routing performance.
Persistent Identifierhttp://hdl.handle.net/10722/158306
ISSN

 

DC FieldValueLanguage
dc.contributor.authorLui, KingShanen_US
dc.contributor.authorNahrstedt, Klaraen_US
dc.contributor.authorChen, Shigangen_US
dc.date.accessioned2012-08-08T08:58:59Z-
dc.date.available2012-08-08T08:58:59Z-
dc.date.issued2000en_US
dc.identifier.citationConference On Local Computer Networks, 2000, p. 579-588en_US
dc.identifier.issn0742-1303en_US
dc.identifier.urihttp://hdl.handle.net/10722/158306-
dc.description.abstractLarge networks are often structured hierarchically by grouping nodes into different domains in order to deal with he scaling problem. In such networks, it is infeasible to maintain the detailed network information at every router. Therefore, topology information of domains are summarized before broadcasted. This process is called topology aggregation. Hierarchical routing protocols are then used to find a route among the domains. We study several basic problems associated with hierarchical QoS routing, including (1) how to make QoS-aware topology aggregation, (2) how to represent the aggregated network state, and (3) how to find an end-to-end route based on aggregated information. The novelty in this research is our new network QoS representation which is line segments on the delay-banadwidth plane. We also present a distributed routing mechanism that works with our representation. Our theoretical and simulation results show that the protocol achieves scalability and improved routing performance.en_US
dc.languageengen_US
dc.relation.ispartofConference on Local Computer Networksen_US
dc.titleHierarchical QoS routing in delay-bandwidth sensitive networksen_US
dc.typeConference_Paperen_US
dc.identifier.emailLui, KingShan:kslui@eee.hku.hken_US
dc.identifier.authorityLui, KingShan=rp00188en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0034542383en_US
dc.identifier.spage579en_US
dc.identifier.epage588en_US
dc.identifier.scopusauthoridLui, KingShan=7103390016en_US
dc.identifier.scopusauthoridNahrstedt, Klara=7006456800en_US
dc.identifier.scopusauthoridChen, Shigang=7410249968en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats