Resource-Aware Update Policy for Highly Dynamic P2P Networks

As a user attention has become a precious resource, a special care has to be taken to reduce the time needed for answering queries in P2P networks. Existing solutions are usually not fully aware of the seriousness to carefully use available network resources, and they are often focused on guarantying that results are found or that given update is propagated to all peers. Since the costs for giving such guaranties might be extremely large, a core of this paper is focused on presenting one update policy that carefully utilises available network resources and tries to improve itself by learning the importance of available peers. The rationality of having such update policy is supported by analysing the usage of peers together with estimating the load values of different network links.