A Traffic Cache for Structure Peer-to-Peer Networks

The rise in peer-to-peer (P2P) networking has been tremendous in last several years; a large amount of network bandwidth backbone is consumed by P2P traffic. Although many methods have been proposed to manage P2P traffic, these methods require a lot of knowledge about the workloads and are generally difficult to implement. In this paper, we propose a mechanism of traffic cache based on P2P networks and simply modify LRU algorithm to improve cache hit ratio. A series of simulation experiments on the OMNeT++ show that the mechanism can greatly increase the proportion of local area network traffic while P2P downloads are done and effectively reduce the cross-border traffic for having a good way to reduce backbone load.

[1]  Krishna P. Gummadi,et al.  Measurement, modeling, and analysis of a peer-to-peer file-sharing workload , 2003, SOSP '03.

[2]  Pablo Rodriguez,et al.  Should internet service providers fear peer-assisted content distribution? , 2005, IMC '05.

[3]  Mohamed Hefeeda,et al.  Modeling and Caching of Peer-to-Peer Traffic , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[4]  Adam Wierzbicki,et al.  Cache replacement policies revisited: the case of P2P traffic , 2004, IEEE International Symposium on Cluster Computing and the Grid, 2004. CCGrid 2004..

[5]  Abraham Silberschatz,et al.  P4p: provider portal for applications , 2008, SIGCOMM '08.

[6]  Evangelos P. Markatos,et al.  Tracing a Large-Scale Peer to Peer System: An Hour in the Life of Gnutella , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).