2 citations found. Retrieving documents...
Schwartz, E., "Design and Implementation of Intentional Names," Master's thesis, MIT Laboratory for Computer Science, Cambridge, MA (1999).

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Checking Java Implementation of a Naming Architecture Using.. - Khurshid, Marinov (2001)   (1 citation)  (Correct)

....given program. An abstraction is used to translate back into Alloy the program s output, which is then verified by AA against the correctness criteria expressed in Alloy. In this paper, we explore the use of TestEra by applying it to the Java implementation of the Intentional Naming System (INS) [1, 21], a recently proposed naming architecture for resource discovery and service location in dynamic networked environments. We perform several analyses on the INS implementation and illustrate the use of TestEra in testing properties of complex data structures and methods for manipulating them. Our ....

....printer R0 R1 query database 99 9999 9999 9999 9999 9999 9999 9999 9999 8 Fig. 2. Example of a query, database, and Lookup Name operation 3 Intentional Naming System One proposal for service discovery in dynamic networked environments is the Intentional Naming System (INS) [1, 21], which allows services to describe and refer to each other using intentional names. These names describe a set of properties that the services provide rather than the network location, e.g. the nearest color printer that handles transparencies rather than printer643.lcs.mit.edu or ....

[Article contains additional citation context not shown here]

Schwartz, E., "Design and Implementation of Intentional Names," Master's thesis, MIT Laboratory for Computer Science, Cambridge, MA (1999).


Scalability in an Intentional Naming System - Lilley (2000)   (7 citations)  (Correct)

....each other using name which are intentional. These names describe a set of properties that the services should have rather than specify a low level network location. The idea is to allow applications to refer to what service they want rather than where in the network topology the service resides [24]. As an example, one may want to send a message to a web camera in room 504 of the LCS building. Without a service discovery layer, the application would have to know the DNS address of the camera, which might re ect the location somehow, but very well might not. Here are some examples of DNS ....

....strain on the internal data structures. To accomplish this, changes were made in the name tree structure, the advertisement mechanism, and the way other INR nodes are referenced in the system. An illustration of this is in Figure 4 1. Names in the INRs are stored in the name tree data structure [24]. This is designed to scale to a moderate number of names that might be found in a local area. Since names either contain a virtual space or otherwise nd a default vspace, they can be separated into di erent name trees by vspace. Rather than the INR containing a 50 Advertise Names( 1 for V ....

[Article contains additional citation context not shown here]

Elliot Schwartz. Design and implementation of intentional names. Master's thesis, MIT, May 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC