D
David R. Karger
Researcher at Massachusetts Institute of Technology
Publications - 357
Citations - 55665
David R. Karger is an academic researcher from Massachusetts Institute of Technology. The author has contributed to research in topics: Semantic Web & User interface. The author has an hindex of 95, co-authored 349 publications receiving 53806 citations. Previous affiliations of David R. Karger include Stanford University & Akamai Technologies.
Papers
More filters
Proceedings ArticleDOI
Chord: A scalable peer-to-peer lookup service for internet applications
TL;DR: Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
Journal ArticleDOI
Chord: a scalable peer-to-peer lookup protocol for Internet applications
Ion Stoica,Robert Morris,David Liben-Nowell,David R. Karger,M. Frans Kaashoek,Frank Dabek,Hari Balakrishnan +6 more
TL;DR: Results from theoretical analysis and simulations show that Chord is scalable: Communication cost and the state maintained by each node scale logarithmically with the number of Chord nodes.
Journal ArticleDOI
A Random Linear Network Coding Approach to Multicast
TL;DR: This work presents a distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks, and shows that this approach can take advantage of redundant network capacity for improved success probability and robustness.
Proceedings ArticleDOI
Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web
TL;DR: A family of caching protocols for distrib-uted networks that can be used to decrease or eliminate the occurrence of hot spots in the network, based on a special kind of hashing that is called consistent hashing.
Proceedings ArticleDOI
A scalable location service for geographic ad hoc routing
TL;DR: GLS combined with geographic forwarding allows the construction of ad hoc mobile networks that scale to a larger number of nodes than possible with previous work, and compares favorably with Dynamic Source Routing.