Filters








98 Hits in 2.4 sec

On the session lifetime distribution of Gnutella

Kevin Ho, Jie Wu, John Sum
2008 International Journal of Parallel, Emergent and Distributed Systems  
A good model of the session lifetime distribution is basically a key to understand the formation and evolution of the topological structure of Gnutella.  ...  Over the past few years, capturing the characteristics of the Gnutella overlay network has been one of the major research activities in distributed computing.  ...  Acknowledgement The authors would like to express their gratitude to the reviewers for their valuable comments.  ... 
doi:10.1080/17445760701324838 fatcat:lct672z47vaada7cqkmbloicc4

Modeling Peer-To-Peer Networks With Interest-Based Clusters

Bertalan Forstner, Dr. Hassan Charaf
2007 Zenodo  
The SemPeer protocol is a new layer on Gnutella that transforms the connections of the nodes based on semantic information to make information retrieval more efficient.  ...  For the validation of the models, we evaluated a series of simulations that supported our results.  ...  A primordial of them is Gnutella [4] , which is also a good benchmark protocol. The SemPeer semantic protocol is also based on Gnutella as a new layer.  ... 
doi:10.5281/zenodo.1081323 fatcat:ft67pypa2ngnffmcmqtzzgpdpy

Roles in networks

Geoffrey Canright, Kenth Engø-Monsen
2004 Science of Computer Programming  
This latter analysis suggests that our method implies novel ways of interpreting the notion of well-connectedness for a graph, as these snapshots represent very well connected networks.  ...  We illustrate our approach with simple test graphs, and also by applying it to snapshots of the Gnutella peer-to-peer network from late 2001.  ...  We have also created visualizations of the Gnutella graphs studied here, using the Archipelago visualization tool [13] .  ... 
doi:10.1016/j.scico.2003.12.008 fatcat:kege47rx4zht7n2dwottv4hm3m

Reflecting P2P User Behaviour Models in a Simulation Environment

Vinay Aggarwal, Obi Akonjang, Anja Feldmann, Rumen Tashev, Sebastian Mohrs
2008 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)  
In this paper, we detail our experiences with the implementation of a popular P2P file sharing system in a simulation framework.  ...  We discuss some of the salient features of our implementation, and compare packet level with application level simulators.  ...  We will now measure the impact of various user behaviour models as outlined in this paper on P2P locality, and correlate the effects of events at the overlay on the underlay routing.  ... 
doi:10.1109/pdp.2008.62 dblp:conf/pdp/AggarwalAFTM08 fatcat:py4ylimbunbc3gzzvx573d43iu

Supporting peer-to-peer computing with FlexiNet

T. Fuhrmann
2003 CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.  
Although we use the well-know Gnutella protocol to describe the mechanism of our proposed service, it applies to all kinds of unstructured global peer-to-peer computing applications.  ...  In this paper, we describe a simple mechanism that uses programmable network technologies to improve the topology formation process of unstructured peer-topeer networks.  ...  Thereby, the FlexiNet service does not attract traffic but simply always maintains a certain level of connectedness.  ... 
doi:10.1109/ccgrid.2003.1199392 dblp:conf/ccgrid/Fuhrmann03 fatcat:lmzqpn3e2bgyxcurglmzopcgzm

Local search in unstructured networks [chapter]

Lada A. Adamic, Rajan M. Lukose, Bernardo A. Huberman
2004 Handbook of Graphs and Networks  
Acknowledgements We would like to thank Clip2 for the use of their Gnutella crawl data. Bibliography  ...  As query traffic increases linearly with the size of Gnutella graph, nodes become overloaded as was shown in a study by Clip2 [7] . 56k modems are unable to handle more than 20 queries a second, a threshold  ...  Introduction Recently, studies of networks in a wide variety of fields, from biology to social science to computer science, have revealed some commonalities [4] .  ... 
doi:10.1002/3527602755.ch13 fatcat:fannre7tqzdv3nj2zmxwibsotu

Local Search in Unstructured Networks [article]

Lada A. Adamic, Rajan M. Lukose, Bernardo A. Huberman
2002 arXiv   pre-print
We demonstrate that some of these search algorithms can work well on real Gnutella networks, scale sub-linearly with the number of nodes, and may help reduce the network search traffic that tends to cripple  ...  We review a number of message-passing algorithms that can be used to search through power-law networks.  ...  Acknowledgements We would like to thank Clip2 for the use of their Gnutella crawl data.  ... 
arXiv:cond-mat/0204181v2 fatcat:ymdqcsynvbgxrjjdpgvero4iei

Search in power-law networks

Lada A. Adamic, Rajan M. Lukose, Amit R. Puniyani, Bernardo A. Huberman
2001 Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics  
We also demonstrate the utility of these strategies on the Gnutella peer-to-peer network.  ...  We introduce a number of local search strategies which utilize high degree nodes in power-law graphs and which have costs which scale sub-linearly with the size of the graph.  ...  Acknowledgement We would like to thank Clip2 for the use of their Gnutella crawl data.  ... 
doi:10.1103/physreve.64.046135 pmid:11690118 fatcat:4n7ryueds5dpth6uc7zjk2h4je

