การจัดเส้นทางแบบมัลติคาสต์บนโครงข่ายเอทีเอ็มโดยใช้ฮิวริสติกอัลกอริทึม / สุชัย โรจนวิไลกุล = Multicast routing over an ATM network using an heuristic algorithm / Suchai Rojnawilikul
This thesis proposes two heuristic algorithms for solving multicast routing over ATM network. Using virtual network concept and shortest path routing which are originally used in point-to-point ATM network. We adapted Steiner Tree to find routes for multicast. The proposed algorithms p1 and p2 are compared with Jia (1995) algorithm. The objective function used for this work consists of cost of bandwidth, cost of connection establishment and cost of VP and VC switching. The simulation results show that the proposed algorithm p1 uses bandwidth less than Jia algoriithms within 0.35%-11.31% range and saves cost of VP switching in the range of 13.51%-45.16%. While its cost of connection establishment has grown up to 0.09%-24% and cost of VC switching is also increased within 0.09%-20%. It is found that the changing intervals of such costs are relevant to the changing of number of Steiner nodes used. p2 algorithm gives comparable costs with Jia algorithm. When comparing path length and running time of all investigated algorithms, p1 and p2 algorithms take shorter path length and faster running time than Jia algorithm. Moreover, the modification of two proposed algorithms for using in dynamic multicast situation can be applied in the network which has the size of less than 40 nodes.