Strategies to Improve Reliability in Routing Overlay Networks with Selfish Nodes

Bruno Gusmão RochaVirgilio AlmeidaDorgival Guedes

Routing overlay networks use the current Internet infrastructure to provide support for a wide range of applications, such as content distribution, multiplayer games, search and web services. Recent studies have suggested that those networks may contain selfish nodes, i.e., nodes that develop their strategies considering only their own objectives and interests, regardless of the optimal global behavior. Extremely egoistic nodes may even decide not to give their own resources back to the network (free-riders), making overlay service unavailable to every node that depends on them. In this paper, we approach the problem of increasing the reliability of overlay services by detecting and removing free-riders from the selfish overlay network. We use a game-theoretic approach to evaluate the mechanism, and we show that service reliability can be increased to up 83% even when 70% of the network is formed by free-riders. Our mechanism is also fairly simple and can be efficiently distributed.

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato:
     Mantida por: