Article: Aggregation-based QoS routing in the internet

File Download Links for fulltext
(May Require Subscription)
Supplementary

  • Basic View
  • Metadata View
  • XML View
TitleAggregation-based QoS routing in the internet
AuthorsHou, R2
Leung, KC
Lui, KS2
Leung, KC2
Baker, F1
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/
CitationJournal 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.
ISSN1796-2021
DOIhttp://dx.doi.org/10.4304/jcm.5.3.239-246
ReferencesReferences in Scopus
DC Field
Value
dc.contributor.authorHou, R
dc.contributor.authorLeung, KC
dc.contributor.authorLui, KS
dc.contributor.authorLeung, KC
dc.contributor.authorBaker, F
dc.date.accessioned2010-09-06T06:56:30Z
dc.date.available2010-09-06T06:56:30Z
dc.date.issued2010
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.
dc.description.naturelink_to_OA_fulltext
dc.identifier.citationJournal 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
dc.identifier.doihttp://dx.doi.org/10.4304/jcm.5.3.239-246
dc.identifier.epage246
dc.identifier.hkuros169676
dc.identifier.issn1796-2021
dc.identifier.issue3
dc.identifier.openurl
dc.identifier.scopuseid_2-s2.0-78651561736
dc.identifier.spage239
dc.identifier.urihttp://hdl.handle.net/10722/73966
dc.identifier.volume5
dc.languageeng
dc.publisherAcademy Publisher. The Journal's web site is located at http://www.academypublisher.com/jcm/
dc.publisher.placeFinland
dc.relation.ispartofJournal of Communications
dc.relation.referencesReferences in Scopus
dc.subjectConcave constraints
dc.subjectHierarchical networks
dc.subjectQoS routing
dc.subjectTopology aggregation
dc.titleAggregation-based QoS routing in the internet
dc.typeArticle
Author Affiliations
  1. Cisco Systems
  2. The University of Hong Kong