Design of Logical Topologies for Wavelength-Routed Optical Networks

The problem of designing a logical topology over a wavelength-routed all-optical network (AON) physical topology is studied. The physical topology consists of the nodes and fiber links in the network. On an AON physical topology, we can set up lightpaths between pairs of nodes, where a lightpath represents a direct optical connection without any intermediate electronics. The set of lightpaths along with the nodes constitutes the logical topology. For a given network physical topology and traffic pattern, our objective is to design the logical topology and the routing algorithm so as to minimize the network congestion while constraining the average delay seen by a source-destination pair and the amount of processing required at the nodes (degree of the logical topology). Ignoring the delay constraints can result in fairly convoluted logical topologies with very long delays. On the other hand, in all our examples, imposing it results in a minimal increase in congestion. While the number of wavelengths required to imbed the resulting logical topology on the physical all optical topology is also a constraint in general, we find that in many cases of interest this number can be quite small. We formulate the combined logical topology design and routing problem described above as a mixed integer linear programming problem which we then solve for a number of cases of a six-node network. This programming problem is split into two subproblems: logical topology design, and routing. We then compare the performance of several heuristic topology design algorithms against that of randomly generated topologies, as well as lower bounds.

[1]  I. Chlamtac,et al.  Lightnets: Topologies for High-speed Optical Networks , 1993 .

[2]  Kumar N. Sivarajan,et al.  Routing and wavelength assignment in all-optical networks , 1995, TNET.

[3]  Aaron Kershenbaum,et al.  Telecommunications Network Design Algorithms , 1993 .

[4]  Xudong Wang,et al.  Efficient algorithm for virtual topology design in multihop lightwave networks , 1994, TNET.

[5]  Zhensheng Zhang,et al.  A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength reuse , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[6]  Kumar N. Sivarajan,et al.  Lightwave networks based on de Bruijn graphs , 1994, TNET.

[7]  Luigi Fratta,et al.  Topological design of the wavelength-division optical network , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[8]  Mario Gerla,et al.  Rooted routing in linear lightwave networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[9]  Biswanath Mukherjee,et al.  Some principles for designing a wide-area optical network , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[10]  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.

[11]  Imrich Chlamtac,et al.  Lightpath communications: an approach to high bandwidth optical WAN's , 1992, IEEE Trans. Commun..

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

[13]  Anthony S. Acampora,et al.  Logically rearrangeable multihop lightwave networks , 1991, IEEE Trans. Commun..

[14]  Terrance E. Boult.  Flow Trees : a Lower Bound Computation Tool forNetwork , 1994 .

[15]  P. Green.  Fiber Optic Networks , 1992 .

[16]  Kavita Bala,et al.  Algorithms for routing in a linear lightwave network , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.