File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Approximation algorithm for QoS routing with multiple additive constraints

TitleApproximation algorithm for QoS routing with multiple additive constraints
Authors
KeywordsApproximation errors
Extensive simulations
NP Complete
QoS routing
Relaxation algorithm
Issue Date2009
PublisherIEEE. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104
Citation
The 2009 IEEE International Conference on Communications (ICC 2009), Dresden, Germany, 14-18 June 2009. In IEEE International Conference on Communications, 2009, p. 1-5 How to Cite?
AbstractIn this paper, we study the problem of computing the supported QoS from a source to a destination with multiple additive constraints. The problem has been shown to be NP-complete and many approximation algorithms have been developed. We propose a new approximation algorithm called multi-dimensional relaxation algorithm. We formally prove that our algorithm produces smaller approximation error than the existing algorithms. We further verify the performance by extensive simulations. ©2009 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/62023
ISBN
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorHou, Ren_HK
dc.contributor.authorWong Lui, KSen_HK
dc.contributor.authorLeung, KCen_HK
dc.contributor.authorBader, Fen_HK
dc.date.accessioned2010-07-13T03:52:19Z-
dc.date.available2010-07-13T03:52:19Z-
dc.date.issued2009en_HK
dc.identifier.citationThe 2009 IEEE International Conference on Communications (ICC 2009), Dresden, Germany, 14-18 June 2009. In IEEE International Conference on Communications, 2009, p. 1-5en_HK
dc.identifier.isbn978-1-4244-3435-0-
dc.identifier.issn1550-3607en_HK
dc.identifier.urihttp://hdl.handle.net/10722/62023-
dc.description.abstractIn this paper, we study the problem of computing the supported QoS from a source to a destination with multiple additive constraints. The problem has been shown to be NP-complete and many approximation algorithms have been developed. We propose a new approximation algorithm called multi-dimensional relaxation algorithm. We formally prove that our algorithm produces smaller approximation error than the existing algorithms. We further verify the performance by extensive simulations. ©2009 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEE. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104-
dc.relation.ispartofIEEE International Conference on Communicationsen_HK
dc.rightsIEEE International Conference on Communications. Copyright © IEEE.-
dc.rights©2009 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.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectApproximation errors-
dc.subjectExtensive simulations-
dc.subjectNP Complete-
dc.subjectQoS routing-
dc.subjectRelaxation algorithm-
dc.titleApproximation algorithm for QoS routing with multiple additive constraintsen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailWong Lui, KS: kslui@eee.hku.hken_HK
dc.identifier.emailLeung, KC: kacleung@hkucc.hku.hken_HK
dc.identifier.authorityWong Lui, KS=rp00188en_HK
dc.identifier.authorityLeung, KC=rp00147en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/ICC.2009.5198760en_HK
dc.identifier.scopuseid_2-s2.0-70449483060en_HK
dc.identifier.hkuros167626en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-70449483060&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage1-
dc.identifier.epage5-
dc.publisher.placeUnited States-
dc.identifier.scopusauthoridBaker, F=35316712100en_HK
dc.identifier.scopusauthoridLeung, KC=7401860663en_HK
dc.identifier.scopusauthoridLui, KS=7103390016en_HK
dc.identifier.scopusauthoridHou, R=35147964300en_HK
dc.identifier.citeulike7350572-
dc.customcontrol.immutablesml 140523-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats