Cost-Driven Peer Rating Algorithm

The paper presents a concept of a rating algorithm aiming at overall peer-to-peer traffic reduction (and locality awareness) and decrease of load on costly links, thus diminishing operator´s costs. The rating algorithm is not only performed by a sole Oracle, as is typically proposed, but its operation is also supported by a similar entity located in other domains. Due to this concept, a usually omitted fact that the inter-domain routes are asymmetrical is properly dealt with. Simulations performed on a real topology show the usefulness of the presented approach.