The MCSTOP Algorithm about the Minimum Cost Spanning Tree and the Optimum Path Generation for the Multicasting Path Assignment


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 4, pp. 1033-1043, Apr. 1998
10.3745/KIPSTE.1998.5.4.1033,   PDF Download:

Abstract

In this paper, we present an improved multicasting path assignment based on the minimum cost spanning tree. In the method presented in this paper, a multicasting path is assigned preferentially when a node to be received is found among the next degree nodes of the searching node in the multicasting path assignment of the constrained steiner tree (CST). If nodes of legacy group exist between nodes of the new group, a ne path among the nodes of new group is assigned as long as the nodes may be excluded from the new multicasting path assignment taking into consideration characteristics of nodes in the legacy group. In assigning the multicasting path additionally, where the source and destination nodes which can be set for the new multicasting path exist in the domain of identical network (local area network) and conditions for degree constraint are satisfied, a method of producing and assigning a new multicasting path is used. The results of comparison of CST with MCSTOP, MCSTOP algorithm enhanced performance capabilities about the communication cost, the propagation delay, and the computation time for the multicasting assignment paths more than CST algorithm. Further to this, research activities need study for the application of the international standard protocol(multicasting path assignment technology in the multipoint communication service (MCS) of the ITU-T T.120).


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 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
[IEEE Style]
P. M. Sung and K. J. Suk, "The MCSTOP Algorithm about the Minimum Cost Spanning Tree and the Optimum Path Generation for the Multicasting Path Assignment," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 4, pp. 1033-1043, 1998. DOI: 10.3745/KIPSTE.1998.5.4.1033.

[ACM Style]
Park Moon Sung and Kim Jin Suk. 1998. The MCSTOP Algorithm about the Minimum Cost Spanning Tree and the Optimum Path Generation for the Multicasting Path Assignment. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 4, (1998), 1033-1043. DOI: 10.3745/KIPSTE.1998.5.4.1033.