Skip to main content
SpringerLink
Log in

Concurrent multicast in weighted networks

  • Conference paper
  • First Online:
Algorithm Theory — SWAT'98 (SWAT 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1432))

Included in the following conference series:

Abstract

Concurrent multicast is a problem of information dissemination from a set of source nodes to a set of destination nodes in a network with cost function: Each source node s needs to multicast a block of data B(s) to the set of destinations. We are interested in protocols for this problem which have minimum communication cost. We consider both the classical case in which any transmitted message can consist of an arbitrary number of data blocks and the case in which each message must consist of exactly one block of data. We show that the problem of determining the minimum cost to perform concurrent multicast is NP-hard under both assumptions. We also give approximation algorithms to efficiently perform concurrent multicast in arbitrary networks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Ahaxoni, R. Cohen, “Restricted Dynamic Steiner Trees for Scalable Multicast in Datagram Networks”, Proc. INFOCOM'97, Kobe, Japan, April 1997.

    Google Scholar 

  2. B. Awerbuch, A. Barowtz, D. Peleg, “Cost-Sensitive Analysis of Communication Protocols”, Proceedings of PODC'90, 177–187.

    Google Scholar 

  3. A. Bagchi, E.F. Schmeichel, and S.L. Hakimi, “Parallel Information Dissemination by Packets”, SIAM J. on Computing, 23 (1994), 355–372.

    Article  MathSciNet  Google Scholar 

  4. A. Bar-Noy, S. Guha, J. Naor, and B. Schieber, “Multicasting in Heterogeneous Networks”, Proceedings of STOC '98.

    Google Scholar 

  5. F. Bauer, A. Varma, “Aries: a Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm, Proc. INFOCOM'96, 361–368.

    Google Scholar 

  6. P. Berman, C. Coulston, “On-line algorithms for Steiner Tree Problems”, Proc. STOC'97, 344–353.

    Google Scholar 

  7. J.-C. Bermond, L. Gargano, A. Rescigno, and U. Vaccaro, “Fast Gossiping by Short Messages”, SIAM J. on Computing, to appear.

    Google Scholar 

  8. J.-C. Bermond, L. Gargano, S. Perennes, “Sequential Gossiping by Short Messages”, Discr. Appl. Math., to appear.

    Google Scholar 

  9. D. P. Bertsekas, and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Englewood Cliffs, NJ, 1989.

    Google Scholar 

  10. P. Fraignaud, E. Lazard, “Methods and Problems of Communication in Usual etworks”, Discrete Applied Math., 53 (1994), 79–134.

    Article  Google Scholar 

  11. L. Gargano and A. A. Rescigno, “Communication Complexity of Fault-Tolerant information Diffusion”, Theoretical Computer Science, to appear.

    Google Scholar 

  12. L. Gargano, A. A. Rescigno, and U. Vaccaro, “Communication Complexity of Gossiping by Short Messages”, Journal of Parallel and Distributed Computing, 45, (1997), pp. 73–81. An extended abstract appeared in Proceedings of SWAT'96, Rolf Karlsson and Andrzej Lingas (Eds.), Lectures Notes in Computer Science, vol. 1097, pp. 234–245, Springer-Verlag, 1996.

    Article  Google Scholar 

  13. S. Hedetniemi, S. Hedetniemi, and A. Liestman, “A Survey of Gossiping and Broadcasting in Communication Networks”, NETWORKS, 18 (1988), 129–134.

    MathSciNet  Google Scholar 

  14. J. Hromkovivc, R. Klasing, B. Monien, and R. Peine, “Dissemination of Information in Interconnection Networks (Broadcasting and Gossiping)”, in: Ding-Zhu Du and D. Frank Hsu (Eds.) Combinatorial Network Theory, Kluwer Academic Publishers, 1995, pp. 125–212.

    Google Scholar 

  15. M. Karpinski, A. Zelikovsky, “New Approximation Algorithms for the Steiner Trees Problems”, Journal of Combinatorial Optimization 1 (1997), 47–65.

    Article  MathSciNet  Google Scholar 

  16. M. Imase, B.M. Waxman, “Dynamic Steiner Tree Problem”, SIAM J. Discr. Math, 4 (1991), 369–384.

    Article  MathSciNet  Google Scholar 

  17. H.-M. Lee, G.J. Chang, “Set-to-Set Broadcasting in Communication Networks”, Discr. Appl. Math., 40 (1992), 411–421.

    Article  MathSciNet  Google Scholar 

  18. Q. Li, Z. Zhang, J. Xu, “A Very Short Proof of a Conjecture Concerning Set-to-Set Broadcasting”, Networks, 23 (1993), 449–450.

    MathSciNet  Google Scholar 

  19. D. Richards, A. Liestman, “Generalizations of Broadcasting and Gossiping”, Networks, 18 (1988), 125–138.

    MathSciNet  Google Scholar 

  20. A. S. Tanenbaum, Computer Networks, Prentice Hall, Englewood Cliffs, N.J., 1981

    Google Scholar 

  21. P. Winter, “Steiner Problems in Networks: a Survey”, Netw., 17 (1987), 129–167.

    MATH  MathSciNet  Google Scholar 

  22. O. Wolfson and A. Segall, “The Communication Complexity of Atomic Commitment and of Gossiping”, SIAM J. on Computing, 20 (1991), 423–450.

    Article  MathSciNet  Google Scholar 

  23. A. Z. Zelikovsky, “An 11/6-Approximation Algorithm for the Network Steiner Problem”, Algorithmica, 9:463–470, 1993.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Salerno, 84081, Baronissi, SA, Italy

    Gianluca De Marco, Luisa Gargano & Ugo Vaccaro

Authors
  1. Gianluca De Marco
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luisa Gargano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ugo Vaccaro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Stefan Arnborg Lars Ivansson

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

De Marco, G., Gargano, L., Vaccaro, U. (1998). Concurrent multicast in weighted networks. In: Arnborg, S., Ivansson, L. (eds) Algorithm Theory — SWAT'98. SWAT 1998. Lecture Notes in Computer Science, vol 1432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054367

Download citation

  • DOI: https://doi.org/10.1007/BFb0054367

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64682-2

  • Online ISBN: 978-3-540-69106-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation