• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

The design and implementation of an intentional naming system (1999)

Cached

  • Download as a PDF

Download Links

  • [www-2.cs.cmu.edu]
  • [www.cis.ksu.edu]
  • [www.cc.gatech.edu]
  • [www.eecg.toronto.edu]
  • [inat.lcs.mit.edu]
  • [nms.lcs.mit.edu]
  • [www.cs.cornell.edu]
  • [www.cc.gatech.edu]
  • [www.cs.umass.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [wind.lcs.mit.edu]
  • [people.cs.umass.edu]
  • [www.cs.uiuc.edu]
  • [nms.csail.mit.edu]
  • [www.cs.cornell.edu]
  • [people.cs.umass.edu]
  • [sys192.cs.washington.edu]
  • [www.eecs.harvard.edu]
  • [cs.nyu.edu]
  • [www.cs.bilkent.edu.tr]
  • [fmg-www.cs.ucla.edu]
  • [paul.rutgers.edu]
  • [www.cs.cmu.edu]
  • [wind.lcs.mit.edu]
  • [www.ai.mit.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by William Adjie-Winoto , Elliot Schwartz , Hari Balakrishnan , Jeremy Lilley
Venue:17TH ACM SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES (SOSP '99) PUBLISHED AS OPERATING SYSTEMS REVIEW, 34(5):186--201, DEC. 1999
Citations:518 - 14 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Adjie-Winoto99thedesign,
    author = {William Adjie-Winoto and Elliot Schwartz and Hari Balakrishnan and Jeremy Lilley},
    title = { The design and implementation of an intentional naming system},
    year = {1999}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

This paper presents the design and implementation of the Intentional Naming System (INS), a resource discovery and service location system for dynamic and mobile networks of devices and computers. Such environments require a naming system that is (i) expressive, to describe and make requests based on specific properties of services, (ii) responsive, to track changes due to mobility and performance, (iii) robust, to handle failures, and (iv) easily configurable. INS uses a simple language based on attributes and values for its names. Applications use the language to describe what they are looking for (i.e., their intent), not where to find things (i.e., not hostnames). INS implements a late binding mechanism that integrates name resolution and message routing, enabling clients to continue communicating with end-nodes even if the name-to-address mappings change while a session is in progress. INS resolvers self-configure to form an application-level overlay network, which they use to discover new services, perform late binding, and maintain weak consistency of names using soft-state name exchanges and updates. We analyze the performance of the INS algorithms and protocols, present measurements of a Java-based implementation, and describe three applications we have implemented that demonstrate the feasibility and utility of INS.

Keyphrases

intentional naming system    new service    name-to-address mapping change    late binding    in resolvers    in implement    name resolution    naming system    message routing    present measurement    specific property    resource discovery    mobile network    soft-state name exchange    late binding mechanism    application-level overlay network    weak consistency    service location system    simple language    in algorithm    java-based implementation   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University