File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Quality-of-service routing with two concave constraints

TitleQuality-of-service routing with two concave constraints
Authors
KeywordsCommunications
Issue Date2008
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104
Citation
Ieee International Conference On Communications, 2008, p. 5746-5750 How to Cite?
AbstractRouting is a process of finding a network path from a source node to a destination node. A good routing protocol should find the "best path" from a source to a destination. When there are independent constraints to be considered, the "best path" is not well-defined. In our previous work, we developed a line segment representation for Quality-of-Service routing with bandwidth and delay requirements. In this paper, we propose how to adopt the line segment when a request has two concave constraints. We have developed a series of operations for constructing routing tables under the distance-vector protocol. We evaluate the performance through extensive simulations. ©2008 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/57276
ISSN
2023 SCImago Journal Rankings: 0.861
References

 

DC FieldValueLanguage
dc.contributor.authorLeung, KCen_HK
dc.contributor.authorLui, KSen_HK
dc.contributor.authorLeung, KCen_HK
dc.contributor.authorBaker, Fen_HK
dc.date.accessioned2010-04-12T01:31:34Z-
dc.date.available2010-04-12T01:31:34Z-
dc.date.issued2008en_HK
dc.identifier.citationIeee International Conference On Communications, 2008, p. 5746-5750en_HK
dc.identifier.issn0536-1486en_HK
dc.identifier.urihttp://hdl.handle.net/10722/57276-
dc.description.abstractRouting is a process of finding a network path from a source node to a destination node. A good routing protocol should find the "best path" from a source to a destination. When there are independent constraints to be considered, the "best path" is not well-defined. In our previous work, we developed a line segment representation for Quality-of-Service routing with bandwidth and delay requirements. In this paper, we propose how to adopt the line segment when a request has two concave constraints. We have developed a series of operations for constructing routing tables under the distance-vector protocol. We evaluate the performance through extensive simulations. ©2008 IEEE.en_HK
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.rights©2008 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.subjectCommunicationsen_HK
dc.titleQuality-of-service routing with two concave constraintsen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1044-4556&volume=&spage=5746&epage=5750&date=2008&atitle=Quality-of-Service+Routing+with+two+concave+constraintsen_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.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/ICC.2008.1075en_HK
dc.identifier.scopuseid_2-s2.0-51249096348en_HK
dc.identifier.hkuros144947-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-51249096348&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage5746en_HK
dc.identifier.epage5750en_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.issnl0536-1486-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats