Title: Distributed Hash Tables 

Abstract:
An algorithm which is widely used in peer-to-peer applications are Distributed Hash Tables (DHT). DHT's provide reliable, scalable as well as a fault tolerant and efficient way to manage peer-to-peer networks in a proper peer to peer manner.  The aim of this talk is to give an introduction to this distributed data structure and how they can help us store and retrieve data efficiently in a peer-to-peer network. We will also discuss how DHTs fit into the context of our ongoing research into addressing the Test Scenario Explosion Problem.   More specifically, we will argue that this problem can be formulated in such a way that makes it addressable using DHTs