Semantic-free referencing in linked distributed systems

Hari Balakrishnan; Scott Shenker; Michael Walfish

doi:10.1007/978-3-540-45172-3_18

Semantic-free referencing in linked distributed systems

Hari Balakrishnan, Scott Shenker, Michael Walfish

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Chapter

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 language	English (US)
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Frans Kaashoek, Ion Stoica
Publisher	Springer Verlag
Pages	197-206
Number of pages	10
ISBN (Print)	3540407243
DOIs	https://doi.org/10.1007/978-3-540-45172-3_18
State	Published - 2003

Publication series

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

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-45172-3_18

Cite this

Balakrishnan, H., Shenker, S., & Walfish, M. (2003). Semantic-free referencing in linked distributed systems. In F. Kaashoek, & I. Stoica (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 197-206). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2735). Springer Verlag. https://doi.org/10.1007/978-3-540-45172-3_18

Semantic-free referencing in linked distributed systems. / Balakrishnan, Hari; Shenker, Scott; Walfish, Michael.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Frans Kaashoek; Ion Stoica. Springer Verlag, 2003. p. 197-206 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2735).

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Balakrishnan, H, Shenker, S & Walfish, M 2003, Semantic-free referencing in linked distributed systems. in F Kaashoek & I Stoica (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2735, Springer Verlag, pp. 197-206. https://doi.org/10.1007/978-3-540-45172-3_18

Balakrishnan H, Shenker S, Walfish M. Semantic-free referencing in linked distributed systems. In Kaashoek F, Stoica I, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2003. p. 197-206. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-45172-3_18

Balakrishnan, Hari ; Shenker, Scott ; Walfish, Michael. / Semantic-free referencing in linked distributed systems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Frans Kaashoek ; Ion Stoica. Springer Verlag, 2003. pp. 197-206 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{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",

doi = "10.1007/978-3-540-45172-3_18",

language = "English (US)",

isbn = "3540407243",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "197--206",

editor = "Frans Kaashoek and Ion Stoica",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - CHAP

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

U2 - 10.1007/978-3-540-45172-3_18

DO - 10.1007/978-3-540-45172-3_18

M3 - Chapter

AN - SCOPUS:35248854623

SN - 3540407243

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 197

EP - 206

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Kaashoek, Frans

A2 - Stoica, Ion

PB - Springer Verlag

ER -

Semantic-free referencing in linked distributed systems

Abstract

Publication series

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this