A Scheme to Solve P2P ALTO Problem

Abstract

Peer-to-peer (P2P) systems, which are realized as overlays on top of the underlying Internet routing architecture, contribute a significant portion of today’s Internet traffic. But as the P2P systems has no access to the underlying network, it either has to measure the path performance itself or build its overlay topology agnostic of the underlay, which often leads to traffic management challenges for Internet Service Providers (ISPs) and poor QoS for users. To overcome these problems, we design a scheme, which clusters the P2P peers based on the topology information of the physical network they belong to, and employ caching mechanism then guides the users’ behaviors globally, so the resources can be downloaded rapidly without taking wrong paths. Our event-based simulations show that with our algorithm, the time of downloading files in Bit Torrent (BT) is reduced compared to traditional BT. So that our algorithm can be used to the P2P file sharing systems which pay no attention to underlying network information to improve performance.