Selfish Routing and Path Coloring in All-Optical Networks

  • Ioannis Milis
  • Aris Pagourtzis
  • Katerina Potika
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4852)


We study routing and path coloring problems in all-optical networks as non-cooperative games. We especially focus on oblivious payment functions, that is, functions that charge a player according to her own strategy only.

We first strengthen a known relation between such games and online routing and path coloring. In particular, we show that the price of anarchy of such games is lower-bounded by, and in several cases precisely equal to, the competitive ratio of appropriate modifications of the First Fit algorithm.

Based on this framework we provide results for two classes of games in ring networks: in Selfish Routing and Path Coloring a player must determine both a routing and a coloring for her request, while in Selfish Path Coloring the routing is predetermined and only a coloring of requests needs to be specified. We prove specific upper and lower bounds on the price of anarchy of these games under various payment functions.


Short Path Nash Equilibrium Social Cost Competitive Ratio Online Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Garey, M.R., Johnson, D.S., Miller, G.L., Papadimitriou, C.H.: The complexity of coloring circular arcs and chords. SIAM Journal on Algebraic and Discrete Methods 1(2), 216–227 (1980)zbMATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    Karapetian, I.A.: Coloring of arc graphs (in russian). Akad. Nauk Armyan. SSR Dokl. 70(1), 306–311 (1980)MathSciNetGoogle Scholar
  3. 3.
    Raghavan, P., Upfal, E.: Efficient routing in all-optical networks. In: STOC. Proc. of the 26th Annual ACM Symposium on Theory of Computing, pp. 134–143 (1994)Google Scholar
  4. 4.
    Erlebach, T., Jansen, K., Kaklamanis, C., Mihail, M., Persiano, P.: Optimal wavelength routing on directed fiber trees. Theor. Comput. Sci. 221(1-2), 119–137 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Gargano, L., Vaccaro, U.: Routing in all-optical networks: Algorithmic and graph theoretic problems. Numbers, Information and Complexity, pp. 555–578. Kluwer Academic Publishers, Dordrecht (2000)Google Scholar
  6. 6.
    Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404–413. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  7. 7.
    Mavronicolas, M., Spirakis, P.G.: The price of selfish routing. In: STOC. Proc. of the 33rd Annual ACM Symposium on Theory of Computing, pp. 510–519 (2001)Google Scholar
  8. 8.
    Roughgarden, T., Tardos, É.: How bad is selfish routing? J. ACM 49(2), 236–259 (2002)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Nash, J.F.: Equilibrium points in n-person games. Proc. of the National Academy of Sciences of the United States of America 36(1), 48–49 (1950)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Bilò, 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)Google Scholar
  11. 11.
    Bilò, 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)Google Scholar
  12. 12.
    Slusarek, M.: Optimal online coloring of circular arc graphs. Informatique Theoretique et Applications 29(5), 423–429 (1995)zbMATHMathSciNetGoogle Scholar
  13. 13.
    Pemmaraju, S.V., Raman, R., Varadarajan, K.R.: Max-coloring and online coloring with bandwidths on interval graphs (manuscript, 2006)Google Scholar
  14. 14.
    Georgakopoulos, G.F., Kavvadias, D.J., Sioutis, L.G.: Nash equilibria in all-optical networks. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol. 3828, pp. 1033–1045. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  15. 15.
    Gerstel, O., Sasaki, G., Kutten, S., Ramaswami, R.: Worst-case analysis of dynamic wavelength allocation in optical networks. IEEE/ACM Transactions on Networking 7(6), 833–846 (1999)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Ioannis Milis
    • 1
  • Aris Pagourtzis
    • 2
  • Katerina Potika
    • 2
  1. 1.Department of Computer ScienceAthens University of Economics and BusinessGreece
  2. 2.School of Electrical and Computer EngineeringNational Technical University of AthensGreece

Personalised recommendations