Revisiting Why Kad Lookup Fails Bingshuang Liu∗† , Tao Wei∗†‡ , Jianyu Zhang∗† , Jun Li§ , Wei Zou∗† and Mo Zhou∗† ∗ Beijing Key Laboratory of Internet Security Technology, Peking University, Bei

First Page		Document Content
Date: 2012-09-05 23:47:49 Software Concurrent computing Distributed hash table Kad network Kademlia Peer-to-peer Routing EMule Lookup table Distributed data storage Computing File sharing networks		Revisiting Why Kad Lookup Fails Bingshuang Liu∗† , Tao Wei∗†‡ , Jianyu Zhang∗† , Jun Li§ , Wei Zou∗† and Mo Zhou∗† ∗ Beijing Key Laboratory of Internet Security Technology, Peking University, Bei Add to Reading List Source URL: lenx.100871.net Download Document from Source Website File Size: 322,55 KB Share Document on Facebook

	Efficient Traffic Routing with Progress Guarantees Stefan Blumer Manuel Eichelberger Roger Wattenhofer DocID: 1xVZy - View Document
	Sweet Little Lies: Fake Topologies for Flexible Routing Stefano Vissicchio University of Louvain DocID: 1xVPP - View Document
	Decoy Routing: Toward Unblockable Internet Communication Josh Karlin Daniel Ellard DocID: 1xVLC - View Document
	Hijacking Bitcoin: Routing Attacks on Cryptocurrencies https://btc-hijack.ethz.ch Maria Apostolaki Aviv Zohar DocID: 1xVI1 - View Document
	Wheel + Ring = Reel: the Impact of Route Filtering on the Stability of Policy Routing Luca Cittadini Giuseppe Di Battista DocID: 1xVsm - View Document