On Cooperative and Efficient Overlay Network Evolution based on Group Selection Pattern精选.pdf

IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS—PART B: CYBERNETICS, VOL. 40, NO. 2, APRIL 2010 493 On Cooperative and Efficient Overlay Network Evolution Based on a Group Selection Pattern Yufeng Wang and Akihiro Nakao Abstract—In overlay networks, the interplay between network merous constituent parts. If all the participating peers contribute structure and dynamics remains largely unexplored. In this paper, some of their resources, for instance, bandwidth, memory, or we study dynamic coevolution between individual rational strate- central processing unit cycles, highly scalable decentralized gies (cooperative or defect) and the overlay network structure, that is, the interaction between peer’s local rational behaviors and systems can be built, which significantly outperform existing the emergence of the whole network structure. We propose an server-based solutions. Unfortunately, in reality, many peers are evolutionary game theory (EGT)-based overlay topology evolution selfish and strive to maximize their own utility by exploiting the scheme to drive a given overlay into the small-world structure system without contributing much themselves. A well-known (high global network efficiency and average clustering coefficient). mechanism designed to cope with the free-riding problem is Our contributions are the following threefold: From the viewpoint of peers’ local interactions, we explicitly consider the peer’s ratio- the tit-for-tat policy, which is a kind of direct reciprocity [2] nal behavior and introduce a link-formation game to characterize that is employed by the peer-to-peer (P2P) file-distribution the social dilemma o