IEEE Journal on Selected Areas in Communications · 2002 · 45 citations · 12 references
ComputingComputer EngineeringComputer ScienceComputer NetworksInterconnection NetworksOptimizationCombinatorial OptimizationNetwork OptimizationNetwork TopologyRoutingRouting AlgorithmsTopology OptimizationBlockingMulticast CommunicationMulticast RoutingMulticastingNetwork Topology OptimizationOptical Cross-connectsPlacementWavelength Routing
This paper addresses the placement of multicast nodes in wavelength-routed all-optical networks. This problem is motivated by the expected high cost of optical multicast cross-connects due to fabrication complexity and power considerations. An analytical model for the approximate blocking probability in multicast networks is developed. The blocking performance is used to guide an iterative algorithm, Multicast-ADD, for the placement of multicast nodes. We provide validation of the model and the techniques used. In addition, a simulation study is provided to evaluate the performance of the heuristic. Insights obtained from the simulation results reveal that: (1) only a subset of the nodes (found to be 50%) need to be multicast-capable for acceptable blocking performance; (2) the blocking performance of Multicast-ADD outperforms that of random placement; and (3) employing alternate routing trees is not helpful in the optimization procedure.
12
An approximate solution for the Steiner problem in graphs
Haruhisa Takahashi, A Matsuyama · Mathematica japonica · 1980 · 884 citations
D. de Werra · European Journal of Operational Research · 1986 · 459 citations · Full text