Abstract
We consider the problem of routing a number of communication requests in WDM (wavelength division multiplexing) all-optical networks from the standpoint of game theory. If we view each routing request (pair of source-target nodes) as a player, then a strategy consists of a path from the source to the target and a frequency (color). To reflect the restriction that two requests must not use the same frequency on the same edge, conflicting strategies are assigned a prohibitively high cost.
Under this formulation, we consider several natural cost functions focusing on the existence of Nash equilibria and on the complexity of recognizing and computing them.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aumann, R.J.: Subjectivity and correlation in randomized strategies. J. of Mathematical Economics 1, 67–96 (1974)
Awerbach, B., Azar, Y., Fiat, A., Leonardi, S., Rosen, A.: On-line competitive algorithms for call admission in optical networks. Algorithmica 31(1), 29–43 (2001)
Bartal, Y., Leonardi, S., Rosen, A.: On-line Routing in optical networks. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 516–526. Springer, Heidelberg (1997)
Bilo, V., Flammini, M., Moscardelli, L.: On Nash Equilibria in Non-cooperative All-Optical Networks. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 448–459. Springer, Heidelberg (2005)
Bilo, V., Moscardelli, L.: The Price of Anarchy in All-Optical Networks. In: Kralovic, R., Sýkora, O. (eds.) SIROCCO 2004. LNCS, vol. 3104, pp. 13–22. Springer, Heidelberg (2004)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. MIT Press, Cambridge (1990)
Erlebach, T., Jansen, K.: The complexity of path coloring and call scheduling. Theoretical Computer Science 255(1-2), 33–50 (2001)
Even, S., Itai, A., Shamir, A.: On the complexity of time-table and multicommodity flow problems. SIAM journal of Computing 5, 691–703 (1976)
Fabrikant, A., Papadimitriou, C., Tulwar, K.: The Complexity of pure Nash equilibria. In: STOC 2004, pp. 604–612 (2004)
Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronikolas, M., Spirakis, P.: The structure and complexity of Nash equilibria for a selfish routing game. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 123–134. Springer, Heidelberg (2002)
Garey, M.R., Johnson, D.S.: Computers and intractability. Freeman, New York (1979)
Li, G., Simha, R.: On the wavelength assignment problem in multifiber WDM star and ring networks. In: Proceedings of INFOCOM, pp. 1771–1780 (2000)
Nash, J.F.: Equilibrium points in n-person games. Proc. of National Academy of Sciences 36, 48–49 (1950)
Nomikos, C.: Path coloring in graphs. Phd dissertation. Dept. of Electrical and Computer Engineering, NTUA (1997)
Nomikos, C., Pagourtzis, A., Zachos, S.: Minimizing request blocking in all-optical rings. In: Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM 2003), San Francisco, CA, USA, March 30 - April 3 (2003)
Nomikos, C., Pagourtzis, A., Potika, K., Zachos, S.: Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks. In: Mitrou, N.M., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) NETWORKING 2004. LNCS, vol. 3042, pp. 150–161. Springer, Heidelberg (2004)
Olariu, S.: An optimal greedy heuristic to color interval graphs. Information Processing Letters 37, 21–25 (1991)
Panagopoulou, P.N., Spirakis, P.G.: Efficient convergence to pure Nash equilibria in weighted network congestion games. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 203–215. Springer, Heidelberg (2005)
Papadimitriou, C.: Computing correlated equilibria in multi-player games. In: ACM Symposium on Theory of Computing archive Proceedings of the 37th ACM symp. on Theory of computing, 2005, Baltimore, MD, USA, pp. 49–56 (2005)
Papadimitriou, C.H., Roughgarden, T.: Computing Equilibria in Multi-Player Games. In: SODA 2005, pp. 82–91 (2005)
Raghavan, P., Upfal, E.: Efficient routing in all-optical networks. In: Proc. of STOC, pp. 134–143 (1994)
Sharma, S., Varvarigos, E.: Limited wavelength translation in all-optical WDM mesh networks. In: Proceedings of INFOCOM, pp. 893–901 (1998)
Vempala, S., Voking, B.: Approximating multicast congestion. In: Aggarwal, A.K., Pandu Rangan, C. (eds.) ISAAC 1999. LNCS, vol. 1741, pp. 367–372. Springer, Heidelberg (1999)
Voorneveld, M., Borm, P., van Megen, F., Tijs, S., Facchini, G.: Congestion games and potentials reconsidered. International Game Theory Review 1, 283–299 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Georgakopoulos, G.F., Kavvadias, D.J., Sioutis, L.G. (2005). Nash Equilibria in All-Optical Networks. In: Deng, X., Ye, Y. (eds) Internet and Network Economics. WINE 2005. Lecture Notes in Computer Science, vol 3828. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11600930_104
Download citation
DOI: https://doi.org/10.1007/11600930_104
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30900-0
Online ISBN: 978-3-540-32293-1
eBook Packages: Computer ScienceComputer Science (R0)