physical network / query site / greedily-constructed overlay network / directory services / minimal network / wide-area Web cache sharing protocol / minimal search path / probabilistic algorithm / least loaded server / content-addressable network / update site / web traffic generator / query algorithm / alized algorithm / construction algorithm / home-node server / realistic fall-back algorithms / large networks / probabilistic routing algorithm / possible algorithms / deterministic wide-area location algorithms / home node location protocol / update algorithm / distinct update filtering algorithms / real deterministic algorithm / probabilistic location algorithm / real systems / given network / deterministic algorithms / internet applications / directory server / search climbs / Web Caching Workshop / systems / source filtering update algorithm / less advanced algorithms / lru-k page replacement algorithm / web traffic / update algorithms / web workloads / location protocols / latter solution / hybrid algorithm / deterministic algorithm / generalized search trees / home node solution / Web caches / source filtering algorithm / wasted search traffic / overlay network / bandwidth-efficient protocol / /
OperatingSystem
L3 / /
Organization
University of California / University of California / Berkeley / Internet Domain Name Service / Berkeley Computer Science Division / Secure Discovery Service / /
Person
Anoop Gupta / Fast Ethernet / Richard Karp / Alex Rousskov / Hari Balakrishnan / M. Frans Kaashoek / Peter Druschel / Sean C. Rhea / Daniel Lenoski / Frank Dabek / Paul M. Aoki / Lothar F. Mackert / Todd D. Hodes / Antony Rowstron / John Hennessy / David Nakahira / J. Almeida / L. Fan / Ion Stoica / A. Broder / Scott Schenker / Robert Morris / John Kubiatowicz / Randy H. Katz / Truman Joe / P. Cao / Sylvia Ratnasamy / Anthony D. Joseph / Mark Handley / Guy M. Lohman / Ben Y. Zhao / James Laudon / Mark Crovella / Duane Wessels / Luis Stevens / Paul Francis / Paul Barford / Steven E. Czerwinski / David Karger / / /
Position
representative / forward / model / Cao / /
ProvinceOrState
Manitoba / California / /
PublishedMedium
The Computer Journal / the Cache Digest / Communications of the ACM / /
Technology
source filtering update algorithm / filtering algorithm / location protocols / Dynamic Routing Stretch vs. Algorithm Dynamic Distance Stretch vs. Algorithm / probabilistic routing algorithm / peer-to-peer / wide-area Web cache sharing protocol / Dynamic Bandwidth Consumed vs. Algorithm / Dynamic Distance Stretch vs. Algorithm / realistic fall-back algorithms / same deterministic algorithm / two possible algorithms / query algorithm / probabilistic algorithm / home node location protocol / 16 Algorithm / Dynamic Routing Stretch vs. Algorithm / two deterministic algorithms / source filtering algorithm / update algorithm / deterministic algorithms / probabilistic location algorithm / hybrid algorithm / DNS / attenuated algorithm / Home Node algorithm / existing algorithms / deterministic algorithm / deterministic wide-area location algorithms / HTTP / caching / simulation / two distinct update filtering algorithms / real deterministic algorithm / construction algorithm / lru-k page replacement algorithm / three update algorithms / Cumulative Interdomain Bandwidth vs. Algorithm / participating in the probabilistic location algorithm / /
Probabilistic Location and Routing Sean C. Rhea, John Kubiatowicz understand: a small amount of “mis-routing” in the local area can lead to a large divergence from optimality, since the optimal path is short to begin