Cheatproof Dual-Tree Application-Level Multicast for Bulk Data Distribution

概要

論文の詳細を見る
Application-level multicast has drawn a lot of attention as an alternative to IP multicast. In application-level multicast, multicast related features, such as group membership management, packet replication and packet forwarding are implemented at end-hosts instead of routers. The host perceived transmission quality and multicast forwarding responsibility depend on its position in the multicast distribution tree. This nature of application-level multicast motivates selfish members to alter their position by unrightful means to maximize their private benefits. Uncooperative behaviors of these selfish members, i.e. cheating, increase unfairness between selfish members and faithful members. In the context of bulk data distribution, this unfairness between members significantly impacts the receiver throughput. In this paper, to alleviate the negative impact of cheating members, we propose a new tree building protocol which builds dual multicast trees. Our proposed protocol constructs a shortest-widest path tree as the 1st tree. The members having lower position in the 1st tree are located at higher position in the 2nd tree in exchange for their unfairness. To investigate performance of our proposed protocol, it is compared with the existing application-level multicast protocol. Our simulation results show that our protocol outperforms the existing protocol from the view point of throughput and resource utilization against member cheating.