Search in power-law networks [chapter]

L. A. Adamic, R. M. Lukose, A. R. Puniyani, B. A. Huberman
2011 The Structure and Dynamics of Networks  
We also demonstrate the utility of these strategies on the Gnutella peer-to-peer network. *  ...  We introduce a number of local search strategies which utilize high degree nodes in power-law graphs and which have costs which scale sub-linearly with the size of the graph.  ...  Acknowledgement We would like to thank Clip2 for the use of their Gnutella crawl data.  ... 
doi:10.1515/9781400841356.543 fatcat:4uq4ay2fnbb2hj572yisvy35ii

Limited Scale-Free Overlay Topologies for Unstructured Peer-to-Peer Networks

H. Guclu, M. Yuksel
2009 IEEE Transactions on Parallel and Distributed Systems  
He is a member of the IEEE, the APS, Sigma Xi, and Sigma Pi Sigma.  ...  A key limitation of scale-free (power-law) topologies is the high load (i.e., high degree) on a very few number of hub nodes.  ...  Our study yielded several guidelines for peers to join to a Gnutella-like unstructured P2P network, so that the search performance of the overall overlay topology remains high.  ... 
doi:10.1109/tpds.2008.150 fatcat:aig2sycwwzas3iomc46n4it5mq

Ubiquitousness of link-density and link-pattern communities in real-world networks

L. Šubelj, M. Bajec
2012 European Physical Journal B : Condensed Matter Physics  
In particular, networks can also be naturally partitioned according to similar patterns of connectedness among the nodes, revealing link-pattern communities.  ...  We here propose a propagation based algorithm that can extract both link-density and link-pattern communities, without any prior knowledge of the true structure.  ...  Hence, different network properties seem to be governed by the same underlying principle [8] , which represents a prominent direction for future research.  ... 
doi:10.1140/epjb/e2011-20448-7 fatcat:utav2eugivchzdhvh4223rt7py

Criticality-based analysis and design of unstructured peer-to-peer networks as "Complex systems"

F. Banaei-Kashani, C. Shahabi
2003 CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.  
For instance, using this approach we have been able to formalize the main problem with normal flooding search, propose a remedial approach with our probabilistic flooding technique, and find the optimal  ...  Due to enormous complexity of the unstructured peer-to-peer networks as large-scale, self-configure, and dynamic systems, the models used to characterize these systems are either inaccurate, because of  ...  On the other hand, empirical studies have verified that Gnutella network is a power-law network [15, 16] .  ... 
doi:10.1109/ccgrid.2003.1199387 dblp:conf/ccgrid/Banaei-KashaniS03 fatcat:v5zbog2isbep5mqspsp5ayuzei

Scale-Free Overlay Topologies with Hard Cutoffs for Unstructured Peer-to-Peer Networks [article]

Hasan Guclu, Murat Yuksel
2006 arXiv   pre-print
A key limitation of scale-free topologies is the high load (i.e. high degree) on very few number of hub nodes.  ...  N) for a range of degree distribution exponents.  ...  ACKNOWLEDGMENT This work was supported by the U.S. Department of Energy with contract number W-7405-ENG-36 and by the National Science Foundation with award number 0627039.  ... 
arXiv:cs/0611128v3 fatcat:hhlkiwt6z5alniqfe4e2srltca

Guest editors' introduction: Foundation of peer-to-peer computing

Javed I. Khan, Adam Wierzbicki
2008 Computer Communications  
The authors attempt a more complex two-layer characterization of Gnutella topology. Goal of many P2P social engineering is to discourage free riding.  ...  Besides the classical tools for studying processes, such as Markov theory, stochastic analysis, and fluid flow analysis a body of analytical works available in power-law networking, such as clustering,  ... 
doi:10.1016/j.comcom.2007.10.038 fatcat:xuc3u7osbvfa5adxzfitf2obiu

Towards Optimal Robustness of Network Controllability: An Empirical Necessary Condition [article]

Yang Lou, Lin Wang, Kim Fung Tsang, Guanrong Chen
2019 arXiv   pre-print
To better understand the correlation between network topological features and the robustness of network controllability in a general setting, this paper suggests a practical approach to searching for optimal  ...  ENC shows that the maximum and minimum in- and out-degrees of an optimal network structure should be almost identical, or within a very narrow range, i.e., the network should be extremely homogeneous.  ...  It should be noted that, for the study to be presented in this article, although the robustness of network connectedness has a certain positive correlation with the robustness of network controllability  ... 
arXiv:1912.12416v1 fatcat:hq2lyq7ipjec3jnrtmkzgfvl4m
« Previous Showing results 1 — 15 out of 98 results