scholarly journals “Q-Feed”—An Effective Solution for the Free-Riding Problem in Unstructured P2P Networks

2010 ◽  
Vol 2010 ◽  
pp. 1-14 ◽  
Author(s):  
Sabu M. Thampi ◽  
Chandra Sekaran K
Keyword(s):  
Control Mechanism ◽  
Free Riding ◽  
Effective Solution ◽  
P2p Networks ◽  
Q Learning ◽  
Free Riders ◽  
Replication Scheme ◽  
Simulation Results ◽  
Unstructured P2p ◽  
Different Levels

This paper presents a solution for reducing the ill effects of free-riders in decentralised unstructured P2P networks. An autonomous replication scheme is proposed to improve the availability and enhance system performance. Q-learning is widely employed in different situations to improve the accuracy in decision making by each peer. Based on the performance of neighbours of a peer, every neighbour is awarded different levels of ranks. At the same time a low-performing node is allowed to improve its rank in different ways. Simulation results show that Q-learning-based free riding control mechanism effectively limits the services received by free-riders and also encourages the low-performing neighbours to improve their position. The popular files are autonomously replicated to nodes possessing required parameters. Due to this improvement of quantity of popular files, free riders are given opportunity to lift their position for active participation in the network for sharing files. Q-feed effectively manages queries from free riders and reduces network traffic significantly.

Cooperating with free riders in unstructured P2P networks

2012 ◽  
Vol 56 (1) ◽  
pp. 198-212 ◽  
Author(s):  
Yuh-Jzer Joung ◽  
Terry Hui-Ye Chiu ◽  
Shy-Min Chen
Keyword(s):  
P2p Networks ◽  
Free Riders ◽  
Unstructured P2p

ISW

2012 ◽  
Vol 4 (4) ◽  
pp. 26-40
Author(s):  
Jinlong Zeng ◽  
Guifeng Zheng
Keyword(s):  
Small World ◽  
Clustering Coefficient ◽  
P2p Network ◽  
Small World Network ◽  
Challenging Problem ◽  
P2p Networks ◽  
User Interest ◽  
Unstructured P2p Network ◽  
Simulation Results ◽  
Unstructured P2p

Content location in unstructured peer-to-peer (P2P) networks is a challenging problem. In this paper, the authors present a novel Interest-based Small World (ISW) network to address the problem, by constructing a cluster overlay in the unstructured P2P network based on the small world paradigm and user interest. There are many attractive properties of a small world network, such as low average hop distance and high clustering coefficient. Interest locality can improve the awareness of user’s indeed intentions. The authors’ scheme combines their advantage to create a better solution. The simulation results show that our scheme outperforms other schemes significantly.

Collaborative Q-Learning Based Routing Control in Unstructured P2P Networks

2016 ◽  
pp. 910-921
Author(s):  
Xiang-Jun Shen ◽  
Qing Chang ◽  
Jian-Ping Gou ◽  
Qi-Rong Mao ◽  
Zheng-Jun Zha ◽  
...  
Keyword(s):  
P2p Networks ◽  
Q Learning ◽  
Routing Control ◽  
Unstructured P2p

Gpop

2015 ◽  
Vol 6 (3) ◽  
pp. 51-64 ◽  
Author(s):  
Manel Seddiki ◽  
Mahfoud Benchaïba
Keyword(s):  
Local Knowledge ◽  
The Other ◽  
Partial Knowledge ◽  
P2p Networks ◽  
Global Knowledge ◽  
Research Areas ◽  
Object Search ◽  
Shared Objects ◽  
Simulation Results ◽  
Unstructured P2p

Unstructured overlays such as P2P networks and social networks stimulate many research areas. This kind of overlays is composed of a set of self-manageable entities which share objects between them in a spontaneous way. Getting a global knowledge such as popularity of shared objects or reputation of the entity is a challenging task because in such overlays, entities have only partial knowledge about the overlay state. In this paper, the authors focus on the file popularity measurement because this parameter can be efficiently used to improve object replication and object search performances. Some research works are proposed to measure this parameter, but these measurements are only based on local knowledge of peers. The authors propose Gpop, a global file popularity measurement for unstructured P2P networks which considers both local knowledge of the peer and knowledge of the other peers participating in the network to gain a global-like knowledge. Simulation results reinforce the authors' theoretical propositions and show that our measurement is closer to the real file popularity.

An Efficient Searching Scheme in Unstructured P2P Networks

2010 ◽  
Vol 439-440 ◽  
pp. 865-869 ◽  
Author(s):  
Ming Zhang ◽  
Jin Qiu Yang
Keyword(s):  
Routing Protocol ◽  
Adaptive Routing ◽  
P2p Networks ◽  
Community Network ◽  
Simple Scheme ◽  
P2p Systems ◽  
Simulation Results ◽  
Unstructured P2p ◽  
P2p System ◽  
Present Simulation

Unstructured peer-to-peer (P2P) systems，due to their excellent support for content lookup and sharing，are creating a large proportion of network traffic in today’s Internet. A P2P system typically involves thousands or millions of live peers in the network. In this paper, we propose and evaluate an efficient searching scheme in unstructured P2P networks. This scheme proposes a local adaptive routing protocol. This routing protocol adopts a simple scheme which driven by query interest among peers. We analyze this scheme’s performance and present simulation results. Our simulation results demonstrated the benefits of the proposed system and show that the approach is able to dynamically group nodes in clusters containing peers with shared interests, at the same time, and organized into a community network.

Reducing Network Overhead with Common Junction Methodology

2011 ◽  
Vol 3 (3) ◽  
pp. 51-61
Author(s):  
Shashi Bhushan ◽  
M. Dave ◽  
R.B. Patel
Keyword(s):  
Response Time ◽  
P2p Networks ◽  
P2p Systems ◽  
Mismatch Problem ◽  
Simulated Network ◽  
The Common ◽  
Simulation Results ◽  
Unstructured P2p ◽  
Network Overhead ◽  
Topology Mismatch

In structured and unstructured Peer-to-Peer (P2P) systems, frequent joining and leaving of peer nodes causes topology mismatch between the P2P logical overlay network and the physical underlay network. This topology mismatch problem generates high volumes of redundant traffic in the network. This paper presents Common Junction Methodology (CJM) to reduce network overhead by optimize the overlay traffic at underlay level. CJM finds common junction between available paths, and traffic is only routed through the common junction and not through the conventional identified paths. CJM does not alter overlay topology and performs without affecting the search scope of the network. Simulation results show that CJM resolves the mismatch problem and significantly reduces redundant P2P traffic up to 87% in the best case for the simulated network. CJM can be implemented over structured or unstructured P2P networks, and also reduces the response time by 53% approximately for the network.

Sign in / Sign up

Export Citation Format

Share Document