Results 1 - 10 of 12,702

Search and replication in unstructured peer-to-peer networks

by Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker , 2002
"... Abstract Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applicationsbecause they require no centralized directories and no precise control over network topologies and data placement. However, the flooding-based query algorithm used in Gnutella does n ..."
Abstract - Cited by 692 (6 self) - Add to MetaCart
Abstract Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applicationsbecause they require no centralized directories and no precise control over network topologies and data placement. However, the flooding-based query algorithm used in Gnutella does

Unstructured Peer-to-Peer Networks

by Ali Mohammad Saghiri, Mohammad Reza Meybodi
"... Abstract: Peer-to-peer networks are overlay networks that are built on top of communication networks that are called underlay networks. In these networks, peers are unaware of the underlying networks, so the peers choose their neighbors without considering the underlay positions, and therefore the r ..."
Abstract - Add to MetaCart
Abstract: Peer-to-peer networks are overlay networks that are built on top of communication networks that are called underlay networks. In these networks, peers are unaware of the underlying networks, so the peers choose their neighbors without considering the underlay positions, and therefore

Randomized Algorithms in Unstructured Peer-to-Peer Networks

by Jean Pierre Thibault
"... We present a survey of random algorithms in unstructured peer-to-peer networks by focusing on search, replication, and construction algorithms. A heavy emphasis is placed on the scalability and performance of the various schemes studied. The importance of random algorithms emerges clearly from thi ..."
Abstract - Add to MetaCart
We present a survey of random algorithms in unstructured peer-to-peer networks by focusing on search, replication, and construction algorithms. A heavy emphasis is placed on the scalability and performance of the various schemes studied. The importance of random algorithms emerges clearly from

Replication Strategies in Unstructured Peer-to-Peer Networks

by Edith Cohen, Scott Shenker , 2002
"... The Peer-to-Peer (P2P) architectures that are most prevalent in today's Internet are decentralized and unstructured. Search is blind in that it is independent of the query and is thus not more effective than probing randomly chosen peers. One technique to improve the effectiveness of blind sear ..."
Abstract - Cited by 324 (6 self) - Add to MetaCart
The Peer-to-Peer (P2P) architectures that are most prevalent in today's Internet are decentralized and unstructured. Search is blind in that it is independent of the query and is thus not more effective than probing randomly chosen peers. One technique to improve the effectiveness of blind

Search Algorithms for Unstructured Peer-to-Peer Networks

by Reza Dorrigiv, Alejandro López-ortiz
"... Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as well as a new hybrid algorithm proposed in this paper. This hybrid algorithm first uses flooding to find sufficient number o ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as well as a new hybrid algorithm proposed in this paper. This hybrid algorithm first uses flooding to find sufficient number

On Unbiased Sampling for Unstructured Peer-to-Peer Networks

by Daniel Stutzbach, Reza Rejaie - in Proc. ACM IMC , 2006
"... This paper addresses the difficult problem of selecting representative samples of peer properties (e.g., degree, link bandwidth, number of files shared) in unstructured peer-to-peer systems. Due to the large size and dynamic nature of these systems, measuring the quantities of interest on every peer ..."
Abstract - Cited by 81 (8 self) - Add to MetaCart
This paper addresses the difficult problem of selecting representative samples of peer properties (e.g., degree, link bandwidth, number of files shared) in unstructured peer-to-peer systems. Due to the large size and dynamic nature of these systems, measuring the quantities of interest on every

Efficient Search in Unstructured Peer-to-Peer Networks

by Vicent Cholvi, Pascal Felber, Ernst Biersack - EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS: SPECIAL ISSUE ON P2P NETWORKING AND P2P SERVICES , 2004
"... The huge popularity of recent peer-to-peer (P2P) file sharing systems has been mainly driven by the scalability of their architectures and the flexibility of their search facilities. Such systems are usually designed as unstructured P2P networks, because they impose few constraints on topology and d ..."
Abstract - Cited by 54 (1 self) - Add to MetaCart
The huge popularity of recent peer-to-peer (P2P) file sharing systems has been mainly driven by the scalability of their architectures and the flexibility of their search facilities. Such systems are usually designed as unstructured P2P networks, because they impose few constraints on topology

Structuring unstructured peer-to-peer networks

by Stefan Schmid, Roger Wattenhofer - Proceedings of the 14th Annual IEEE International Conference on High Performance Computing (HiPC , 2007
"... Abstract. Flooding is a fundamental building block of unstructured peer-to-peer (P2P) systems. In this paper, we investigate techniques to improve the performance of flooding. In particular, we present Clustella, a novel semi-structured P2P architecture with bounded peer degree. Clustella decomposes ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
Abstract. Flooding is a fundamental building block of unstructured peer-to-peer (P2P) systems. In this paper, we investigate techniques to improve the performance of flooding. In particular, we present Clustella, a novel semi-structured P2P architecture with bounded peer degree. Clustella

ON COVERAGE BOUNDS OF UNSTRUCTURED PEER-TO-PEER NETWORKS

by Joydeep Chandra, Niloy Ganguly , 2011
"... In this paper, we develop methods to estimate the network coverage of a TTL-bound query packet undergoing flooding on an unstructured p2p network. The estimation based on the degree distribution of the networks, reveals that the presence of certain cycle-forming edges, that we name as cross and back ..."
Abstract - Add to MetaCart
In this paper, we develop methods to estimate the network coverage of a TTL-bound query packet undergoing flooding on an unstructured p2p network. The estimation based on the degree distribution of the networks, reveals that the presence of certain cycle-forming edges, that we name as cross

LEARNING IN UNSTRUCTURED PEER-TO-PEER NETWORKS

by Selim Çıraçı, Assist Prof, Dr. Ali, Aydın Selçuk, Prof Dr, Mehmet B. Baray, Selim Çıraçı, Özgür Ulusoy , 2005
"... that I have read this thesis and that in my opinion it is fully adequate, ..."
Abstract - Add to MetaCart
that I have read this thesis and that in my opinion it is fully adequate,
Results 1 - 10 of 12,702