A Study of Multicast Tree Problem with Multiple Constraints
Lee Sung-Ceun, Han Chi-Ceun, Journal of Internet Computing and Services, Vol. 5, No. 5, pp. 129-0, Oct. 2004
Full Text:
Keywords: QoS, multicasting, Ant Algorithm, naive heuristic, shortest path heuristic
Abstract
Statistics
Show / Hide Statistics
Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.
Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.
|
Cite this article
[APA Style]
Sung-Ceun, L. & Chi-Ceun, H. (2004). A Study of Multicast Tree Problem with Multiple Constraints. Journal of Internet Computing and Services, 5(5), 129-0.
[IEEE Style]
L. Sung-Ceun and H. Chi-Ceun, "A Study of Multicast Tree Problem with Multiple Constraints," Journal of Internet Computing and Services, vol. 5, no. 5, pp. 129-0, 2004.
[ACM Style]
Lee Sung-Ceun and Han Chi-Ceun. 2004. A Study of Multicast Tree Problem with Multiple Constraints. Journal of Internet Computing and Services, 5, 5, (2004), 129-0.