Abstract
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. © IFIP International Federation for Information Processing 2013.
Author supplied keywords
Cite
CITATION STYLE
Pita, I., & Ferńandez-Camacho, M. I. (2013). Formal specification of the Kademlia and the Kad routing tables in Maude. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7841 LNCS, pp. 231–247). https://doi.org/10.1007/978-3-642-37635-1_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
