Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Verifying a structured peer-to-peer overlay network: The static case
KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, IMIT.
KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, IMIT.ORCID iD: 0000-0002-0074-8786
2005 (English)In: GLOBAL COMPUTING, 2005, Vol. 3267, 250-265 p.Conference paper, Published paper (Refereed)
Abstract [en]

Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communication network. In this paper, we formally verify a typical application running on a fixed set of nodes. This work is the foundation for studies of a more dynamic system. We identify a value and expression language for a value-passing CCS that allows us to formally model a distributed hash table implemented over a static DKS overlay network. We then provide a specification of the lookup operation in the same language, allowing us to formally verify the correctness of the system in terms of observational equivalence between implementation and specification. For the proof, we employ an abstract notation for reachable states that allows us to work conveniently up to structural congruence, thus drastically reducing the number and shape of states to consider. The structure and techniques of the correctness proof are reusable for other overlay networks.

Place, publisher, year, edition, pages
2005. Vol. 3267, 250-265 p.
Series
LECTURE NOTES IN COMPUTER SCIENCE, ISSN 0302-9743
Keyword [en]
CALCULUS
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-50775ISI: 000227984500013Scopus ID: 2-s2.0-23944512185OAI: oai:DiVA.org:kth-50775DiVA: diva2:462658
Conference
2nd IST/FET International Workshop on Global Computing. Rovereto, ITALY. MAR 09-12, 2004
Note
QC 20111208Available from: 2011-12-07 Created: 2011-12-07 Last updated: 2011-12-08Bibliographically approved

Open Access in DiVA

No full text

Scopus

Authority records BETA

Gurov, Dilian

Search in DiVA

By author/editor
Onana, Luc AlimaGurov, Dilian
By organisation
Microelectronics and Information Technology, IMIT
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 39 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf