File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/WCNC.2013.6554864
- Scopus: eid_2-s2.0-84881576924
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Auction-based schemes for multipath routing in selfish networks
Title | Auction-based schemes for multipath routing in selfish networks |
---|---|
Authors | |
Keywords | Auction-Based Routing Multipath Routing Non-Cooperation Selfish Network Traffic Assignment |
Issue Date | 2013 |
Publisher | IEEE 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? |
Abstract | We 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 Identifier | http://hdl.handle.net/10722/184992 |
ISBN | |
ISSN | 2020 SCImago Journal Rankings: 0.361 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhou, H | en_US |
dc.contributor.author | Leung, KC | en_US |
dc.contributor.author | Li, VOK | en_US |
dc.date.accessioned | 2013-07-15T10:22:17Z | - |
dc.date.available | 2013-07-15T10:22:17Z | - |
dc.date.issued | 2013 | en_US |
dc.identifier.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 | en_US |
dc.identifier.isbn | 978-1-4673-5939-9 | - |
dc.identifier.issn | 1525-3511 | - |
dc.identifier.uri | http://hdl.handle.net/10722/184992 | - |
dc.description.abstract | We 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.language | eng | en_US |
dc.publisher | IEEE Communications Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000817 | - |
dc.relation.ispartof | IEEE Wireless Communications and Networking Conference Proceedings | en_US |
dc.subject | Auction-Based Routing | - |
dc.subject | Multipath Routing | - |
dc.subject | Non-Cooperation | - |
dc.subject | Selfish Network | - |
dc.subject | Traffic Assignment | - |
dc.title | Auction-based schemes for multipath routing in selfish networks | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Zhou, H: hjzhou@eee.hku.hk | en_US |
dc.identifier.email | Leung, KC: kacleung@hkucc.hku.hk | en_US |
dc.identifier.email | Li, VOK: vli@eee.hku.hk | - |
dc.identifier.authority | Leung, KC=rp00147 | en_US |
dc.identifier.authority | Li, VOK=rp00150 | en_US |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/WCNC.2013.6554864 | - |
dc.identifier.scopus | eid_2-s2.0-84881576924 | - |
dc.identifier.hkuros | 216612 | en_US |
dc.identifier.hkuros | 225547 | - |
dc.identifier.spage | 1956 | - |
dc.identifier.epage | 1961 | - |
dc.publisher.place | United States | - |
dc.customcontrol.immutable | sml 131106 | - |
dc.identifier.issnl | 1525-3511 | - |