File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Aggregation-based QoS routing in the internet

TitleAggregation-based QoS routing in the internet
Authors
Hou, RLeung, KCLui, KSLeung, KCBaker, F
KeywordsConcave constraints
Hierarchical networks
QoS routing
Topology aggregation
Issue Date2010
PublisherAcademy Publisher. The Journal's web site is located at http://www.academypublisher.com/jcm/
Citation
Journal Of Communications, 2010, v. 5 n. 3, p. 239-246 How to Cite?
DOI: http://dx.doi.org/10.4304/jcm.5.3.239-246
AbstractIn this paper, we study the problem of QoS routing with two concave constraints in the Internet. We propose an efficient approach for computing the supported QoS across domains based on the aggregated intradomain topology. The time complexity of our approach is polynomial. Moreover, our approach can be incorporated in the distance-vector based routing protocol, such as BGP, the de facto inter- domain routing protocol in the Internet. Our simulation results show that our interdomain QoS routing protocol can successfully serve more than 80% of the total connection requests and is very scalable. © 2010 ACADEMY PUBLISHER.
Persistent Identifierhttp://hdl.handle.net/10722/73966
ISSN
1796-2021
2023 SCImago Journal Rankings: 0.242
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorHou, Ren_HK
dc.contributor.authorLeung, KCen_HK
dc.contributor.authorLui, KSen_HK
dc.contributor.authorLeung, KCen_HK
dc.contributor.authorBaker, Fen_HK
dc.date.accessioned2010-09-06T06:56:30Z-
dc.date.available2010-09-06T06:56:30Z-
dc.date.issued2010en_HK
dc.identifier.citationJournal Of Communications, 2010, v. 5 n. 3, p. 239-246en_HK
dc.identifier.issn1796-2021en_HK
dc.identifier.urihttp://hdl.handle.net/10722/73966-
dc.description.abstractIn this paper, we study the problem of QoS routing with two concave constraints in the Internet. We propose an efficient approach for computing the supported QoS across domains based on the aggregated intradomain topology. The time complexity of our approach is polynomial. Moreover, our approach can be incorporated in the distance-vector based routing protocol, such as BGP, the de facto inter- domain routing protocol in the Internet. Our simulation results show that our interdomain QoS routing protocol can successfully serve more than 80% of the total connection requests and is very scalable. © 2010 ACADEMY PUBLISHER.en_HK
dc.languageengen_HK
dc.publisherAcademy Publisher. The Journal's web site is located at http://www.academypublisher.com/jcm/en_HK
dc.relation.ispartofJournal of Communicationsen_HK
dc.subjectConcave constraintsen_HK
dc.subjectHierarchical networksen_HK
dc.subjectQoS routingen_HK
dc.subjectTopology aggregationen_HK
dc.titleAggregation-based QoS routing in the interneten_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1796-2021&volume=5&issue=3&spage=239&epage=246&date=2010&atitle=Aggregation-based+QoS+routing+in+the+Internet-
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_OA_fulltext-
dc.identifier.doi10.4304/jcm.5.3.239-246en_HK
dc.identifier.scopuseid_2-s2.0-78651561736en_HK
dc.identifier.hkuros169676en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-78651561736&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume5en_HK
dc.identifier.issue3en_HK
dc.identifier.spage239en_HK
dc.identifier.epage246en_HK
dc.publisher.placeFinlanden_HK
dc.identifier.scopusauthoridHou, R=35147964300en_HK
dc.identifier.scopusauthoridLeung, KC=24773661300en_HK
dc.identifier.scopusauthoridLui, KS=7103390016en_HK
dc.identifier.scopusauthoridLeung, KC=7401860663en_HK
dc.identifier.scopusauthoridBaker, F=35316712100en_HK
dc.identifier.issnl1796-2021-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats