p2p resource lookup
131775097
Query Learning Based Scheme for Pertinent Resource Lookup in Mobile P2P Networks
P2P networking has grasped an increasing interest worldwide among both researchers and computer networking professionals. As a witness, several P2P applications mainly used for file sharing over the Internet have been proposed. Considering the great success of mobile devices in recent years, P2P applications have also been deployed over mobile networks such as mobile ad hoc networks (MANETs) However, the mismatch between the P2P overlay and the MANET underlay topologies makes the resources lookup mechanism in mobile P2P applications very difficult. Therefore, this downside is the main hindrance to the deployment of such applications over MANETs. To overcome the mismatch issue, we propose in this paper RLSM P2P a cross layer resource lookup scheme for Mobile P2P applications. The main thrust of RLSM P2P consists of building an efficient unstructured P2P overlay that closely matches the underlay physical network and swiftly adapts to its volatility and dynamicity by considering different MANET constraints. Furthermore, RLSM P2P relies on a query learning resource lookup mechanism for locating pertinent resources to user queries. The performed experiments show that RLSM P2P outperforms its competitors in terms of effectiveness and efficiency.
IEEE Access
Taoufik Yeferny Sofian Hamad Sadok Ben Yahia
219466066
Finger Forwarding Scheme to Reduce Lookup Cost in Structured P2P Networks
Peer to peer (P2P) networks are distributed systems where each user shares his resources and cooperates with other users. These networks are designed over IP based infrastructure. The resources of each user in these networks are shared in a distributed way on a trust based mechanism. P2P networks have some unique characteristics like scalability and cost efficiency, which separate these networks from other distributed networks. These networks are mainly used for resource sharing. However, resource searching in this type of networks is not centrally controlled in nature. Further poor search scalability is another limitation of these networks. Chord like or chord based protocols used in the search operations in P2P networks utilize a finger table to shorten the query search length. We exploit the finger forwarding mechanism in our proposed scheme which further reduces the resource's search path length. We propose a last finger search table in addition to finger table to enhance the file lookup performance in the structured P2P networks. The proposed scheme reduces the lookup path and increases search efficiency as compared to the existing chord and binary search routing equivalent schemes.
Wirel. Pers. Commun.
Mahendra Singh Chiranjeev Kumar Prem Nath
212628663
A P2P Context Lookup Service for Multiple Smart Spaces
Context information has emerged as an important resource to enable autonomy and flexibility of pervasive applications. The widespread use of context information necessitates efficient wide area lookup services. In this paper, we present the design and implementation of a peer to peer context lookup system to support contextaware applications over multiple smart spaces. Our system provides a distributed repository for context storage, and a semantic peer to peer network for context lookup. Collaborative context aware applications that utilize different context information in multiple smart spaces can be easily built by invoking a pull or push service provided by our system. We outline the design and implementation of our system, and validate our system through the development of cross domain applications
ArXiv
Tao Gu Hung Keng Pung Daqing Zhang
201906992
Mobility Pattern Based Chord (MP Chord) for Enhanced Lookup Performance in Mobile P2P Networks
The peer to peer (P2P) systems are mainly designed for wired networks. These networks suffer from many challenges like malicious content distribution, free riding, whitewashing, poor search scalability, lack of a robust trust model, etc. The churn of the nodes makes topology management and searching resource more puzzling. When P2P protocols are implemented for mobile networks, it adds more challenges, specially the mobility management of the mobile users, intermittent connection, and limited bandwidth. Chord based protocols are widely deployed in the P2P networks but Chord can't perform well in the mobile P2P networks due to mobility of the users. The frequent join and depart of the mobile users creates Chord lookup failure and induces more cost to maintain the finger table. The mobility pattern of the mobile users can be considered to enhance of the Chord lookup performance for mobile P2P networks. It has been observed that most of the mobile users in the urban cities follow fixed mobility pattern which can be utilized to enhance the Chord performance. We have proposed a Mobility Pattern based Chord (MP Chord) scheme for structured mobile P2P networks. We have presented analytical modelling and performance analysis of the proposed scheme and existing schemes and found that the proposed scheme performs better than the existing Chord based schemes for mobile P2P networks.
Wirel. Pers. Commun.
Mahendra Singh Chiranjeev Kumar Prem Nath
7323371
Efficient data lookup in non DHT based low diameter structured P2P network
In this paper, we have considered a recently reported non DHT based structured P2P system. The architecture is based on Linear Diophantine Equation (LDE) and it is an interest based system; it offers very efficient data lookup. However, the architecture is restricted in that a peer cannot possess more than one distinct resource type. This may reduce the scope of its application. In this paper, we have extended the work by considering a generalization of the architecture, that is, a peer can possess multiple distinct resource types. We have proposed an efficient data lookup algorithm with time complexity bounded by (2+r/2) r is the number of distinct resource types. We have discussed about an alternative lookup scheme that needs constant number of hops and constant number of message exchanges. Besides, churn handling and ring maintenance have been shown to be very efficient.
2017 IEEE 15th International Conference on Industrial Informatics (INDIN)
Bidyut Gupta Nick Rahimi Shahram Rahimi Ashraf Alyanbaawi
208938024
2P Lookup: Popularity and Proximity based P2P Lookup mechanism over MANETs
With the emergence of P2P applications and mobile devices, users express the need of exchanging data anywhere, anytime. This encouraged the deployment of P2P applications on mobile environment. In resource sharing applications over mobile ad hoc networks, resource search mechanisms reveal new challenges because of the mismatch between the P2P overlay and the MANET underlay and the critical constraints of MANET nodes (high mobility and energy limitation) In this paper, we propose 2P Lookup, a Popularity and Proximity based P2P Lookup mechanism over MANETs. Our mechanism is composed of two main steps: in the first one, we propose a cross layer optimization which consists in building the P2P overlay based on physical proximity of peers in order to reduce the mismatch between the overlay and the MANET topologies. This optimization likely matches between overlay and underlay paths which consequently reduces the search delay, increases the success rate, reduces communication redundancy and unnecessary network traffic. In the second step, we focus on the search query routing and we propose a resource popularity biased random walk to efficiently guide the search query and control its propagation. Our biased random walk optimization further reduces the network traffic without influencing the search success rate. Simulation results show that 2P Lookup is efficient in a MANET underlay and have better search performances comparing to other related works. HighlightsWe propose 2P Lookup, a Popularity and Proximity based P2P resource Lookup over MANETs.The strength of 2P Lookup is the exploitation of: (1) Mobile nodes proximity to build overlay links in order to reduce overlay paths and remove communication redundancy in the network, (2) The resource popularity to guide the search query in order to increase search success rate and decrease the delay.In the beginning of the manuscript, we present a detailed background and state of the art of the existing resource search techniques over MANETs. Next, we detail 2P Lookup design and finally we evaluate its performances.Simulation results consolidate our design and show that being aware of the MANET underlay and exploiting the resource popularity offer promising search performances in a mobile P2P environment.
J. Netw. Comput. Appl.
Manel Seddiki Mahfoud Benchaiba
34838714
A Symmetric Lookup based Secure P2P Routing Algorithm
To prevent structured peer to peer (P2P) overlay networksfrom being attacked by malicious nodes, a symmetric lookup based routing algorithm referred to as Symmetric Chord is proposed in this paper. The proposed algorithm determines the precision of routing lookup by constructing multiple paths to the destination. The selective routing algorithm is used to acquire information on the neighbors of the root. Authenticity of the root is validated via consistency shown between the information ascertained from the neighbors and information from the yet to be verified root, resulting in greater efficiency of resource lookup. Simulation results demonstrate that Symmetric Chordhas the capability of detecting malicious nodes both accurately and efficiently, so as to identify which root holds the correct key, and provides an effective approach to the routing security for the P2P overlay network.
KSII Trans. Internet Inf. Syst.
Bingqing Luo Yiai Jin Shengmei Luo Zhixin Sun
216344777
Rock, Paper, Scissors Game Based Model for Content Discovery in P2P MANETs
Resource discovery is a key challenge in dynamic environment such as Peer to Peer (P2P) MANETs. To leverage the lookup costs and efficiently discover the resources, the peers in a P2P network communicate with each other forming one or more overlay structure. And, thus the peer's connections in such overlay networks plays a crucial role. To harness this, we propose a model that focuses on the underlying network topology as each virtual link of the overlay network is supported by a path in the underlying physical network. Also, we design a new resource discovery algorithm that uses the famous Rock Paper Scissors (RPS) game ideology. In this work, we present a Rock Paper Scissors Game Based (RPSGB) algorithm for content discovery in mobile peer to peer network. The proposed work focuses on providing efficient resource discovery scheme in such a dynamic network, using the game theory concepts. Our scheme is a light weight model aimed to suit the unstructured architecture better. The major goal of this work, is to reduce the consumption of power, minimize the lookup cost, lower the bandwidth consumption, and increase the hit ratio. We compare our scheme with the traditional well known benchmarked schemes. After evaluation, the simulation results justify the effectiveness of the proposed protocol. The obtained results show that the proposed scheme substantially decreases the network traffic, lowers the battery power and bandwidth consumption, while having good search efficiency. Also, the search latency is minimized. The result justifies that RPSGB algorithm proposes to make resource searching much more efficient, and improves the statistics against the posed challenges.
Wirel. Pers. Commun.
Ajay Arunachalam
213907564
Design of RC Based Low Diameter Two Level Hierarchical Structured P2P Network Architecture
In this paper, we have applied modular arithmetic, specifically residue class (RC) to design a non DHT based low diameter hierarchical structured P2P network. It is an interest based two level architecture. At its second level, diameter of each cluster (group) of peers is one. It helps in designing very efficient data lookup algorithms. Besides, complexity involved in data lookup is a function of the number of distinct resource types unlike in DHT based structured P2P systems. In addition, use of the same code to denote a resource type and the corresponding group head has made the search process simple and efficient.
Swathi Kaluvakuri Bidyut Gupta Banafsheh Rekabdar Koushik Maddali Narayan C Debnath
209471058
A Novel Approach Toward Designing a Non DHT Based Structured P2P Network Architecture
In this paper, we have applied modular arithmetic, specifically residue class (RC) to design a non DHT based structured P2P network. It is an interest based tree architecture. It is known as pyramid tree. A node i in this tree represents a group of peers that are interested in a particular resource of type i. It is not a conventional tree. In the present work, such a P2P architecture has been the choice because in a complete pyramid tree, multiple paths exist between most of its nodes. Such a structural characteristic can be helpful from the viewpoints of designing load balanced as well as robust communication protocols. Besides, search latency for its intergroup data lookup algorithm is bounded by the tree diameter and is independent of the number of the distinct resource types as well as the total number of peers present in the system. In addition, any intra group data look up communication needs only one overlay hop. Index Terms Structured P2P network, Residue class, pyramid tree, tree diameter
Indranil Roy Bidyut Gupta Banafsheh Rekabdar Henry Hexmoor