QоS Guaranteed Multicast

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


Multicast is a point to multipoint communication, by which a source node sends messages to multiple destination nodes. Multicast uses a tree structure as the route to transmit messages to multiple destinations. Unicast, a point-to-point communication, and a point-to-all communication (broadcast), are the two special cases of multicast. End-to-end delay is an important QoS (Quality of Service) parameter in data communications. QoS multicast requires that the delay of messages from the source to any destination should be within a bound. There are many network applications nowadays which need the support of QoS multicast, such as multi-media conferencing systems, video on demand systems, real-time control systems, and so on.


Minimum Span Tree Steiner Tree Competitive Ratio Wavelength Assignment Delay Function 
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]
    B. Awerbuch, Y. Azar, A. Fiat, S. Leonardi, and A. Rosén, On-line competitive algorithms for call admission in optical networks, Algorithmica, 31 (2001), 29–34.MathSciNetMATHCrossRefGoogle Scholar
  2. [2]
    K. Bharath-Kumar and J. M. Jaffe, Routing to multiple destinations in computer networks, IEEE Transactions on Communications, 31 (1983), 343–351.MATHCrossRefGoogle Scholar
  3. [3]
    E. W. Dijkstra, A note on two problems in connexion with graphs, Numerical Mathematics, 1 (1959), 269–271.MathSciNetMATHCrossRefGoogle Scholar
  4. [4]
    X.-H. Jia, A Distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks, IEEE/ACM Transaction on Networking, 6 (6) (1998), 828–837.CrossRefGoogle Scholar
  5. [5]
    X.-H. Jia, X.-D. Hu, L. Ruan, and J. H. Sun, Multicast routing, load balancing and wavelength assignment on Tree of Rings, IEEE Communication Letters, 6 (2) (2002), 79–81.CrossRefGoogle Scholar
  6. [6]
    R. M. Karp, Reducibility among combinatorial problems, in R. E. Miller and J. W. Thatcher (eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, 85–103.CrossRefGoogle Scholar
  7. [7]
    S. Khuller, B. Raghavachari, and N. Young, Balancing minimum spanning trees and shortestpath trees, Algorithmica, 14 (1995), 305–321.MathSciNetMATHCrossRefGoogle Scholar
  8. [8]
    L. Kou, G. Markowsky, and L. Berman, A fast algorithm for Steiner trees, Acta Informatica, 15 (2) (1981), 141–45.MathSciNetMATHCrossRefGoogle Scholar
  9. [9]
    J. B. Kruskal, On the shortest spanning subtree of a graph and the travelling salesman problem, Proceedings ofAmerican Mathematics Society, 7 (1956), 48–50.MathSciNetMATHCrossRefGoogle Scholar
  10. [10]
    M. V. Marathe, R. Ravi, R. Sundaram, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt III, Bicriteria network design problems, Journal ofAlgorithms, 28 (1998), 142–171.MathSciNetMATHCrossRefGoogle Scholar
  11. [11]
    R. K. Pankaj, Wavelength requirements for multicasting in all-optical networks, IEEE/ACM Transactions on Networking, 7 (3) (1999), 414–424.CrossRefGoogle Scholar
  12. [12]
    L. H. Sahasrabuddhe and B. Mukherjee, Light-Trees: optical multicasting for improved performance in wavelength-routed networks, IEEE Communication Magazine, 37 (2) (1999), 67–73.CrossRefGoogle Scholar
  13. [13]
    L. H. Sahasrabuddhe and B. Mukherjee, Multicast routing algorithms and protocols: a tutorial, IEEE Network, 14 (1) (2000), 90–102.CrossRefGoogle Scholar
  14. [14]
    D. Sleator and R. Tarjan, Amortized efficiency of list update and paging rules, Communications of the ACM, 28 (1985), 202–208.MathSciNetCrossRefGoogle Scholar
  15. [15]
    Z. Z. Zelikovsky, The 11/6-approximation algorithm for the Steiner problem on networks, Algorithmica, 9 (1993), 463–470.MathSciNetMATHCrossRefGoogle 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