Resource discovery mechanisms in pure unstructured peer-to-peer systems: a comprehensive survey

Khatibi, Elahe; Sharifi, Mohsen

doi:10.1007/s12083-020-01027-9

Cited by 11 publications

(5 citation statements)

References 66 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Unstructured P2P networks, which do not rely on a global index, have traditionally used flooding methods and random walk schemes to distribute object queries in the network. However, these approaches present disadvantages in terms of network overhead and scalability (Khatibi & Sharifi, 2021).…”

Section: Related Workmentioning

confidence: 99%

Towards a Formal MultipathP2P Protocol

Abassi,

Riahla,

Tamine

et al. 2024

International Journal of Business Data Communications and Networking

View full text Add to dashboard Cite

Peer-To-Peer networks are becoming increasingly common as a mean of transferring files over Internet. In this paper, we describe, first, the design and implementation of our P2P system (MultiPathP2P). This latter is based on the social networks concepts where nodes are identified through their virtual addresses, we have designed our protocol based on 1) An architecture exploiting the principle of social networks where nodes are identified by virtual addresses and are able to randomly change their neighbors 2) A process of data request and file sharing differing from those supported in other P2P networks. Second, we present a formal validation of our proposal in order to prove its optimality and completeness.

show abstract

Section: Related Workmentioning

confidence: 99%

Towards a Formal MultipathP2P Protocol

Abassi,

Riahla,

Tamine

et al. 2024

International Journal of Business Data Communications and Networking

View full text Add to dashboard Cite

show abstract

“…The above formulation is attractive because it contains the computational complexity to the encoding function η, which can be pre-computed during indexing. In contrast, the comparison function φ is executed at query time and is therefore chosen to be computationally lightweight; usually, the dot product or cosine similarity is chosen 7 . These choices cast the retrieval as a k nearest-neighbor problem, which can be computed efficiently with popular approximation algorithms, e.g., based on locality sensitive hashing or hierarchical navigable small world graphs [28].…”

Section: A Centralized Settingmentioning

confidence: 99%

“…However, this practice carries fundamental bandwidth and storage constraints [6] and exact keyword matching is dated compared to the semantic awareness of modern search engines. On the other hand, unstructured search techniques, such as flooding, random walks, index sharing, and query caching [7] often suffer from high communication overhead and unpredictable delays. Finally, blockchain has been used to reward nodes for executing indexing and retrieval operations in decentralized search engines, such as Presearch 5 , but broadcasting indexes to all nodes is prohibitive in terms of bandwidth and storage.…”

Section: Introductionmentioning

confidence: 99%

A Graph Diffusion Scheme for Decentralized Content Search based on Personalized PageRank

Giatsoglou¹,

Krasanakis²,

Papadopoulos³

et al. 2022

Preprint

View full text Add to dashboard Cite

Decentralization is emerging as a key feature of the future Internet. However, effective algorithms for search are missing from state-of-the-art decentralized technologies, such as distributed hash tables and blockchain. This is surprising, since decentralized search has been studied extensively in earlier peerto-peer (P2P) literature. In this work, we adopt a fresh outlook for decentralized search in P2P networks that is inspired by advancements in dense information retrieval and graph signal processing. In particular, we generate latent representations of P2P nodes based on their stored documents and diffuse them to the rest of the network with graph filters, such as personalized PageRank. We then use the diffused representations to guide search queries towards relevant content. Our preliminary approach is successful in locating relevant documents in nearby nodes but the accuracy declines sharply with the number of stored documents, highlighting the need for more sophisticated techniques.

show abstract

“…Unstructured protocols, where the overlay links between peers are established arbitrarily, in such kind of networks, if a peer look for a specific piece of data in the network, must flooded the network by sending a query message to all peers to find as many peers as possible that share the target data, with unstructured networks there is no guarantee the queries send by peers to be resolved, due the different reparation of pieces between peers [12]. Certain content can be reachable a cause its availability at several peers and certain unreachable for its lack, where data shared by a few number of peers, additional there is no correlation between peers and content managed by it [13].…”

Section: Introductionmentioning

confidence: 99%

BusCache: V2V-Based Infrastructure-Free Content Dissemination System for the Internet of Vehicles

Naouri,

Nouri,

Khelloufi

et al. 2024

IEEE Access

View full text Add to dashboard Cite

Internet of Vehicles (IoV) offers many services aiming to enhance the safety and comfort drivers and passengers such as accident alarm, congestion avoidance and multimedia, entertainment applications. Cooperatively share and retrieve large-scale files in IoV is a challenging task due extremely volatile nature of IoV. Therefore, it is paramount to develop a vehicle to vehicle (V2V) content delivery mechanism that can adapt with IoV communication requirements. One of the challenging tasks in this regard is to locate content pieces and gather information about peers. Previous proposed systems broadcast beacon message to the whole network to locate certain content pieces, which consume the bandwidth and limits the network resource. To overcome these issues, in this paper we propose BusCache, a traffic-Aware content delivery system for IoV. BusCache uses buses as trackers for the content distribution on the overlay network, due to their availability and unique characteristics (predefined trajectories and time). Instead of flooding the entire network, a request to the bus is enough to determine the pieces location. We first propose a cluttering strategy to control the data follow between peers without rely on infrastructure, which reduces the end-to-end delay network between the receiving peer and the tracked node. Then we introduce a peer selection mechanism that selects the most appropriate peers that will deliver the desired content by taking into account their velocity, destination and other traffic related factors. Finally, we proposed policy-based content selection algorithm that identify and prioritize the scarce content that is present in just few vehicles. Simulation results show that BusCache can reduce content lookup time and content dissemination compare to state-of-the-art approaches.INDEX TERMS Peer selection algorithm, content dissemination, V2V dissemination, Internet of Vehicles (IoV), Quality of Experience (QoE).

show abstract

Resource discovery mechanisms in pure unstructured peer-to-peer systems: a comprehensive survey

Cited by 11 publications

References 66 publications

Towards a Formal MultipathP2P Protocol

Towards a Formal MultipathP2P Protocol

A Graph Diffusion Scheme for Decentralized Content Search based on Personalized PageRank

BusCache: V2V-Based Infrastructure-Free Content Dissemination System for the Internet of Vehicles

Contact Info

Product

Resources

About