On the Efficiency of a Game Theoretic Approach to Sparse Regenerator Placement in WDM Networks

In this paper we provide a mathematical ILP model for the Regeneration Placement Problem (RPP) which minimizes the total number of regeneration nodes allocated in a translucent optical network ensuring that all the node pairs can always reach one another via two link-disjoint lightpaths under physical-impairment constraints. Since RPP is NP-complete, large-site design problem can not be solved relying upon exact approaches. We then propose a game-theoretic approach to model RPP as a non-cooperative game and solve it applying the best response dynamic concept. Finally, we evaluate the performance of the proposed approach in terms of closeness of the obtained results to these provided by ILP: a MILP formulation is given in order to study the quality of the Nash equilibria by comparison to Price-of-Anarchy and Price-of-Stability bounds.

[1]  Shie Mannor,et al.  Non-Cooperative Design of Translucent Networks , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[2]  Byrav Ramamurthy,et al.  Sparse Regeneration in Translucent Wavelength-Routed Optical Networks: Architecture, Network Design and Wavelength Routing , 2005, Photonic Network Communications.

[3]  A. Tzanakaki,et al.  Impairment Constraint Based Routing in Mesh Optical Networks , 2007, OFC/NFOEC 2007 - 2007 Conference on Optical Fiber Communication and the National Fiber Optic Engineers Conference.

[4]  Shaohua Chen,et al.  Are There Lasting Impacts of Aid to Poor Areas? Evidence from Rural China , 2006 .

[5]  J. Y. Yen.  Finding the K Shortest Loopless Paths in a Network , 1971 .

[6]  J.P. Heritage,et al.  Transparent vs. opaque vs. translucent wavelength-routed optical networks , 1999, OFC/IOOC . Technical Digest. Optical Fiber Communication Conference, 1999, and the International Conference on Integrated Optics and Optical Fiber Communication.

[7]  S. Goeringer,et al.  Verifying agile transparent system performance with field testing , 2004, Optical Fiber Communication Conference, 2004. OFC 2004.

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

[9]  Angela Chiu,et al.  Issues for routing in the optical layer , 2001, IEEE Commun. Mag..

[10]  Gangxiang Shen,et al.  Sparse placement of electronic switching nodes for low blocking in translucentoptical networks , 2002 .

[11]  Igal Milchtaich.  Crowding games are sequentially solvable , 1998, Int. J. Game Theory.

[12]  A.L. Souza Filho,et al.  Strategies for designing translucent wide-area networks , 2003, Proceedings of the 2003 SBMO/IEEE MTT-S International Microwave and Optoelectronics Conference - IMOC 2003. (Cat. No.03TH8678).

[13]  Ezhan Karasan,et al.  Regenerator Placement and Traffic Engineering with Restoration in GMPLS Networks , 2004, Photonic Network Communications.

[14]  Ezhan Karasan,et al.  Design of Translucent Optical Networks: Partitioning and Restoration , 2004, Photonic Network Communications.

[15]  Tim Roughgarden,et al.  Bounding the inefficiency of equilibria in nonatomic congestion games , 2004, Games Econ. Behav..

[16]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[17]  Xi Yang,et al.  Dynamic routing in translucent WDM optical networks: the intradomain case , 2005, Journal of Lightwave Technology.

[18]  Si Chen,et al.  The regenerator location problem , 2010, Networks.

[19]  Gangxiang Shen,et al.  Segment-based approaches to survivable translucent network design under various ultra-long-haul system reach capabilities (Invited) , 2003 .

[20]  Andrea Fumagalli,et al.  Regenerator Placement with Guaranteed Connectivity in Optical Networks , 2007, ONDM.