Event Dissemination Protocol for SNS inspired P2P Games

Changing network dynamics is a critical issue in many overlay networks especially in peer-topeer systems. Previously these network formations were approached in two ways. Firstly by implementing practical heuristics for cooperative peers, and later performing game theoretic analysis for selfish peers. Selfish Neighbor Selection (SNS) game theory is designed and implemented in overlay routing that unifies the aforementioned ways. SNS limits number of neighbors for each peer. This approach reduces link monitoring overhead in overlay networks from O(n2) to O(n). Best response wirings increases the utility of Overlays and Simple heuristic wirings benefits non-selfish nodes. With that regard we highlight the fact that in a frequent Event Dissemination systems such as a multi-player P2P games, users(players) generate game events at a rate that can be approximated using some (game dependent) probability distribution. For an optimized performance especially considering p2p gaming we propose a threefold event dissemination model using gossip schemes that increases the contributions of a selfish peer toward the entire network.