references

Author: guillaumemichel

src/routing/kad-dht.md

@@ -2,7 +2,7 @@
 title: Kademlia DHT
 description: >
   The IPFS Distributed Hash Table (DHT) specification defines a structured
-  overlay network used for peer routing and content routing in the
+  overlay network used for peer and content routing in the
   InterPlanetary File System (IPFS). It extends the libp2p Kademlia DHT
   specification, adapting and adding features to support IPFS-specific
   requirements.
@@ -15,12 +15,14 @@ editors:
     affiliation:
       name: Shipyard
       url: https://ipshipyard.com
+xref:
+  - kademlia-paper
 tags: ['routing']
 order: 1
 ---
 
 The IPFS Distributed Hash Table (DHT) specification defines a structured
-overlay network used for peer routing and content routing in the
+overlay network used for peer and content routing in the
 InterPlanetary File System (IPFS). It extends the libp2p Kademlia DHT
 specification, adapting and adding features to support IPFS-specific
 requirements.
@@ -58,7 +60,10 @@ used in other DHT swarms as well.
 
 ## DHT Swarms
 
-A DHT swarm is a group of interconnected nodes running the IPFS Kademlia DHT protocol, collectively identified by a unique protocol identifier. IPFS nodes MAY participate in multiple DHT swarms simultaneously. DHT swarms can be either public or private.
+A DHT swarm is a group of interconnected nodes running the IPFS Kademlia DHT
+protocol, collectively identified by a unique protocol identifier. IPFS nodes
+MAY participate in multiple DHT swarms simultaneously. DHT swarms can be either
+public or private.
 
 ### Protocol Identifier
 
@@ -156,9 +161,10 @@ prefix with the local node. For more information see [bucket population
 measurements](https://github.com/probe-lab/network-measurements/blob/master/results/rfm19-dht-routing-table-health.md#peers-distribution-in-the-k-buckets).
 
 The IPFS Kademlia DHT uses a bucket size of `k = 20`. This corresponds to the
-`k` value as defined in the original Kademlia paper [0]. The `k` value is also
-used as a replication factor and defines how many peers are returned to a
-lookup request.
+`k` value as defined in the original [Kademlia
+paper](https://www.scs.stanford.edu/~dm/home/papers/kpos.pdf)(:cite[kademlia-paper]).
+The `k` value is also used as a replication factor and defines how many peers
+are returned to a lookup request.
 
 Note that DHT Clients are never included in a Routing Table.
 
@@ -654,13 +660,3 @@ Followed https://blog.ipfs.tech/2023-ipfs-unresponsive-nodes/
 [libp2p/kad-dht](https://github.com/libp2p/js-libp2p/tree/main/packages/kad-dht)
 * Rust:
 [libp2p-kad](https://github.com/libp2p/rust-libp2p/tree/master/protocols/kad)
-
----
-
-## References
-
-[0]: Maymounkov, P., & Mazières, D. (2002). Kademlia: A Peer-to-Peer
-Information System Based on the XOR Metric. In P. Druschel, F. Kaashoek, & A.
-Rowstron (Eds.), Peer-to-Peer Systems (pp. 53–65). Berlin, Heidelberg: Springer
-Berlin Heidelberg. [DOI](https://doi.org/10.1007/3-540-45748-8_5)
-[pdf](https://www.scs.stanford.edu/~dm/home/papers/kpos.pdf)