DC FieldValueLanguage
dc.contributor.authorMarinković, Bojanen
dc.contributor.authorCiancaglini, Vincenzoen
dc.contributor.authorOgnjanović, Zoranen
dc.contributor.authorGlavan, Paolaen
dc.contributor.authorLiquori, Luigien
dc.contributor.authorMaksimović, Petaren
dc.date.accessioned2020-02-18T20:06:25Z-
dc.date.available2020-02-18T20:06:25Z-
dc.date.issued2015-09-07en
dc.identifier.issn1936-6442en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/23-
dc.description.abstractThe 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.en
dc.publisherSpringer Link-
dc.relation.ispartofPeer-to-Peer Networking and Applicationsen
dc.subjectAbstract State Machines | DHT-based overlay networks | Peer-to-peer | Retrieval probabilityen
dc.titleAnalyzing the exhaustiveness of the Synapse protocolen
dc.typeArticleen
dc.identifier.doi10.1007/s12083-014-0293-zen
dc.identifier.scopus2-s2.0-84938741574en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage793-
dc.relation.lastpage806-
dc.relation.issue5-
dc.relation.volume8-
dc.description.rankM22-
item.cerifentitytypePublications-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0002-9533-0330-
crisitem.author.orcid0000-0003-2508-6480-
Show simple item record

SCOPUSTM   
Citations

3
checked on Jul 14, 2024

Page view(s)

80
checked on May 10, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.