By Topic

Design of logical topologies for wavelength-routed all-optical networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ramaswami, R. ; IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA ; Sivarajan, K.N.

This paper considers the problem of designing a logical topology over a wavelength-routed all-optical network physical topology. The physical topology consists of the nodes and fiber links in the network. On an all-optical network 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 (relative traffic distribution among the source-destination pairs), our objective is to design the logical topology and the routing algorithm on that topology so as to maximize the network throughput 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). We will see that 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 reduction in throughput. 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 (ignoring the constraint on the number of available wavelengths) as a mixed integer programming problem which we then solve for a number of cases of a 6-node network. Since this programming problem is computationally intractable for larger networks, we split it into two subproblems: logical topology design, which is computationally hard and will probably require heuristic algorithms, and routing, which can be solved by a linear program. We then compare the performance of two heuristic topology design algorithms (that do take wavelength assignment constraints into account) against that of randomly generated topologies

Published in:

INFOCOM '95. Fourteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Bringing Information to People. Proceedings. IEEE

Date of Conference:

2-6 Apr 1995