Authors: | Marinković, Bojan Ciancaglini, Vincenzo Ognjanović, Zoran Glavan, Paola Liquori, Luigi Maksimović, Petar |
Affiliations: | Mathematical Institute of the Serbian Academy of Sciences and Arts | Title: | Analyzing the exhaustiveness of the Synapse protocol | Journal: | Peer-to-Peer Networking and Applications | Volume: | 8 | Issue: | 5 | First page: | 793 | Last page: | 806 | Issue Date: | 7-Sep-2015 | Rank: | M22 | ISSN: | 1936-6442 | DOI: | 10.1007/s12083-014-0293-z | Abstract: | The Synapse protocol is a scalable protocol designed for information retrieval over inter-connected heterogeneous overlay networks. In this paper, we give a formal description of Synapse using the Abstract State Machines framework. The formal description pertains to Synapse actions that manipulate distributed keys. Based on this formal description, we present results concerning the expected exhaustiveness for a number of scenarios and systems maintained by the Synapse protocol, and provide comparisons to the results of the corresponding simulations and experiments. We show that the predicted theoretical results match the obtained experimental results, and give recommendations on the design of systems using Synapse. |
Keywords: | Abstract State Machines | DHT-based overlay networks | Peer-to-peer | Retrieval probability | Publisher: | Springer Link |
Show full item record
SCOPUSTM
Citations
3
checked on Nov 7, 2024
Page view(s)
18
checked on Nov 8, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.