Abstract
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.
Research supported by “Pythagoras” grant of the Greek Ministry of Education, co-funded by the European Social Fund (75%) and National Resources (25%) — Operational Program for Educational and Vocational Training II (EΠEAEK II).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Karapetian, I.A.: Coloring of arc graphs (in russian). Akad. Nauk Armyan. SSR Dokl. 70(1), 306–311 (1980)
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)
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)
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)
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)
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)
Roughgarden, T., Tardos, É.: How bad is selfish routing? J. ACM 49(2), 236–259 (2002)
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)
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)
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)
Slusarek, M.: Optimal online coloring of circular arc graphs. Informatique Theoretique et Applications 29(5), 423–429 (1995)
Pemmaraju, S.V., Raman, R., Varadarajan, K.R.: Max-coloring and online coloring with bandwidths on interval graphs (manuscript, 2006)
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)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Milis, I., Pagourtzis, A., Potika, K. (2007). Selfish Routing and Path Coloring in All-Optical Networks. In: Janssen, J., Prałat, P. (eds) Combinatorial and Algorithmic Aspects of Networking. CAAN 2007. Lecture Notes in Computer Science, vol 4852. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77294-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-77294-1_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77293-4
Online ISBN: 978-3-540-77294-1
eBook Packages: Computer ScienceComputer Science (R0)