Truthful application-layer multicast in mesh-based selfish overlays

Building a multicast tree in an overlay network is the major problem in application layer multicast. In a selfish overlay network, the end hosts may not be cooperative. They are willing to maximize their own benefits instead of being loyal to the protocol or altruistically contributing to the benefits of the whole overlay network. In this paper, we design a strategyproof mechanism in building a truthful minimum cost multicast tree in the mesh-tree way, which could simplify the overlay construction and maintenance. We model the network in both simple and general cost model. We conduct simulation to study the relationship between utility of cheating node and other nodes