An Algorithm of Constructing Multiple Tree for Group Multicast with Bandwidth Contraint 


Vol. 29,  No. 3, pp. 305-313, Mar.  2004


PDF
  Abstract

Group multicast refers to the kind of multicast in which every member of a group is allowed to transmit data to the group. The goal of routing algorithms for group multicast is to construct a set of low cost multicast trees including all the group members with QoS (e.g., bandwidth) constraint. There have been several algorithms proposed: source tree and shared tree approaches. However, the latter approach has a low success rate in constructing a shared multicast tree, and the former approach suffers from high control overhead and low scalability as group size increases. In this paper, we present a heuristic algorithm which varies the number of multicast trees according to the network load. The simulation results show not only that our algorithm outperforms the shared tree approach in terms of the success rate, but also that it has lower control overhead than the source tree approach while guaranteeing the same success rate.

  Statistics
Cumulative Counts from November, 2022
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

[IEEE Style]

B. Koo, T. Park, C. Kim, "An Algorithm of Constructing Multiple Tree for Group Multicast with Bandwidth Contraint," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 3, pp. 305-313, 2004. DOI: .

[ACM Style]

Bong-Gyu Koo, Taekeun Park, and Cheeha Kim. 2004. An Algorithm of Constructing Multiple Tree for Group Multicast with Bandwidth Contraint. The Journal of Korean Institute of Communications and Information Sciences, 29, 3, (2004), 305-313. DOI: .

[KICS Style]

Bong-Gyu Koo, Taekeun Park, Cheeha Kim, "An Algorithm of Constructing Multiple Tree for Group Multicast with Bandwidth Contraint," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 3, pp. 305-313, 3. 2004.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880