File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Bandwidth sensitive routing in diffServ networks with heterogeneous bandwidth requirements

TitleBandwidth sensitive routing in diffServ networks with heterogeneous bandwidth requirements
Authors
KeywordsCommunications
Issue Date2003
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104
Citation
Ieee International Conference On Communications, 2003, v. 1, p. 188-192 How to Cite?
AbstractThis paper studies the problem of finding optimal routes for premium class traffic in a DiffServ network such that (1) loop-freedom is guaranteed in the entire network under hop-by-hop routing assumption; and (2) the maximum relative congestion among all links is minimized. This problem is called the Extended Optimal Premium Routing (eOPR) problem, which is proven to be NP-hard. We use the integer programming method to mathematically formulate the eOPR problem and find the optimal solutions for small scale networks. We also study heuristic algorithms in order to handle large scale networks. Simulation results are compared with the optimal solutions obtained by solving the integer programming models. The results show that the Bandwidth-inversion Shortest Path (BSP) algorithm can be a good candidate to route premium traffic in DiffServ networks.
Persistent Identifierhttp://hdl.handle.net/10722/46347
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorWang, Jen_HK
dc.contributor.authorXiao, Len_HK
dc.contributor.authorLui, KSen_HK
dc.contributor.authorNahrstedt, Ken_HK
dc.date.accessioned2007-10-30T06:47:52Z-
dc.date.available2007-10-30T06:47:52Z-
dc.date.issued2003en_HK
dc.identifier.citationIeee International Conference On Communications, 2003, v. 1, p. 188-192en_HK
dc.identifier.issn0536-1486en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46347-
dc.description.abstractThis paper studies the problem of finding optimal routes for premium class traffic in a DiffServ network such that (1) loop-freedom is guaranteed in the entire network under hop-by-hop routing assumption; and (2) the maximum relative congestion among all links is minimized. This problem is called the Extended Optimal Premium Routing (eOPR) problem, which is proven to be NP-hard. We use the integer programming method to mathematically formulate the eOPR problem and find the optimal solutions for small scale networks. We also study heuristic algorithms in order to handle large scale networks. Simulation results are compared with the optimal solutions obtained by solving the integer programming models. The results show that the Bandwidth-inversion Shortest Path (BSP) algorithm can be a good candidate to route premium traffic in DiffServ networks.en_HK
dc.format.extent346773 bytes-
dc.format.extent4014 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104en_HK
dc.relation.ispartofIEEE International Conference on Communicationsen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2003 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.subjectCommunicationsen_HK
dc.titleBandwidth sensitive routing in diffServ networks with heterogeneous bandwidth requirementsen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1044-4556&volume=1&spage=188&epage=192&date=2003&atitle=Bandwidth+sensitive+routing+in+DiffServ+networks+with+heterogeneous+bandwidth+requirementsen_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/ICC.2003.1204167en_HK
dc.identifier.scopuseid_2-s2.0-0038391312en_HK
dc.identifier.hkuros80294-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0038391312&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume1en_HK
dc.identifier.spage188en_HK
dc.identifier.epage192en_HK
dc.identifier.scopusauthoridWang, J=8716933500en_HK
dc.identifier.scopusauthoridXiao, L=7202696799en_HK
dc.identifier.scopusauthoridLui, KS=7103390016en_HK
dc.identifier.scopusauthoridNahrstedt, K=7006456800en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats