Semantic-free referencing in linked distributed systems

Hari Balakrishnan, Scott Shenker, Michael Walfish

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Every distributed system that employs linking requires a Reference Resolution Service (RRS) to convert link references to locations. We argue that the Web's use of DNS for this function is a bad idea. This paper discusses the nature, design, and use of a scalable and dynamic RRS. We make two principal arguments about the nature of reference resolution: first, that there should be a general-purpose application-independent substrate for reference resolution, and second that the references themselves should be unstructured and semantic-free. We observe that distributed hash tables (DHTs) provide an elegant and convenient platform for realizing these goals, and we present a general-purpose DHT-based Semantic-Free Referencing (SFR) architecture.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsFrans Kaashoek, Ion Stoica
PublisherSpringer Verlag
Pages197-206
Number of pages10
ISBN (Print)3540407243
DOIs
StatePublished - 2003

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2735
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Semantic-free referencing in linked distributed systems'. Together they form a unique fingerprint.

Cite this