%0 Conference Proceedings
%T Formal Specification of the Kademlia and the Kad Routing Tables in Maude
%+ Universidad Complutense de Madrid =  Complutense University of Madrid  [Madrid] (UCM)
%A Pita, Isabel
%A Fernández-Camacho, María-Inés
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 21th InternationalWorkshop on Algebraic Development Techniques (WADT)
%C Salamanca, Spain
%Y Narciso Martí-Oliet
%Y Miguel Palomino
%I Springer
%3 Recent Trends in Algebraic Development Techniques
%V LNCS-7841
%P 231-247
%8 2012-06-07
%D 2012
%R 10.1007/978-3-642-37635-1_14
%K Kademlia
%K Kad
%K distributed specification
%K formal analysis
%K Maude
%K Real-Time Maude
%Z Computer Science [cs]Conference papers
%X Kad is the implementation by eMule and aMule of the Kademlia peer-to-peer distributed hash table protocol. Although it agrees with the basic behaviour of the protocol, there are some significant differences. This paper presents the specification of both the Kademlia and the Kad routing tables, using the specification language Maude. As far as we know, this is the first such a formal development. The routing tables present a dynamic behavior in the sense that they should be able to send messages to other peers and they should have a notion of time for raising events and detect no answered messages. Our main contribution is the integration of these dynamic aspects in the protocol specification.
%G English
%Z TC 1
%Z WG 1.3
%2 https://inria.hal.science/hal-01485972/document
%2 https://inria.hal.science/hal-01485972/file/978-3-642-37635-1_14_Chapter.pdf
%L hal-01485972
%U https://inria.hal.science/hal-01485972
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG1-3
%~ IFIP-LNCS-7841
%~ IFIP-WADT