File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Auction-based schemes for multipath routing in selfish networks

TitleAuction-based schemes for multipath routing in selfish networks
Authors
KeywordsAuction-Based Routing
Multipath Routing
Non-Cooperation
Selfish Network
Traffic Assignment
Issue Date2013
PublisherIEEE Communications Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000817
Citation
The 2013 IEEE Wireless Communications and Networking Conference (WCNC 2013), Shanghai, China, 7-10 April 2013. In IEEE Wireless Communications and Networking Conference Proceedings, 2013, p. 1956-1961 How to Cite?
AbstractWe study multipath routing with traffic assignment in selfish networks. Based on the Vickrey-Clarke-Groves (VCG) auction, an optimal and strategy-proof scheme, known as optimal auction-based multipath routing (OAMR), is developed. However, OAMR is computationally expensive and cannot run in real time when the network size is large. Therefore, we propose sequential auction-based multipath routing (SAMR). SAMR handles routing requests sequentially using some greedy strategies. In particular, with reference to the Ausubel auction, we develop a water-draining algorithm to assign the traffic of a request among its available paths and determine the payment of the transmission in approximately constant time. Our simulation results show that SAMR can rapidly compute the allocations and payments of requests with small sacrifice on the system cost. Moreover, various sequencing strategies for sequential auction are also investigated. © 2013 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/184992
ISBN
ISSN

 

DC FieldValueLanguage
dc.contributor.authorZhou, Hen_US
dc.contributor.authorLeung, KCen_US
dc.contributor.authorLi, VOKen_US
dc.date.accessioned2013-07-15T10:22:17Z-
dc.date.available2013-07-15T10:22:17Z-
dc.date.issued2013en_US
dc.identifier.citationThe 2013 IEEE Wireless Communications and Networking Conference (WCNC 2013), Shanghai, China, 7-10 April 2013. In IEEE Wireless Communications and Networking Conference Proceedings, 2013, p. 1956-1961en_US
dc.identifier.isbn978-1-4673-5939-9-
dc.identifier.issn1525-3511-
dc.identifier.urihttp://hdl.handle.net/10722/184992-
dc.description.abstractWe study multipath routing with traffic assignment in selfish networks. Based on the Vickrey-Clarke-Groves (VCG) auction, an optimal and strategy-proof scheme, known as optimal auction-based multipath routing (OAMR), is developed. However, OAMR is computationally expensive and cannot run in real time when the network size is large. Therefore, we propose sequential auction-based multipath routing (SAMR). SAMR handles routing requests sequentially using some greedy strategies. In particular, with reference to the Ausubel auction, we develop a water-draining algorithm to assign the traffic of a request among its available paths and determine the payment of the transmission in approximately constant time. Our simulation results show that SAMR can rapidly compute the allocations and payments of requests with small sacrifice on the system cost. Moreover, various sequencing strategies for sequential auction are also investigated. © 2013 IEEE.-
dc.languageengen_US
dc.publisherIEEE Communications Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000817-
dc.relation.ispartofIEEE Wireless Communications and Networking Conference Proceedingsen_US
dc.rightsIEEE Wireless Communications and Networking Conference Proceedings. Copyright © IEEE Communications Society.-
dc.rights©2013 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.subjectAuction-Based Routing-
dc.subjectMultipath Routing-
dc.subjectNon-Cooperation-
dc.subjectSelfish Network-
dc.subjectTraffic Assignment-
dc.titleAuction-based schemes for multipath routing in selfish networksen_US
dc.typeConference_Paperen_US
dc.identifier.emailZhou, H: hjzhou@eee.hku.hken_US
dc.identifier.emailLeung, KC: kacleung@hkucc.hku.hken_US
dc.identifier.emailLi, VOK: vli@eee.hku.hk-
dc.identifier.authorityLeung, KC=rp00147en_US
dc.identifier.authorityLi, VOK=rp00150en_US
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/WCNC.2013.6554864-
dc.identifier.scopuseid_2-s2.0-84881576924-
dc.identifier.hkuros216612en_US
dc.identifier.hkuros225547-
dc.identifier.spage1956-
dc.identifier.epage1961-
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 131106-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats