File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: An approximation algorithm for QoS routing with two additive constraints

TitleAn approximation algorithm for QoS routing with two additive constraints
Authors
KeywordsHierarchical networks
Multiple constraints
Precomputation
QoS routing
Issue Date2008
Citation
Proceedings - International Conference On Network Protocols, Icnp, 2008, p. 328-337 How to Cite?
AbstractThe problem of finding a path that satisfies two additive constraints, such as delay and cost, has been proved to be NP-complete. Many heuristic and approximation algorithms have been developed to identify a path given a certain QoS request. Unfortunately, these algorithms cannot be applied directly in the Internet because routing in the Internet is based on table lookups and routing tables are computed before a request arrives. In this paper, we develop an approximation algorithm for computing the supported QoS going across a domain. We analyze the approximation error of our algorithm and formally prove that the approximation error of our proposed algorithm is smaller than those of the existing approaches. We further verify our performance using extensive simulations. ©2008 IEEE.
Description16th IEEE International Conference on Network Protocols
Persistent Identifierhttp://hdl.handle.net/10722/61949
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorRonghui, Hen_HK
dc.contributor.authorLui, KSen_HK
dc.contributor.authorLeung, KCen_HK
dc.contributor.authorBaker, Fen_HK
dc.date.accessioned2010-07-13T03:50:49Z-
dc.date.available2010-07-13T03:50:49Z-
dc.date.issued2008en_HK
dc.identifier.citationProceedings - International Conference On Network Protocols, Icnp, 2008, p. 328-337en_HK
dc.identifier.issn1092-1648en_HK
dc.identifier.urihttp://hdl.handle.net/10722/61949-
dc.description16th IEEE International Conference on Network Protocolsen_HK
dc.description.abstractThe problem of finding a path that satisfies two additive constraints, such as delay and cost, has been proved to be NP-complete. Many heuristic and approximation algorithms have been developed to identify a path given a certain QoS request. Unfortunately, these algorithms cannot be applied directly in the Internet because routing in the Internet is based on table lookups and routing tables are computed before a request arrives. In this paper, we develop an approximation algorithm for computing the supported QoS going across a domain. We analyze the approximation error of our algorithm and formally prove that the approximation error of our proposed algorithm is smaller than those of the existing approaches. We further verify our performance using extensive simulations. ©2008 IEEE.en_HK
dc.languageengen_HK
dc.relation.ispartofProceedings - International Conference on Network Protocols, ICNPen_HK
dc.subjectHierarchical networksen_HK
dc.subjectMultiple constraintsen_HK
dc.subjectPrecomputationen_HK
dc.subjectQoS routingen_HK
dc.titleAn approximation algorithm for QoS routing with two additive constraintsen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailLui, KS:kslui@eee.hku.hken_HK
dc.identifier.emailLeung, KC:kcleung@eee.hku.hken_HK
dc.identifier.authorityLui, KS=rp00188en_HK
dc.identifier.authorityLeung, KC=rp00147en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/ICNP.2008.4697051en_HK
dc.identifier.scopuseid_2-s2.0-67249086681en_HK
dc.identifier.hkuros167625en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-67249086681&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage328en_HK
dc.identifier.epage337en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridRonghui, H=26649127000en_HK
dc.identifier.scopusauthoridLui, KS=7103390016en_HK
dc.identifier.scopusauthoridLeung, KC=7401860663en_HK
dc.identifier.scopusauthoridBaker, F=35316712100en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats