The Community for Technology Leaders
Green Image
Issue No. 10 - Oct. (2015 vol. 64)
ISSN: 0018-9340
pp: 2953-2967
Haiying Shen , Department of Electrical and Computer Engineering, Clemson University, Clemson, SC
Guoxin Liu , Department of Electrical and Computer Engineering, Clemson University, Clemson, SC
Harrison Chandler , Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI
In peer-to-peer file sharing systems, file replication helps to avoid overloading file owners and improve file query efficiency. There exists a tradeoff between minimizing the number of replicas (i.e., replication overhead) and maximizing the replica hit rate (which reduces file querying latency). More replicas lead to increased replication overhead and higher replica hit rates and vice versa. An ideal replication method should generate a low overhead burden to the system while providing low query latency to the users. However, previous replication methods either achieve high hit rates at the cost of many replicas or produce low hit rates. To reduce replicas while guaranteeing high hit rate, this paper presents SWARM, a file replication mechanism based on swarm intelligence. Recognizing the power of collective behaviors, SWARM identifies node swarms with common node interests and close proximity. Unlike most earlier methods, SWARM determines the placement of a file replica based on the accumulated query rates of nodes in a swarm rather than a single node. Replicas are shared by the nodes in a swarm, leading to fewer replicas and high querying efficiency. In addition, SWARM has a novel consistency maintenance algorithm that propagates an update message between proximity-close nodes in a tree fashion from the top to the bottom. Experimental results from the real-world PlanetLab testbed and the PeerSim simulator demonstrate the effectiveness of the SWARM mechanism in comparison with other file replication and consistency maintenance methods. SWARM can reduce querying latency by 40-58 percent, reduce the number of replicas by 39-76 percent, and achieves more than 84 percent higher hit rates compared to previous methods. It also can reduce the consistency maintenance overhead by 49-99 percent compared to previous consistency maintenance methods.
Servers, Maintenance engineering, Peer-to-peer computing, Particle swarm optimization, Indexes, Clustering algorithms, Routing

H. Shen, G. Liu and H. Chandler, "Swarm Intelligence Based File Replication and Consistency Maintenance in Structured P2P File Sharing Systems," in IEEE Transactions on Computers, vol. 64, no. 10, pp. 2953-2967, 2015.
241 ms
(Ver 3.3 (11022016))