Selfish Resource Allocation in Optical Networks
We introduce Colored Resource Allocation Games as a new model for selfish routing and wavelength assignment in multifiber all-optical networks. Colored Resource Allocation Games are a generalization of congestion and bottleneck games where players have their strategies in multiple copies (colors). We focus on two main subclasses of these games depending on the player cost: in Colored Congestion Games the player cost is the sum of latencies of the resources allocated to the player, while in Colored Bottleneck Games the player cost is the maximum of these latencies. We investigate the pure price of anarchy for three different social cost functions and prove tight bounds for each separate case. We first consider a social cost function which is particularly meaningful in the setting of multifiber all-optical networks, where it captures the objective of fiber cost minimization. Additionally, we consider the two usual social cost functions (maximum and average player cost) and obtain improved bounds that could not have been derived using earlier results for the standard models for congestion and bottleneck games.
KeywordsNash Rium Banner Milis
Unable to display preview. Download preview PDF.
- 3.Roughgarden, T.: Selfish routing and the price of anarchy. The MIT Press (2005)Google Scholar
- 7.Andrews, M., Zhang, L.: Complexity of wavelength assignment in optical network optimization. In: INFOCOM. IEEE (2006)Google Scholar
- 9.Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC, pp. 67–73 (2005)Google Scholar
- 15.Banner, R., Orda, A.: Bottleneck routing games in communication networks. In: INFOCOM. IEEE (2006)Google Scholar
- 16.Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: Mitzenmacher, M. (ed.) STOC, pp. 513–522. ACM (2009)Google Scholar
- 17.Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, 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)CrossRefGoogle Scholar
- 25.Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proceedings. 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 295–304 (October 2004)Google Scholar