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

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.

[1]  Dimitri P. Bertsekas,et al.  Algorithms for Nonlinear Multicommodity Network Flow Problems , 1979 .

[2]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[3]  Joan Feigenbaum,et al.  A BGP-based mechanism for lowest-cost routing , 2002, PODC '02.

[4]  Panagiotis Papadimitratos,et al.  Path set selection in mobile ad hoc networks , 2002, MobiHoc '02.

[5]  Michael L. Honig,et al.  Auction-Based Spectrum Sharing , 2006, Mob. Networks Appl..

[6]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[7]  Vahab S. Mirrokni,et al.  On spectrum sharing games , 2004, PODC '04.

[8]  Jean-Pierre Hubaux,et al.  Wireless Operators in a Shared Spectrum , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[9]  Sheng Zhong,et al.  On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks: an integrated approach using game theoretical and cryptographic techniques , 2005, MobiCom '05.

[10]  Jean-Yves Le Boudec,et al.  Performance analysis of the CONFIDANT protocol , 2002, MobiHoc '02.

[11]  Mary Baker,et al.  Mitigating routing misbehavior in mobile ad hoc networks , 2000, MobiCom '00.

[12]  Satish K. Tripathi,et al.  A framework for reliable routing in mobile ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[13]  Noam Nisan,et al.  Algorithmic Mechanism Design , 2001, Games Econ. Behav..

[14]  Vikram Srinivasan,et al.  Cooperation in wireless ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[15]  Joan Feigenbaum,et al.  A BGP-based mechanism for lowest-cost routing , 2002, PODC '02.

[16]  Xiang-Yang Li,et al.  Truthful multicast routing in selfish wireless networks , 2004, MobiCom '04.

[17]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[18]  Eliezer M. Gafni,et al.  Convergence of a routing algorithm , 1979 .

[19]  Sheng Zhong,et al.  Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[20]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

[21]  W. Wang,et al.  Market-driven bandwidth allocation in selfish overlay networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[22]  Hiroshi Suzuki,et al.  Fast bandwidth reservation scheme with multi-link and multi-path routing in ATM networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[23]  Joan Feigenbaum,et al.  Sharing the Cost of Multicast Transmissions , 2001, J. Comput. Syst. Sci..

[24]  Dimitri P. Bertsekas,et al.  Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks , 1984, IEEE Trans. Commun..

[25]  Yu Wang,et al.  Truthful Multicast in Selfish Wireless Networks , 2004 .

[26]  Sung-Ju Lee,et al.  AODV-BR: backup routing in ad hoc networks , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[27]  Paolo Santi,et al.  COMMIT: a sender-centric truthful and energy-efficient routing protocol for ad hoc networks with selfish nodes , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[28]  Atm Forum.  ATM user-network interface (UNI) specification : version 3.1 , 1993 .

[29]  Noam Nisan,et al.  Algorithmic mechanism design (extended abstract) , 1999, STOC '99.

[30]  Jean-Yves Le Boudec,et al.  Nodes bearing grudges: towards routing security, fairness, and robustness in mobile ad hoc networks , 2002, Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing.

[31]  Xiang-Yang Li,et al.  OURS: optimal unicast routing systems in non-cooperative wireless networks , 2006, MobiCom '06.

[32]  Desmond P. Taylor,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 2007 .

[33]  Sung-Ju Lee,et al.  Split multipath routing with maximally disjoint paths in ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[34]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[35]  Raphael Rom,et al.  Analysis of multi-path routing , 1999, TNET.

[36]  Sheng Zhong,et al.  On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks , 2006, Wirel. Networks.

[37]  Mahesh K. Marina,et al.  On-demand multipath distance vector routing in ad hoc networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[38]  Markus Jakobsson,et al.  A charging and rewarding scheme for packet forwarding in multi-hop cellular networks , 2003, MobiHoc '03.

[39]  Stephan Eidenbenz,et al.  Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents , 2003, MobiCom '03.

[40]  Baochun Li,et al.  Strategyproof mechanisms for dynamic tree formation in overlay networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[41]  Fan Wu,et al.  On designing collusion-resistant routing schemes for non-cooperative wireless ad hoc networks , 2007, MobiCom '07.

[42]  Zygmunt J. Haas,et al.  On the impact of alternate path routing for load balancing in mobile ad hoc networks , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).