Games in Network Topologies
This chapter provides approaches on how to deal with games in more complicated network topologies, starting from the basic games in single point-to-point WDM fiber links studied in Chap. 7. The multi-link topologies studied are representative for selected paths extracted from a mesh configuration in which no closed loops are being formed by channel optical paths. In network configurations, coupled constraints are propagated along fiber links and constraint functions become complicated from the end-to-end point of view. The non-convexity introduces additional complexities for analysis. In this chapter, we present a partition approach. More precisely, we partition the general multi-link structure into stages each stage being a single link. Then we formulate a partitioned Nash game for general multi-link topologies composed of ladder-nested stage Nash games. We also show that convexity is ensured in single-sink topologies, so that a partition approach could be based on single-sink stages.
KeywordsMesh Topology Stage Game Channel Power Fiber Link Hierarchical Decomposition
- 21.Basar, T., Srikant, R.: Revenue-maximizing pricing and capacity expansion in a many-users regime. In: Proceedings of the 21st IEEE Conference on Computer Communications (INFOCOM), June 2002, pp. 294–301 (2002) Google Scholar
- 77.Laplante, P.A.: Comprehensive Dictionary of Electrical Engineering. Springer, Berlin (1999) Google Scholar
- 101.Pan, Y.: A game theoretical approach to constrained OSNR optimization problems in optical networks. Ph.D. Thesis, University of Toronto, Toronto, Canada (2009) Google Scholar
- 126.Ramaswami, R., Sivarajan, K.N.: Optical Networks: A Practical Perspective, 2nd edn. Academic Press, San Diego (2002) Google Scholar