Analyzing the exhaustiveness of the Synapse protocol

Marinković, Bojan and Ciancaglini, Vincenzo and Ognjanović, Zoran and Glavan, Paola and Liquori, Luigi and Maksimović, Petar (2014) Analyzing the exhaustiveness of the Synapse protocol. = Analyzing the exhaustiveness of the Synapse protocol. Peer-to-Peer Networking and Applications. ISSN 1936-6442. Vrsta rada: ["eprint_fieldopt_article_type_article" not defined]. Kvartili JCR: Q4 (2013). Točan broj autora: 6. (In Press)

[img]
Preview
Text
Dummy article.pdf - Draft Version Jezik dokumenta:English

Download (79kB) | Preview
Official URL: http://www.scopus.com/inward/record.url?eid=2-s2.0...

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. © 2014 Springer Science+Business Media New York.

Item Type: Article (["eprint_fieldopt_article_type_article" not defined])
Keywords (Croatian): Abstract State Machines; DHT-based overlay networks; Peer-to-peer; Retrieval probability
Subjects: TECHNICAL SCIENCE > Computing
Divisions: 1500 Chair of Mathematics
Indexed in Web of Science: No
Indexed in Current Contents: No
Quartiles: Q4 (2013)
Citations SCOPUS: 0 (3.6.2015.)
Date Deposited: 03 Jun 2015 06:56
Last Modified: 23 May 2017 11:38
URI: http://repozitorij.fsb.hr/id/eprint/4203

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year