PAPER: Serving DNS using a Peer-to-Peer Lookup Service

The paper introduces a DHT-based DNS implementation, by using a p2p
distributed hash table (DHash, on top of Chord). The incentive for this
decentralized architecture comes from the shortcomings of the current
hierarchical DNS implementation. Due to the fact that DNSSEC effectively
separates the authentication of data and the service of data, alternate
service structures can be explored for a more effective DNS. Shortcomings
of the current DNS, such as the need for significant expertise can be
eliminated with the use of DDNS. The system uses resource record sets
(RRSet), as in conventional DNS. RRSet is a list of all the records
matching a given domain name and resource type. DDNS stores and retrieves
resource record sets using DHash, a Chord-based distributed hash table
that has the desirable properties of robustness and load balancing.

Strengths:
- new approach for a DNS based on a DTH
- overcomes several bad properties of conventional DNS, such as the   
administrative problems
- robustness and fault-tolerance (properties "inherited" from the chord
design)
- uses a novel method to evaluate the system by extrapolating
the latency based on Jung et al 's paper on DNS

Weaknesses:
- system has much higher latencies
- doesn't explore heterogeneity of nodes that will form DDNS system
- doesn't address problem of node failures or arrivals which is a common
trait of peer-2-peer systems
- doesn't explore the use of rules to regulate resource consumption based
on node's contribution to network