A novel overlay multicast routing scheme based on topology community detection
Jun Feng Lu, Qi Bing · 2008
Current overlay multicast research focuses on its routing optimization folly considering its related network topology characteristics. To solve the multicast scalability issue, this paper proposed a novel multicast routing algorithm (S-MSPT) for the overlay network, inspired by the topology community detection in complex network theory. S-MSPT firstly mapped MSNs (Multicast Service Node) to a 2-dimension feature space. Then it divided MSNs into the communities and selected one MSN as the community center based on a clustering method. Finally the scheme applied a heuristic method to form a SPT-based hierarchical routing topology based on inter-community MSNs (composed by community centers and source MSN) and intra-community MSNs (rooted by its center) respectively. The experiments demonstrated that the proposed scheme is effective in the topology detection and the routing design with better scalable performance.