Access the full text.
Sign up today, get DeepDyve free for 14 days.
U. Feige (1998)
A threshold of ln n for approximating set coverJ. ACM, 45
L. Sahasrabuddhe, B. Mukherjee (1999)
Light trees: optical multicasting for improved performance in wavelength routed networksIEEE Commun. Mag., 37
B. Waxman (1988)
Routing of multipoint connectionsIEEE J. Sel. Areas Commun., 6
D. Goldberg (1988)
Genetic Algorithms in Search Optimization and Machine Learning
Maher Ali, J. Deogun (2000)
Cost-effective implementation of multicasting in wavelength-routed networksJournal of Lightwave Technology, 18
Maher Ali, J. Deogun (2000)
Power-efficient design of multicast wavelength-routed networksIEEE Journal on Selected Areas in Communications, 18
B. Mukherjee (1997)
Optical Communication Networks
Deogun/Allocation of Splitting Nodes
U. Feige (1996)
Proceedings of the Twenty-Eight Annual ACMSymposium on the Theory of Computing (STOC '96)
G. Sahin, M. Azizoglu (1998)
Multicast routing and wavelength assignment in wide-area networks, 3531
N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller (1953)
Equation of state calculations by fast computing machinesJournal of Chemical Physics, 21
M. Listanti, M. Berdusco, R. Sabella (1997)
Optical path strategies in WDM all-optical networks: minimization of wavelength converters in optical cross connectsGLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record, 1
I. Chlamtac, A. Ganz, G. Karmi (1992)
Lightpath communications: an approach to high bandwidth optical WAN'sIEEE Trans. Commun., 40
M. Bellare, O. Goldreich, M. Sudan (1998)
Free bits, pcps and nonapproximatibility Ðtowards tight resultsSIAM J. Comp, 27
A. Gibbons (1985)
Algorithmic Graph Theory
M. Charikar, C. Chekuri, T. Cheung, Z. Dai, Ashish Goel, S. Guha, Ming Li (1999)
Approximation algorithms for directed Steiner problemsJ. Algorithms, 33
M. Garey, D. Hohnson (1979)
A Guide to the Theory of NP-Completeness
Wei-Syun Hu, Q. Zeng (1998)
Multicasting optical cross connects employing splitter-and-delivery switchIEEE Photonics Technology Letters, 10
G. Syswerda (1989)
Uniform Crossover in Genetic Algorithms
(1998)
Bene®t of multicasting in alloptical networks
(1980)
An approximate solution for the Steiner problem in graphs
M. Bellare, Oded Goldreich, M. Sudan (1995)
Free bits, PCPs and non-approximability-towards tight resultsProceedings of IEEE 36th Annual Foundations of Computer Science
E. Falkenauer (1998)
Genetic Algorithms and Grouping Problems
In this paper, we introduce the splitter placement problem in wavelength-routed networks (SP-WRN). Given a network topology, a set of multicast sessions, and a fixed number of multicast-capable cross-connects, the SP-WRN problem entails the placement of the multicast-capable cross-connects so that the blocking probability is minimized. The SP-WRN problem is NP-complete as it includes as a subproblem the routing and wavelength assignment problem which is NP-complete. To gain a deeper insight into the computational complexity of the SP-WRN problem, we define a graph-theoretic version of the splitter placement problem (SPG), and show that even SPG is NP-complete. We develop three heuristics for the SP-WRN problem with different degrees of trade-off between computation time and quality of solution. The first heuristic uses the CPLEX general solver to solve an integer-linear program (ILP) of the problem. The second heuristic is based on a greedy approach and is called most-saturated node first (MSNF). The third heuristic employs simulated annealing (SA) with route-coordination. Through numerical examples on a wide variety of network topologies we demonstrate that: (1) no more than 50% of the cross-connects need to be multicast-capable, (2) the proposed SA heuristic provides fast near-optimal solutions, and (3) it is not practical to use general solvers such as CPLEX for solving the SP-WRN problem.
Photonic Network Communications – Springer Journals
Published: Oct 8, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.