A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
IEEE Internet Computing
Comparing Hybrid Peer-to-Peer Systems
Proceedings of the 27th International Conference on Very Large Data Bases
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Building Peer-to-Peer Systems with Chord, a Distributed Lookup Service
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
[15] Peer-to-Peer Architecture Case Study: Gnutella Network
P2P '01 Proceedings of the First International Conference on Peer-to-Peer Computing
Modeling and performance analysis of BitTorrent-like peer-to-peer networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Percolation Search in Power Law Networks: Making Unstructured Peer-to-Peer Networks Scalable
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Cache Updates in a Peer-to-Peer Network of Mobile Agents
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Analysis of resource transfers in peer-to-peer file sharing applications using fluid models
Performance Evaluation - P2P computing systems
Random graphs as models of hierarchical peer-to-peer networks
Performance Evaluation
Stochastic analysis of file-swarming systems
Performance Evaluation
A queueing approach to optimal resource replication in wireless sensor networks
Performance Evaluation
Model-based evaluation of search strategies in peer-to- peer networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
International Journal of Communication Networks and Distributed Systems
Branching processes, the max-plus algebra and network calculus
ASMTA'12 Proceedings of the 19th international conference on Analytical and Stochastic Modeling Techniques and Applications
An efficient resource discovery framework for pure unstructured peer-to-peer systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance Analysis and Improvement Content Discovery Protocols Over Vehicular Networks
Wireless Personal Communications: An International Journal
Modeling and optimizing Random Walk content discovery protocol over mobile ad-hoc networks
Performance Evaluation
| Hi-index | 0.00 |
This paper presents an analytical framework to study search strategies in large-scale decentralized unstructured peer-to-peer (P2P) networks. The peers comprising the P2P network and their application-level connections are modeled as generalized random graphs (GRGs) whose simple and efficient analysis is accomplished using the generating function of the graph's degree distribution. The framework we defined allows the computation of several interesting performance indexes to be used to compare different search strategies: in particular, the average number of messages sent throughout the P2P network and the probability that a query is successful are used as examples. Furthermore, assuming that the cumulative distribution function (CDF) of the time required by a peer to positively reply to a query is known, we show how to derive the CDF of the time it takes for a randomly chosen peer to obtain at least one positive reply from other peers. The approach is validated through simulation showing that the accuracy of the proposed model improves as the size of the P2P network increases making it a suitable tool for the analysis of search strategies in large-scale systems.