On Algorithm for the Delay- and Delay Variation-Bounded Multicast Trees Based on Estimation (original) (raw)

Abstract

With the multicast technology, demands for the real-time group applications through multicasting is getting more important. An essential factor of these real-time strategy is to optimize the Delay- and delay Variation-Bounded Multicast Tree (DVBMT) problem. In this paper, we propose a new algorithm for the DVBMT solution. The proposed algorithm outperforms other algorithms up to 9%~25% in terms of the delay variation.

This work was supported in parts by Brain Korea 21 and the Ministry of Information and Communication in Republic of Korea. Dr. H. Choo is the corresponding author and Dr. Bang is the co-corresponding author.

Preview

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Kim, M., Bang, Y.-C., Choo, H.: Efficient algorithm for reducing delay variation on bounded multicast trees. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol. 3090, pp. 440–450. Springer, Heidelberg (2004)
    Chapter Google Scholar
  2. Rodionov, A.S., Choo, H.: On generating random network structures: Connected graphs. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol. 3090, pp. 483–491. Springer, Heidelberg (2004)
    Chapter Google Scholar
  3. Rouskas, G.N., Baldine, I.: Multicast routing with end-to-end delay and delay variation constraints. IEEE J-SAC 15(3), 346–356 (1997)
    Google Scholar
  4. Sheu, P.-R., Chen, S.-T.: A fast and efficient heuristic algorithm for the delay- and delay variation bound multicast tree problem. In: Proc. ICOIN-15 Information Networking, January 2001, pp. 611–618 (2001)
    Google Scholar

Download references

Author information

Authors and Affiliations

  1. School of Information and Communication Engineering, Sungkyunkwan University, 440-746, Suwon, Korea
    Youngjin Ahn, Moonseong Kim & Hyunseung Choo
  2. Department of Computer Engineering, Korea Polytechnic University, 429-793, Gyeonggi-Do, Korea
    Young-Cheol Bang

Authors

  1. Youngjin Ahn
  2. Moonseong Kim
  3. Young-Cheol Bang
  4. Hyunseung Choo

Editor information

Editors and Affiliations

  1. Department of Computer Science, St. Francis Xavier University, Antigonish, Canada
    Laurence T. Yang
  2. School of Computer Science/Welsh eScience Centre, Cardiff University, UK
    Omer F. Rana
  3. Dipartimento di Ingegneria dell’ Informazione - Second, University of Naples - Italy, Real Casa dell’Annunziata - via Roma, 29 81031, Aversa (CE), Italy
    Beniamino Di Martino
  4. Computer Science Department, University of Tennessee, 37996-3450, Knoxville, TN, USA
    Jack Dongarra

Rights and permissions

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ahn, Y., Kim, M., Bang, YC., Choo, H. (2005). On Algorithm for the Delay- and Delay Variation-Bounded Multicast Trees Based on Estimation. In: Yang, L.T., Rana, O.F., Di Martino, B., Dongarra, J. (eds) High Performance Computing and Communications. HPCC 2005. Lecture Notes in Computer Science, vol 3726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11557654\_34

Download citation

Publish with us