Multicast under Multi-Drop Models

  • Xiaohua Jia
  • Xiao-Dong Hu
  • Ding-Zhu Du
Part of the Network Theory and Applications book series (NETA, volume 9)


In the preceding chapter we have discussed how to establish QoS guaranteed multicast connections in WDM networks. It was assumed that all nodes in the network were equipped with multicast-capable optical switches and an input optical signal can be split into arbitrary many output optical signals. In practice, however, this is not the case. In fact, since today’s networks were designed to mainly support unicast (point-to-point) communication, routing nodes in most of networks do not have multicast capability [16]. In some networks, nodes just have a limited multicast capability, that is, an input optical signal can be split into a limited number of output optical signals. This is because an optical signal transmitted at a source node has fixed amount of power, each time an optical signal is split at a router onto multiple output ports a splitting loss is incurred which reduces the power of the signal at each of the outputs. Thus the application of routing light-trees based multicast is not easy.


Short Path Span Tree Destination Node Steiner Tree Network Cost 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Englewood Cliffs, New Jersey, 1993, 273–288.zbMATHGoogle Scholar
  2. [2]
    B. Alspach, J.-C. Bermond, and D. Sotteau, Decompositions into cycles I: Hamiltonian decompositions, in Cycles and Rays, edited by G. Hahn, G. Sabidussi, and R. E. Woodrow, Kluwer Academic Publishers, 1989.Google Scholar
  3. [3]
    V. Chvátal, A greedy heuristic for the set-covering problem, Mathematics of Operations Research, 4 (3) (1979), 233–235.MathSciNetzbMATHCrossRefGoogle Scholar
  4. [4]
    S. Even, Graph Algorithms, Computer Science Press, Inc., 1979.zbMATHGoogle Scholar
  5. [5]
    M. F. Forreger, Hamiltonian decompositions of products and cycles, Discrete Mathematics, 24 (1978), 251–260.MathSciNetCrossRefGoogle Scholar
  6. [6]
    M. Fürer and B. Raghavachari, Approximating the minimum-degree Steiner tree to within one of optimal, Journal ofAlgorithms, 17 (3) (1994), 409–423.CrossRefGoogle Scholar
  7. [7]
    S.-X. Gao, X.-H. Jia, X.-D. Hu, D.-Y. Li, Wavelength requirements and routing for multicast connections in lightpath and light-tree models of WDM networks with limited drops, IEE Proceedings on Communications, 148 (6) (2001), 363–367.CrossRefGoogle Scholar
  8. [8]
    D. Gusfield, Connectivity and edge-disjoint spanning trees, Information Processing Letters, 6 (1983), 87–89.MathSciNetCrossRefGoogle Scholar
  9. [9]
    P. Hall, On representatives of subsets, Journal ofLondon Mathematics Society, 10 (1935), 26–30.CrossRefGoogle Scholar
  10. [10]
    S. Kundu, Bounds on the number of disjoint spanning trees, Journal of Combinatoric Theory (Ser.B), 17 (1974), 199–203.MathSciNetzbMATHCrossRefGoogle Scholar
  11. [11]
    R. Libeskind-Hadas, Efficient collective communication in WDM networks with a power budget, in Proceedings of the 9th IEEE International Conference on Computer Communications and Networks, (2000), 612–616.Google Scholar
  12. [12]
    D. W. Matula, Determining edge connectivity in O(mn), in Proceedings ofthe 28th Symposium on Foundations of Computer Science (FOCS), 1987, 249–251.Google Scholar
  13. [13]
    C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.zbMATHGoogle Scholar
  14. [14]
    R. Ramaswami, Multi-Wavelength lightwave networks for computer communication, IEEE Communication Magazine, 31 (1993), 78–88.CrossRefGoogle Scholar
  15. [15]
    R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, H. B. Hunt III, Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems, Algorithmica, 31 (2001), 58–78.MathSciNetzbMATHCrossRefGoogle Scholar
  16. [16]
    L. H. Sahasrabuddhe and B. Mukherjee, Multicast routing algorithms and protocols: a tutorial, IEEE Network, 14 (1) (2000), 90–102.CrossRefGoogle Scholar
  17. [17]
    X. Zhang, J. Wei, and C. Qiao, Constrained multicast routing in WDM networks with sparse light splitting, Proceedings of IEEE Conference on Computer Communications (INFOCOM), 2000. Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2002

Authors and Affiliations

  • Xiaohua Jia
    • 1
  • Xiao-Dong Hu
    • 2
  • Ding-Zhu Du
    • 3
  1. 1.Department of Computer ScienceCity University of Hong KongHong Kong, SAR China
  2. 2.Institute of Applied MathematicsAcademy of Mathematics and System Science, Chinese Academy of SciencesBeijingP.R. China
  3. 3.Department of Computer ScienceUniversity of MinnesotaMinneapolisUSA

Personalised recommendations