International Journal for Development of Computer Science & Technology (IJDCST)
Changing network dynamics is a critical issue in many overlay networks especially in peer-to-peer 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).