Selfish Routing and Path Coloring in All-Optical Networks
From MaRDI portal
Publication:5458507
DOI10.1007/978-3-540-77294-1_8zbMath1136.68335MaRDI QIDQ5458507
Ioannis Milis, Aris Pagourtzis, Katerina Potika
Publication date: 15 April 2008
Published in: Combinatorial and Algorithmic Aspects of Networking (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77294-1_8
91A10: Noncooperative games
68M10: Network design and communication in computer systems
91A80: Applications of game theory
Cites Work
- Optimal wavelength routing on directed fiber trees
- Efficient routing in all-optical networks
- Max-coloring and online coloring with bandwidths on interval graphs
- How bad is selfish routing?
- The Complexity of Coloring Circular Arcs and Chords
- Optimal on-line coloring of circular arc graphs
- The price of selfish routing
- Structural Information and Communication Complexity
- STACS 2005
- Equilibrium points in n -person games
- Unnamed Item
- Unnamed Item
- Unnamed Item