Multicast Routing Algorithm under Cell Replication Limits of Switches in ATM Networks

ATM 망에서 교환기의 셀 복제 능력을 고려한 멀티캐스트 라우팅 알고리듬

In this paper, we present an algorithm for the multicast routing problem when there exit the cell replication limits of ATM switching nodes. This problem can be formulated as a Degree Constrained Minimum Steiner Tree Problem(DCSP). The proposed algorithm is a modification of the shortest path heuristic originally devised for minimum Steiner tree problem. From the experimental results, it can be seen that our algorithm is efficient to obtain a near optimal solution with comparatively low computational time.