Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Kad network

Known as: KAD 
The Kad network is a peer-to-peer (P2P) network which implements the Kademlia P2P overlay protocol. The majority of users on the Kad Network are also… Expand
Wikipedia

Related topics

Related topics

15 relations
AlureonBotnetClient (computing)Distributed hash table
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Amplification Hell: Revisiting Network Protocols for DDoS Abuse
In distributed reflective denial-of-service (DRDoS) attacks, adversaries send requests to public servers (e.g., open recursive… Expand
  • figure 1
  • table I
  • table II
  • table III
  • table IV
2010
2010
Poisoning the Kad Network
Since the demise of the Overnet network, the Kad network has become not only the most popular but also the only widely used peer… Expand
  • figure 1
  • figure 2
  • table 1
Highly Cited
2009
Highly Cited
2009
Long Term Study of Peer Behavior in the kad DHT
Distributed hash tables (DHTs) have been actively studied in literature and many different proposals have been made on how to… Expand
  • figure 1
  • table I
  • figure 2
  • figure 4
  • figure 3
Highly Cited
2008
Highly Cited
2008
Attacking the Kad network
The Kad network, an implementation of the Kademlia DHT protocol, supports the popular eDonkey peer-to-peer file sharing network… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2007
Highly Cited
2007
Exploiting KAD: possible uses and misuses
Peer-to-peer systems have seen a tremendous growth in the last few years and peer-to-peer traffic makes a major fraction of the… Expand
  • table 1
Highly Cited
2007
Highly Cited
2007
A global view of kad
Distributed hash tables (DHTs) have been actively studied in literature and many different proposals have been made on how to… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Highly Cited
2006
Highly Cited
2006
Improving Lookup Performance Over a Widely-Deployed DHT
During recent years, Distributed Hash Tables (DHTs) have been extensively studied through simulation and analysis. However, due… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2006
Highly Cited
2006
Kleene algebra with domain
We propose Kleene algebra with domain (KAD), an extension of Kleene algebra by simple equational axioms for a domain and a… Expand
Highly Cited
2006
Highly Cited
2006
Understanding churn in peer-to-peer networks
The dynamics of peer participation, or churn, are an inherent property of Peer-to-Peer (P2P) systems and critical for design and… Expand
  • table 1
  • figure 1
  • figure 2
  • table 3
  • table 4
Highly Cited
1988
Highly Cited
1988
Stereospecific synthesis of olefins through sequential cross-coupling reactions
A conceptually straightforward and useful procedure leading to (I)- or (g)-olefins is presented. The method is based upon the r… Expand
  • table 1
  • table 2
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE