In this paper we discuss the optimal design of logical topologies in wavelength-routed WDM networks supporting unicast and multicast transfer of IP datagrams. We first explain the key aspects of the problem, emphasizing the fact that in IP networks the routing algorithms are an input to the optimization problem, not an optimization target. We then provide a mixed integer linear programming formulation of the optimization problem., which however leads to unacceptably high complexity for networks of non-trivially small size. We then propose both greedy and metaheuristic approaches for the sub-optimal design of logical topologies with acceptable complexity. Finally, we derive lower bounds that allow the assessment of the performance of the proposed algorithms. Some numerical results indicate that the proposed metaheuristics largely outperform the greedy approaches, and are able to obtain very good logical topologies
Optimal design of logical topologies in wavelength-routed optical networks with multicast traffic / Mellia, Marco; Nucci, A; Grosso, A; Leonardi, Emilio; AJMONE MARSAN, Marco Giuseppe. - STAMPA. - 3:(2001), pp. 1520-1525. (Intervento presentato al convegno Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE tenutosi a San Antonio, Texas nel November 2001) [10.1109/GLOCOM.2001.965835].
Optimal design of logical topologies in wavelength-routed optical networks with multicast traffic
MELLIA, Marco;LEONARDI, Emilio;AJMONE MARSAN, Marco Giuseppe
2001
Abstract
In this paper we discuss the optimal design of logical topologies in wavelength-routed WDM networks supporting unicast and multicast transfer of IP datagrams. We first explain the key aspects of the problem, emphasizing the fact that in IP networks the routing algorithms are an input to the optimization problem, not an optimization target. We then provide a mixed integer linear programming formulation of the optimization problem., which however leads to unacceptably high complexity for networks of non-trivially small size. We then propose both greedy and metaheuristic approaches for the sub-optimal design of logical topologies with acceptable complexity. Finally, we derive lower bounds that allow the assessment of the performance of the proposed algorithms. Some numerical results indicate that the proposed metaheuristics largely outperform the greedy approaches, and are able to obtain very good logical topologiesPubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1662544
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo