An Efficient Multicast Routing Algorithm in BCube Networks

• Main Authors: Lo, Tzu-Ting, 羅子庭
• Other Authors: Sheu, Jang-Ping
• Format: Others
• Language: en_US
• Published: 2014
• Online Access: http://ndltd.ncl.edu.tw/handle/75897682384971448107

碩士 === 國立清華大學 === 資訊工程學系 === 102 === In recent years, cloud computing becomes more and more popular. BCube is one of the novel architecture proposed for data centers. However, finding a multicast tree in BCube is a Steiner tree problem which is an NP-hard problem. We propose a heuristic algorithm, Resource-Saving Multicast Tree (RSMT) algorithm. The goal of RSMT is to find a multicast tree with high path reusability for a multicast group. We design a greedy method that picks a local optimal receiver and union it to multicast tree at a time. RSMT also can handle the dynamic joining and leaving of receivers by reconstructing the multicast tree when it is no longer efficient. The experiment result shows that we can find a multicast tree with lower communication cost and higher throughput compared to existed solutions. Furthermore, we observe that we can sacrifice some delay-time of some receivers to reduce the total communication cost of a multicast tree for small BCube with small multicast group size.