An optimal, strategy-proof scheme for multi-path traffic assignment in non-cooperative networks

Authors:
Fan Wu;Sheng Zhong;Jiqiang Liu
Affiliations:
Electrical and Computer Engineering Department, University of Illinois at Urbana-Champaign, Urbana, IL and Computer Science and Engineering Department, University of Buffalo, The State University ...;Computer Science and Engineering Department, University of Buffalo, The State University of New York, Buffalo, NY;School of Computer and Information Technology, Beijing Jiao Tong University, Beijing, China
Venue:
IEEE Transactions on Wireless Communications
Year:
2010

Citing 23
Cited 0

Data networks (2nd ed.)

Data networks (2nd ed.)
Fast bandwidth reservation scheme with multi-line & multi-path routing in ATM networks

IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
ATM user-network interface specification (version 3.0)

ATM user-network interface specification (version 3.0)
Algorithmic mechanism design (extended abstract)

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Analysis of multi-path routing

IEEE/ACM Transactions on Networking (TON)
Mitigating routing misbehavior in mobile ad hoc networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Path set selection in mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Performance analysis of the CONFIDANT protocol

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
On the impact of alternate path routing for load balancing in mobile ad hoc networks

MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Sharing the cost of multicast transmissions

Journal of Computer and System Sciences - Special issue on Internet algorithms
A BGP-based mechanism for lowest-cost routing

Proceedings of the twenty-first annual symposium on Principles of distributed computing
A charging and rewarding scheme for packet forwarding in multi-hop cellular networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks

ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents

Proceedings of the 9th annual international conference on Mobile computing and networking
On spectrum sharing games

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Truthful multicast routing in selfish wireless networks

Proceedings of the 10th annual international conference on Mobile computing and networking
COMMIT: A Sender-Centric Truthful and Energy-Efficient Routing Protocol for Ad Hoc Networks with Selfish Nodes

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks: an integrated approach using game theoretical and cryptographic techniques

Proceedings of the 11th annual international conference on Mobile computing and networking
Auction-based spectrum sharing

Mobile Networks and Applications
OURS: optimal unicast routing systems in non-cooperative wireless networks

Proceedings of the 12th annual international conference on Mobile computing and networking
On designing collusion-resistant routing schemes for non-cooperative wireless ad hoc networks

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Nodes bearing grudges: towards routing security, fairness, and robustness in mobile ad hoc networks

EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Multi-path routing has long been studied as an important routing strategy in networks. Many multi-path routing protocols schedule traffic among multiple paths in order to distribute traffic load. However, existing multi-path routing protocols with traffic assignment require that all nodes in the network follow the protocol, which may not always be a valid assumption when the network consists of selfish nodes. In this paper, we propose an optimal, strategy-proof scheme for multi-path traffic assignment (OSMA) in non-cooperative networks. When OSMA is used, behaving honestly is to the best interest of each selfish node regardless of any other nodes' behavior. Furthermore, our scheme is guaranteed to compute the lowest cost traffic assignment with the existence of these selfish nodes. Our evaluations verify that our scheme is optimal and strategy-proof, and demonstrate that the scheme has very low communication and computation overhead.