Deterministic resource discovery in distributed networks

Shay Kutten; David Peleg; Uzi Vishkin

doi:10.1145/378580.378592

ScienceGate Book Chapters

JOURNAL ARTICLE

Deterministic resource discovery in distributed networks

Shay Kutten David Peleg Uzi Vishkin

Year: 2001 Pages: 77-83

DOI: 10.1145/378580.378592

Get Full-Text PDF Get Analytical Report

Abstract

The resource discovery problem was introduced by Harchol-Balter, Leigh ton and Lewin. They developed a number of algorithms for the problem in the weakly connected directed graph model. This model is a directed logical graph, that represents the vertices' "knowledge" about the topology of the underlying communication network.

Keywords:

Computer science Distributed computing Resource (disambiguation) Data science Computer network

Metrics

Cited By

1.98

FWCI (Field Weighted Citation Impact)

Refs

0.88

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Peer-to-Peer Network Technologies

Physical Sciences → Computer Science → Computer Networks and Communications

Caching and Content Delivery

Physical Sciences → Computer Science → Computer Networks and Communications

Distributed systems and fault tolerance

Physical Sciences → Computer Science → Computer Networks and Communications

Deterministic resource discovery in distributed networks

Abstract

Metrics

Citation History

Topics

Related Documents

Deterministic Resource Discovery in Distributed Networks

Deterministic distributed resource discovery (brief announcement)

Resource discovery in distributed networks

Algorithms for Resource Discovery in Distributed Networks

Distributed Indexing for Resource Discovery in P2P Networks