Virtual topologies for multicasting with multiple originators in WDM networks

Authors:
Ian Ferrel;Adrian Mettler;Edward Miller;Ran Libeskind-Hadas
Affiliations:
Green Hills Software, Santa Barbara, CA and Department of Computer Science, Harvey Mudd College, Claremont, CA;Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA and Department of Computer Science, Harvey Mudd College, Claremont, CA;Citadel Investment Group, Chicago, IL and Department of Computer Science, Harvey Mudd College, Claremont, CA;Department of Computer Science, Harvey Mudd College, Claremont, CA
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2006

Citing 8
Cited 0

Efficient Fault-Tolerant Routing in Multihop Optical WDM Networks

IEEE Transactions on Parallel and Distributed Systems
On optimal traffic grooming in WDM rings

Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Performance of multi-hop commmunications using logical topologies on optical torus networks

Journal of Parallel and Distributed Computing
Multicast routing and wavelength assignment in multihop optical networks

IEEE/ACM Transactions on Networking (TON)
Optimal virtual topologies for one-to-many communication in WDM paths and rings

IEEE/ACM Transactions on Networking (TON)
Wavelength converters in dynamically-reconfigurable WDM networks

IEEE Communications Surveys & Tutorials
Light trees: optical multicasting for improved performance in wavelength routed networks

IEEE Communications Magazine
Constrained mirror placement on the Internet

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the problem of multicasting with multiple originators in WDM optical networks. In this problem, we are given a set of S source nodes and a set D of destination nodes in a network. All source nodes are capable of providing data to any destination node. Our objective is to find a virtual topology in the WDM network which satisfies given constraints on available resources and is optimal with respect to minimizing the maximum hop distance. Although the corresponding decision problem is NP-complete in general, we give polynomial time algorithms for the cases of unidirectional paths and rings.