An Application of Game Theory for the Selection of Traffic Routing Method in Interconnected NGN

In this paper, the impact of various dynamic traffic routing methods on different performances of interconnected telecommunications network with the application of bill-and-keep interconnection charging is presented. For the purpose of our research, we developed the software for Routing and Interconnection Simulation (RIS). We conducted two-stage analysis. First stage is concerning the shortest path routing, the three-hop routing, the random path routing and the last successful path routing, and their influence on certain network performance parameters. In second stage the coordination game theory model is proposed in order to determine the one routing method that provides the best results for all operators in terms of costs per link.

[1]  Zhang Yong,et al.  A self-learning multicast routing algorithm for multi-rate WiFi mesh network , 2009, 2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology.

[2]  Mikael Johansson,et al.  Robust load balancing under traffic uncertainty—tractable models and efficient algorithms , 2011, Telecommun. Syst..

[3]  Eitan Altman,et al.  Competitive routing in networks with polynomial costs , 2002, IEEE Trans. Autom. Control..

[4]  Ariel Orda,et al.  Virtual path bandwidth allocation in multiuser networks , 1997, TNET.

[5]  Zhi-Quan Luo,et al.  Design of WDM networks under economy of scale pricing and shortest path routing , 2006, IEEE Journal on Selected Areas in Communications.

[6]  Ariel Orda,et al.  Competitive routing in multiuser communication networks , 1993, TNET.

[7]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[8]  Zhu Han,et al.  Cooperative Game Theory for Distributed Spectrum Sharing , 2007, 2007 IEEE International Conference on Communications.

[9]  Deborah Estrin,et al.  Pricing in computer networks: motivation, formulation, and example , 1993, TNET.

[10]  Ji Yi,et al.  A Game Theoretical Attack-Defense Model Oriented to Network Security Risk Assessment , 2008, 2008 International Conference on Computer Science and Software Engineering.

[11]  Deep Medhi,et al.  Adaptive bandwidth provisioning envelope based on discrete temporal network measurements , 2004, IEEE INFOCOM 2004.

[12]  Rita Puzmanova.  Routing and Switching: time of convergence , 2001 .

[13]  Eitan Altman,et al.  Competitive routing in networks with polynomial cost , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[14]  Mark Armstrong.  Network interconnection with asymmetric networks and heterogeneous calling patterns , 2004, Inf. Econ. Policy.

[15]  Deep Medhi,et al.  Network routing - algorithms, protocols, and architectures , 2007 .

[16]  Qiu Jing,et al.  Distributed Resource Allocation Based on Game Theory in Multi-cell OFDMA Systems , 2009, Int. J. Wirel. Inf. Networks.

[17]  Ariel Orda,et al.  Competitive routing in multi-user communication networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[18]  K. J. Ray Liu,et al.  A game theoretical framework for dynamic pricing-based routing in self-organized MANETs , 2008, IEEE Journal on Selected Areas in Communications.

[19]  Asuman E. Ozdaglar,et al.  Network Games: Theory, Models, and Dynamics , 2011, Network Games: Theory, Models, and Dynamics.

[20]  Susanne Albers,et al.  On the value of coordination in network design , 2008, SODA '08.

[21]  N.B. Shroff,et al.  Analysis of Shortest Path Routing for Large Multi-Hop Wireless Networks , 2009, IEEE/ACM Transactions on Networking.

[22]  M. Armstrong.  Network Interconnection in Telecommunications , 1998 .

[23]  Christos Douligeris,et al.  A game theoretic perspective to flow control in telecommunication networks , 1992 .

[24]  Christos Bouras,et al.  Pricing QoS over transport networks , 2004, Internet Res..

[25]  Ray Horak.  Webster's New World Telecom Dictionary , 2007 .

[26]  Pietro Michiardi,et al.  Game theoretic analysis of security in mobile ad hoc networks , 2002 .

[27]  Kihong Park,et al.  An architecture for noncooperative QoS provision in many-switch systems , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[28]  Lauro Ortigoza-Guerrero,et al.  Call admission and code allocation strategies for WCDMA systems with multirate traffic , 2006, IEEE Journal on Selected Areas in Communications.

[29]  Bridger M. Mitchell,et al.  Bill-and-keep and the economics of interconnection in next-generation networks , 2009 .

[30]  Benjamin E. Hermalin,et al.  Your network or mine? The economics of routing rules , 2006 .

[31]  V. Acimovic-Raspopovic,et al.  Dynamic routing design under forecast uncertainty , 2003, 6th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Service, 2003. TELSIKS 2003..

[32]  Leïla Azouz Saïdane,et al.  Dimensioning of Next Generation Networks Signaling Gateway for Improving a Quality of Service Target , 2008, 2008 Second International Conference on Future Generation Communication and Networking.

[33]  Daniel Sadoc Menasché,et al.  An evolutionary game-theoretic approach to congestion control , 2005, Perform. Evaluation.

[34]  Haiying Shen,et al.  A Distributed Three-hop Routing Protocol to Increase the Capacity of Hybrid Networks , 2009, 2009 International Conference on Parallel Processing.

[35]  Mehdi Bennis,et al.  Spectrum sharing for future mobile cellular systems , 2009 .

[36]  L. Blume.  The Statistical Mechanics of Strategic Interaction , 1993 .