Deterministic distributed resource discovery (brief announcement)

Shay Kutten; David Peleg

doi:10.1145/343477.362152

ScienceGate Book Chapters

JOURNAL ARTICLE

Deterministic distributed resource discovery (brief announcement)

Shay Kutten David Peleg

Year: 2000 Pages: 336-336

DOI: 10.1145/343477.362152

Get Full-Text PDF Get Analytical Report

Abstract

The resource discovery problem was introduced by Harchol-Balter, Leighton and Lewin in [HLL99], as a part of their work on web caching. They developed a randomized algorithm for the problem in the weakly connected directed graph model, that was implemented within LCS at MIT, and then licensed to Akamai Technologies.

Keywords:

Computer science Resource (disambiguation) Distributed computing Graph Theoretical computer science World Wide Web Computer network

Metrics

Cited By

0.87

FWCI (Field Weighted Citation Impact)

Refs

0.78

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Optimization and Search Problems

Physical Sciences → Computer Science → Computer Networks and Communications

Cryptography and Data Security

Physical Sciences → Computer Science → Artificial Intelligence

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

Deterministic distributed resource discovery (brief announcement)

Abstract

Metrics

Topics

Related Documents

Deterministic resource discovery in distributed networks

Deterministic Resource Discovery in Distributed Networks

Brief Announcement: Distributed SplayNets

Distributed resource discovery

Brief Announcement: Asymmetric Distributed Trust