File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Routing With Topology Aggregation in Delay-Bandwidth Sensitive Networks

TitleRouting With Topology Aggregation in Delay-Bandwidth Sensitive Networks
Authors
KeywordsDelay-bandwidth sensitive networks
Hierarchical routing
QoS routing
Topology aggregation
Issue Date2004
PublisherI E E E. The Journal's web site is located at http://www.comsoc.org/livepubs/net
Citation
Ieee/Acm Transactions On Networking, 2004, v. 12 n. 1, p. 17-29 How to Cite?
AbstractRouting is a process of finding a network path from a source node to a destination node. The execution time and the memory requirement of a routing algorithm increase with the size of the network. In order to deal with the scalability problem, large networks are often structured hierarchically by grouping nodes into different domains. The internal topology of each domain is then aggregated into a simple topology that reflects the cost of routing across that domain. This process is called topology aggregation. For delay-bandwidth sensitive networks, traditional approaches represent the property of each link in the aggregated topology as a delay-bandwidth pair, which corresponds to a point on the delay-bandwidth plane. Since each link after aggregation may be the abstraction of many physical paths, a single delay-bandwidth pair results in significant information loss. The major contribution of this paper is a novel quality-of-service (QoS) parameter representation with a new aggregation algorithm and a QoS-aware routing protocol. Our QoS representation captures the state information about the network with much greater accuracy than the existing algorithms. Our simulation results show that the new approach achieves very good performance in terms of delay deviation, success ratio, and crankback ratio.
Persistent Identifierhttp://hdl.handle.net/10722/42954
ISSN
2015 Impact Factor: 2.186
2015 SCImago Journal Rankings: 1.795
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorLui, KSen_HK
dc.contributor.authorNahrstedt, Ken_HK
dc.contributor.authorChen, Sen_HK
dc.date.accessioned2007-03-23T04:35:24Z-
dc.date.available2007-03-23T04:35:24Z-
dc.date.issued2004en_HK
dc.identifier.citationIeee/Acm Transactions On Networking, 2004, v. 12 n. 1, p. 17-29en_HK
dc.identifier.issn1063-6692en_HK
dc.identifier.urihttp://hdl.handle.net/10722/42954-
dc.description.abstractRouting is a process of finding a network path from a source node to a destination node. The execution time and the memory requirement of a routing algorithm increase with the size of the network. In order to deal with the scalability problem, large networks are often structured hierarchically by grouping nodes into different domains. The internal topology of each domain is then aggregated into a simple topology that reflects the cost of routing across that domain. This process is called topology aggregation. For delay-bandwidth sensitive networks, traditional approaches represent the property of each link in the aggregated topology as a delay-bandwidth pair, which corresponds to a point on the delay-bandwidth plane. Since each link after aggregation may be the abstraction of many physical paths, a single delay-bandwidth pair results in significant information loss. The major contribution of this paper is a novel quality-of-service (QoS) parameter representation with a new aggregation algorithm and a QoS-aware routing protocol. Our QoS representation captures the state information about the network with much greater accuracy than the existing algorithms. Our simulation results show that the new approach achieves very good performance in terms of delay deviation, success ratio, and crankback ratio.en_HK
dc.format.extent451803 bytes-
dc.format.extent25600 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/msword-
dc.languageengen_HK
dc.publisherI E E E. The Journal's web site is located at http://www.comsoc.org/livepubs/neten_HK
dc.relation.ispartofIEEE/ACM Transactions on Networkingen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.subjectDelay-bandwidth sensitive networksen_HK
dc.subjectHierarchical routingen_HK
dc.subjectQoS routingen_HK
dc.subjectTopology aggregationen_HK
dc.titleRouting With Topology Aggregation in Delay-Bandwidth Sensitive Networksen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1063-6692&volume=12&issue=1&spage=17&epage=29&date=2004&atitle=Routing+with+topology+aggregation+in+delay-bandwidth+sensitive+networksen_HK
dc.identifier.emailLui, KS:kslui@eee.hku.hken_HK
dc.identifier.authorityLui, KS=rp00188en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/TNET.2003.822647en_HK
dc.identifier.scopuseid_2-s2.0-1642312887en_HK
dc.identifier.hkuros89885-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-1642312887&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume12en_HK
dc.identifier.issue1en_HK
dc.identifier.spage17en_HK
dc.identifier.epage29en_HK
dc.identifier.isiWOS:000189126200002-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridLui, KS=7103390016en_HK
dc.identifier.scopusauthoridNahrstedt, K=7006456800en_HK
dc.identifier.scopusauthoridChen, S=7410252679en_HK
dc.identifier.citeulike3732613-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats