Skip to main content
SpringerLink
Log in

Optimum Broadcasting in Complete Weighted-Vertex Graphs

  • Conference paper
SOFSEM 2010: Theory and Practice of Computer Science (SOFSEM 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5901))

Abstract

The weighted-vertex broadcast model is an extension of the original model of broadcasting to the graphs with weighted vertices. A vertex of weight ω is supposed to wait for ω time rounds before sending data to its neighbors; after this delay, in each round, it can inform one of its neighbors with no additional delay. We consider the problem in complete weighted-vertex graphs, and introduce a set of properties which describe a class of optimum solutions. Based on these, we present an algorithm which gives optimum broadcast schemes in polynomial time.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Asaka, T., Miyoshi, T., Tanaka, Y.: Multicast Routing in Satellite-Terrestrial Networks. In: Fifth Asia-Pacific Conference on Communications and Fourth Optoelectronics and Communications Conference, vol. 1, pp. 768–771 (1999)

    Google Scholar 

  2. Bar-Noy, A., Kipnis, S.: Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems. In: ACM Symposium on Parallel Algorithms and Architectures, pp. 13–22 (1992)

    Google Scholar 

  3. Bar-Noy, A., Nir, U.: The Generalized Postal Model-Broadcasting in a System with Non-Homogeneous Delays. In: Electrotechnical Conference, 1998. MELECON 1998, 9th Mediterranean, May 18-20, vol. 2, pp. 1323–1327 (1998)

    Google Scholar 

  4. Culler, D., Karp, R., Patterson, D., Sahay, A., Schauser, K.E., Santos, E., Subramonian, R., Von Eicken, T.: Logp: Towards a Realistic Model of Parallel Computation. SIGPLAN Not. 28(7), 1–12 (1993)

    Article  Google Scholar 

  5. Elkin, M., Kortsarz, G.: Sublogarithmic Approximation for Telephone Multicast: Path Out of Jungle (extended abstract). In: SODA 2003, Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 76–85 (2003)

    Google Scholar 

  6. Fraigniaud, P., Lazard, E.: Methods and Problems of Communication in Usual Networks. Discrete Appl. Math. 53(1-3), 79–133 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  7. Fraigniaud, P., Vial, S.: Approximation Algorithms for Information Dissemination Problems. In: IEEE Second International Conference on Algorithms and Architectures for Parallel Processing (ICAPP), pp. 155–162 (1996)

    Google Scholar 

  8. Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1990)

    Google Scholar 

  9. Harutyunyan, H., Kamali, S.: Broadcasting in Weighted-Vertex Graphs. In: ISPA Intl Symposium on Parallel and Distributed Processing with Applications, pp. 301–307 (2008)

    Google Scholar 

  10. Harutyunyan, H., Kamali, S.: Efficient Broadcasting in Networks with Weighted Nodes. In: ICPADS Intl Conference on Parallel and Distributed Systems, pp. 879–884 (2008)

    Google Scholar 

  11. Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A Survey of Gossiping and Broadcasting in Communication Networks. Networks 18(4), 319–359 (1998)

    Article  MathSciNet  Google Scholar 

  12. Hromkovic, J., Klasing, R., Monien, B., Peine, R.: Dissemination of Information in Interconnection Networks (Broadcasting & Gossiping). Combinatorial Network Theory, 125–212 (1996)

    Google Scholar 

  13. Hromkovič, J., Klasing, R., Pelc, A., Ružička, P., Unger, W.: Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Springer Monograph. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  14. hsu Chang, C., Wu, E.H.: An Intelligent Multicast Protocol for Satellite-Terrestrial Broadband Network, 138–143 (October 2002)

    Google Scholar 

  15. Khuller, S., Kim, Y.-A.: Broadcasting in Heterogeneous Networks. Algorithmica 48(1), 1–21 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  16. Slater, P.J., Cockayne, E.J., Hedetniemi, S.T.: Information Dissemination in Ttrees. SIAM Journal on Computing 10(4), 692–701 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  17. Wu, E.H.-k., Chang, C.: Adaptive Multicast Routing for Satellite-Terrestrial Network. In: Global Telecommunications Conference, GLOBECOM 2001, vol. 3, pp. 1440–1444. IEEE, Los Alamitos (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Software Engineering, Concordia University, Montreal, QC, H3G 1M8, Canada

    Hovhannes Harutyunyan

  2. David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, N2L 3G1, Canada

    Shahin Kamali

Authors
  1. Hovhannes Harutyunyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shahin Kamali
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information and Computing Sciences, Utrecht University, Padualaan 14, 3584 CH, Utrecht, The Netherlands

    Jan van Leeuwen

  2. LaBRI, Universit Bordeaux, 351 cours de la Libration, 1F-33405, Talence Cedex, France

    Anca Muscholl

  3. Department of Computer Science & Applied Mathematics, Weizmann Institute, Faculty of Mathematics and Computer Science, 76100, Rehovot, Israel

    David Peleg

  4. Department of Software Engineering Faculty of Mathematics and Physics Malostranské nám, Charles University, 25 11800, Prague 1, Czech Republic

    Jaroslav Pokorný

  5. Software Engineering, Department of Computer Science, RWTH Aachen University, 3, Ahornstrae 55, D-52074, Aachen, Germany

    Bernhard Rumpe

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Harutyunyan, H., Kamali, S. (2010). Optimum Broadcasting in Complete Weighted-Vertex Graphs. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., Rumpe, B. (eds) SOFSEM 2010: Theory and Practice of Computer Science. SOFSEM 2010. Lecture Notes in Computer Science, vol 5901. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11266-9_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11266-9_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11265-2

  • Online ISBN: 978-3-642-11266-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation