Semantic-free referencing in linked distributed systems

Hari Balakrishnan, Scott Shenker, Michael Walfish

Research output: Contribution to journalArticle

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)
Pages (from-to)197-206
Number of pages10
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2735
StatePublished - 2003

Fingerprint

Computer Communication Networks
Semantics
Distributed Systems
Tables
Substrates
Linking
Convert
Substrate

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Semantic-free referencing in linked distributed systems. / Balakrishnan, Hari; Shenker, Scott; Walfish, Michael.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2735, 2003, p. 197-206.

Research output: Contribution to journalArticle

@article{9fb4fb79cea94a8d856b878f5baea731,
title = "Semantic-free referencing in linked distributed systems",
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.",
author = "Hari Balakrishnan and Scott Shenker and Michael Walfish",
year = "2003",
language = "English (US)",
volume = "2735",
pages = "197--206",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Semantic-free referencing in linked distributed systems

AU - Balakrishnan, Hari

AU - Shenker, Scott

AU - Walfish, Michael

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=35248854623&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35248854623&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:35248854623

VL - 2735

SP - 197

EP - 206

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -