Advertisement

Optimum Broadcasting in Complete Weighted-Vertex Graphs

  • Hovhannes Harutyunyan
  • Shahin Kamali
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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. 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)CrossRefGoogle Scholar
  5. 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. 6.
    Fraigniaud, P., Lazard, E.: Methods and Problems of Communication in Usual Networks. Discrete Appl. Math. 53(1-3), 79–133 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 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. 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. 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. 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. 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)CrossRefMathSciNetGoogle Scholar
  12. 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. 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)zbMATHGoogle Scholar
  14. 14.
    hsu Chang, C., Wu, E.H.: An Intelligent Multicast Protocol for Satellite-Terrestrial Broadband Network, 138–143 (October 2002)Google Scholar
  15. 15.
    Khuller, S., Kim, Y.-A.: Broadcasting in Heterogeneous Networks. Algorithmica 48(1), 1–21 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Slater, P.J., Cockayne, E.J., Hedetniemi, S.T.: Information Dissemination in Ttrees. SIAM Journal on Computing 10(4), 692–701 (1981)zbMATHCrossRefMathSciNetGoogle Scholar
  17. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Hovhannes Harutyunyan
    • 1
  • Shahin Kamali
    • 2
  1. 1.Department of Computer Science and Software EngineeringConcordia UniversityMontrealCanada
  2. 2.David R. Cheriton School of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations