Optimal design of logical topologies in wavelength-routed optical networks with multicast traffic

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.

[1]  Biswanath Mukherjee,et al.  Some principles for designing a wide-area WDM optical network , 1996, TNET.

[2]  Deborah Estrin,et al.  The PIM architecture for wide-area multicast routing , 1996, TNET.

[3]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

[4]  Bülent Yener,et al.  A study of upper and lower bounds for minimum congestion routing in lightwave networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[5]  Biswanath Mukherjee,et al.  Light trees: optical multicasting for improved performance in wavelength routed networks , 1999, IEEE Commun. Mag..

[6]  S. Ramanathan,et al.  Multicast tree generation in networks with asymmetric links , 1996, TNET.

[7]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[8]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[9]  J. Moy,et al.  Open Shortest Path First version 2 , 1998 .

[10]  Tony Ballardie,et al.  Core Based Trees (CBT) Multicast Routing Architecture , 1997, RFC.

[11]  Stephen E. Deering,et al.  Distance Vector Multicast Routing Protocol , 1988, RFC.

[12]  Oktay Günlük,et al.  Computational experience with a difficult mixedinteger multicommodity flow problem , 1995, Math. Program..

[13]  Kumar N. Sivarajan,et al.  Design of Logical Topologies for Wavelength-Routed Optical Networks , 1996, IEEE J. Sel. Areas Commun..

[14]  Marco Ajmone Marsan,et al.  Algortihms for the Topology Design in WDM All-Optical Networks , 2000 .

[15]  Kumar N. Sivarajan,et al.  Design of logical topologies: A linear formulation for wavelength routed optical networks with no wavelength changers , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .