TY - GEN
T1 - Non-cooperative design of translucent networks
AU - Châtelain, Benoît
AU - Mannor, Shie
AU - Gagnons, François
AU - Plant, David V.
PY - 2007
Y1 - 2007
N2 - This paper introduces a new game theoretic formulation for the design and routing of resilient and translucent networks. An integer linear programming (ILP) modeling is also presented and used as a reference to evaluate the game theoretic algorithm performances. Both formulations include primary and link-disjoint protection paths pre-calculation and take into account the system maximal optical reach distance. Numerical results show that the game theoretic formulation considerably decreases the optimization time and provides near optimal solutions, in term of required number of regenerator nodes.
AB - This paper introduces a new game theoretic formulation for the design and routing of resilient and translucent networks. An integer linear programming (ILP) modeling is also presented and used as a reference to evaluate the game theoretic algorithm performances. Both formulations include primary and link-disjoint protection paths pre-calculation and take into account the system maximal optical reach distance. Numerical results show that the game theoretic formulation considerably decreases the optimization time and provides near optimal solutions, in term of required number of regenerator nodes.
UR - https://www.scopus.com/pages/publications/39349084876
U2 - 10.1109/GLOCOM.2007.447
DO - 10.1109/GLOCOM.2007.447
M3 - Contribution to conference proceedings
AN - SCOPUS:39349084876
SN - 1424410436
SN - 9781424410439
T3 - GLOBECOM - IEEE Global Telecommunications Conference
SP - 2348
EP - 2352
BT - IEEE GLOBECOM 2007 - 2007 IEEE Global Telecommunications Conference, Proceedings
T2 - 50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007
Y2 - 26 November 2007 through 30 November 2007
ER -