Abstract
With the development of the multicast technology, the real-time strategy among the group applications using the multicast routing is getting more important. An essential factor of these real-time applications is to optimize the Delay- and delay Variation-Bounded Multicast Tree (DVBMT) problem. In this paper, we propose Estimation of Selecting Core (ESC) algorithm for DVBMT solution. Furthermore, it is expected that ESC algorithm results in the better any other DVBMT solutions.
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.
Chapter PDF
Similar content being viewed by others
References
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)
Rouskas, G.N., Baldine, I.: Multicast routing with end-to-end delay and delay variation constraints. IEEE JSAC 15(3), 346–356 (1997)
Sheu, P.-R., Chen, S.-T.: A fast and efficient heuristic algorithm for the delay- and delay variation bound multicast tree problem. In: Information Networking, Proc. ICOIN-15, January 2001, pp. 611–618 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahn, Y., Kim, M., Bang, YC., Choo, H. (2005). On Algorithm for Estimation of Selecting Core. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science – ICCS 2005. ICCS 2005. Lecture Notes in Computer Science, vol 3516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11428862_109
Download citation
DOI: https://doi.org/10.1007/11428862_109
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26044-8
Online ISBN: 978-3-540-32118-7
eBook Packages: Computer ScienceComputer Science (R0)