Multicasting and Broadcasting in Undirected WDM Networks

Authors:
Lin Li;Yinglong Xu;Guoling Chen;Yingyu Wan
Affiliations:
-;-;-;-
Venue:
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Year:
2001

Citing 9
Cited 0

Steiner problem in networks: a survey

Networks
Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
Improved low-degree testing and its applications

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Class Steiner trees and VLSI-design

Discrete Applied Mathematics - Special volume on VLSI
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Multicasting and Broadcasting in Large WDM Networks

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
A practical approach for routing and wavelength assignment in large wavelength-routed optical networks

IEEE Journal on Selected Areas in Communications
Improved neural heuristics for multicast routing

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problem of multicasting and broadcasting in undirected WDM networks. Given an undirected network G=(V,E) with a source node s and a set of destination nodes D, is the set of wavelength that can be used in the network. Associated with every edge e, there is a set of available wavelengths on it. The multicast problem is to find a tree rooted at s including all nodes in D such that the cost of the tree is minimum in terms of thecost of wavelength conversion at nodes and the cost of using wavelength on edges. This paper proves that the multicast problem is NP-Complete and can not be approximated within a constant factor, unless P=NP. Then we construct an auxiliary graph for the original WDM networks and reduce the multicast problem to a group steiner tree problem on the auxiliary graph. Employing the known algorithm for the group steiner tree problem, we get an algorithm for our problem which delivers a solution withinO(log2(nk)loglog(nk)logp) times the optimum.