scholarly journals Large scale dissemination using a peer-to-peer network

Author(s):  
K.G. Zerfiridis ◽  
H.D. Karatza
PLoS ONE ◽  
2020 ◽  
Vol 15 (12) ◽  
pp. e0243475
Author(s):  
David Mödinger ◽  
Jan-Hendrik Lorenz ◽  
Rens W. van der Heijden ◽  
Franz J. Hauck

The cryptocurrency system Bitcoin uses a peer-to-peer network to distribute new transactions to all participants. For risk estimation and usability aspects of Bitcoin applications, it is necessary to know the time required to disseminate a transaction within the network. Unfortunately, this time is not immediately obvious and hard to acquire. Measuring the dissemination latency requires many connections into the Bitcoin network, wasting network resources. Some third parties operate that way and publish large scale measurements. Relying on these measurements introduces a dependency and requires additional trust. This work describes how to unobtrusively acquire reliable estimates of the dissemination latencies for transactions without involving a third party. The dissemination latency is modelled with a lognormal distribution, and we estimate their parameters using a Bayesian model that can be updated dynamically. Our approach provides reliable estimates even when using only eight connections, the minimum connection number used by the default Bitcoin client. We provide an implementation of our approach as well as datasets for modelling and evaluation. Our approach, while slightly underestimating the latency distribution, is largely congruent with observed dissemination latencies.


Author(s):  
Chun-Rong Su ◽  
Jiann-Jone Chen

Performing Content-Based Image Retrieval (CBIR) in Internet connected databases through Peer-to-Peer (P2P) network (P2P-CBIR) helps to effectively explore the large-scale image database distributed over connected peers. Decentralized unstructured P2P framework is adopted in our system to compromise with the structured one while still reserving flexible routing control when peers join/leave or network fails. The P2P- CBIR search engine is designed to provide multi-instance query with multi-feature types to effectively reduce network traffic while maintaining high retrieval accuracy. In addition, the proposed P2P-CBIR system is also designed in the way to provide scalable retrieval function, which can adaptively control the query scope and progressively refine the accuracy of retrieved results. To reflect the most updated local database characteristics for the P2P-CBIR users, reconfiguring system at each regular interval time can effectively reduce trivial peer routing and retrieval operations due to imprecise configuration. Experiments demonstrated that the average recall rate of the proposedP2P-CBIR with reconfiguration is higher than the one without about 20%, and the latter outperforms previous methods, i.e., firework query model (FQM) and breadth-first search (BFS) about 20% and 120%, respectively, under the same range of TTL values.


2014 ◽  
Vol 24 (8) ◽  
pp. 2132-2150
Author(s):  
Hong-Yan MEI ◽  
Yu-Jie ZHANG ◽  
Xiang-Wu MENG ◽  
Wen-Ming MA

2013 ◽  
Vol 9 ◽  
pp. 215-225 ◽  
Author(s):  
Tadeu Classe ◽  
Regina Braga ◽  
Fernanda Campos ◽  
José Maria N. David

Sign in / Sign up

Export Citation Format

Share Document