Apparatus and method for a federated naming system which can resolve a composite name composed of names from any number of disparate naming systems

• US 5,377,323 A
• Filed: 09/13/1991
• Issued: 12/27/1994
• Est. Priority Date: 09/13/1991
• Status: Expired due to Term

• Current Assignee: Sun Microsystems Incorporated (Oracle Corporation)
• Original Assignee: Sun Microsystems Incorporated (Oracle Corporation)
• Inventors: Vasudevan, Rangaswamy
• Primary Examiner(s): Lee, Thomas C.
• Assistant Examiner(s): LINTZ, PAUL R
• Application Number:
  US07/760,044
• Time in Patent Office: 1,201 Days
• Field of Search: 395/600, 395/200, 395/325, 380/23, 364/419.08
• US Class Current: 709/226
• CPC Class Codes: G06F 9/46 Multiprogramming arrangements
• CPC Class Codes: H04L 2101/30 Types of network names
• CPC Class Codes: H04L 2101/365 Application layer names, e.g. buddy names, unstructured names chosen by a user or home appliance name
• CPC Class Codes: H04L 9/40 Network security protocols

Abstract

In a distributed computing environment, an apparatus and method for a federated Naming System which can resolve Composite Names comprised of Names from an arbitrary number of disparate Naming Systems. A syntax for Composite Names is defined as well as necessary operations to directly resolve such Composite Names without the need for customized agents or gateways.

Claims

1. In a distributed computing environment, an apparatus for a federated naming system which can resolve a composite name composed of any number of disparate naming systems, said apparatus comprising:

a) a plurality of arbitrary naming systems, each of said naming systems comprising a plurality of names, cash name being comprised of one or more atomic names, said atomic names being pointers to corresponding objects, each of said naming systems having names with syntax unknown to other naming systems, thereby permitting a new naming system to be added to said distributed computing environment without having to change any other associated naming system;

b) a composite name, comprising a sequence of one or more names from different naming systems which are connected as a sequence of components, each component comprising a naming system identification symbol and a name from said naming system, said naming system identification symbol being uniquely related to one of said plurality of arbitrary naming systems, said sequence of components having an arbitrary number of said components corresponding to said one or more names;

c) a first lookup device for resolving said composite name into said composite name'"'"'s corresponding parts by returning a head name and a tail name to a request that said composite name bc resolved, and if said taft name is a non-null value said head name is openfive to point to a context where said tail name can be further resolved, and repeating said resolving operation iteratiyely until said tail name returned is a null value at which time a location of an object designated by said composite name has been determined; and

d) a second lookup device which is local to an individual one of said plurality of arbitrary naming systems which is used to resolve names unique to said individual naming system, into associated atomic names and to return a pointer to an object designed by an atomic name therby providing to said first lookup device a resolution for a name in said individual naming system.

2. The apparatus claimed in claim 1 wherein said first lookup device comprises a third logic mechanism operative in a first context to provide an object reference if the composite name is an atomic name;

said third logic mechanism being operative to provide a reference to a context object in another naming system a tail of the composite name, if the composite name refers to a context object in said another naming system; and

said third logic mechanism being operative to provide a tail of said composite name within a naming system in said first context.

3. The apparatus defined in claim 2 wherein said third logic device is operative to perform operations of composite name binding, unbinding, and listing names.

4. The apparatus defined in claim 3 wherein the apparatus is operative in an object oriented distributed computing system.

5. In a distributed computing environment, a computer implemented method for a federated naming system which can resolve a composite name composed of any number of disparate naming systems, said method comprising the steps of:

a) identifying a plurality of arbitrary naming systems, each of said naming systems comprising a plurality of names, each name being comprised of one or more atomic names, said atomic names being pointers to corresponding objects, each of said naming systems having names with syntax unknown to any other naming system, thereby permitting a new naming system to be added to said distributed computing environment without requiring changes to any other existing naming system in said environment;

b) identifying a composite name, comprising a sequence of components, each component comprising a naming system identification symbol and a name from said naming system, said naming system identification symbol being uniquely related to one of said plurality of arbitrary naming systems, said sequence of components having an arbitrary number of said components wherein said composite name is a sequence of nested addresses;

c) using a first lockup device, resolving said composite name into said composite name'"'"'s corresponding parts by returning a head name and a tail name to a request that said composite name be resolved, and if said tail name is a non-null value stud head name is operative to point to a context where said tail name can be further resolved, and repeating said resolving operation iteratively until said tail name returned is a null value, at which the a location of an object designated by said composite name has been determined; and

d) using a second lookup device which is local to an individual one of said plurality of arbitrary naming systems which is used to resolve names unique to said individual naming system into associated atomic names and to return a pointer to an object designated by an atomic name providing to said first lookup device a resolution for a name in said individual naming system.

6. The method described in claim 5 wherein the step of resolving the composite name comprises the steps of establishing a composite lookup operation which is operative in a first context to provide an object reference if the composite name is an atomic name, said composite lookup operation being operative to provide a reference to another naming system context and a tail of the composite name, if the composite name refers to another naming system.

7. In a distributed computing system, a computer implemented method for a federated naming system comprising the steps of:

a) providing a plurality of naming systems, each of said naming systems comprising a plurality of names, each name being comprised of one or more atomic names, said atomic names being pointers to corresponding objects, each of said naming systems having names with syntax unknown to any other naming system, thereby permitting a new naming system to be tided to said distributed computing system without requiring any changes in any other naming system in said computing system;

b) combining names from said naming systems into a composite name by

i) designating a first prefix name represented by a naming system identification symbol to identify a first naming system;

ii) appending said first prefix name to a name in said first naming system, said name and appended first prefix name designated a first naming system component name; and

c) using a left-to-right order for combining said first naming system component name to a sequence of similar naming system component names corresponding to an arbitrary number of said plurality of naming systems to form said composite name; and

d) providing a plurality of operations for operating on composite names including using a first lookup operation to resolve a composite name into a reference to an object harnell by said composite name relative to a specified context, by returning a head name and a tail name to a request that said composite name be resolved, and if said tail name is a non-null value said head name is operative to point to a context where said tail name can be further resolved, and repeating said resolving operation iteratively until said tail name returned is a null value, at which time a location of an object designated by said composite name has been determined, and using a second lookup device which is local to an individual one of said plurality of arbitrary naming systems which is used to resolve names unique to said individual naming system into associated atomic names and to return a pointer to an object designated by an atomic name providing to said first lookup device a resolution for a name in said individual naming system.

8. The method as recited in claim 7 wherein said step of providing a plurality of operations for operating on composite names comprises the additional steps of:

a) providing a bind operation for binding an atomic name portion of a component name to an object reference in a context, said object reference being supplied as a parameter in an invocation of said bind operation and said context being a context of a naming system to which said component name belongs;

b) providing an unbind operation for removing a binding of an atomic name portion of a component name to an object reference from a context; and

c) providing a list operation for providing a list in a specified context, of all names and the corresponding object references.

9. A computer system comprising:

a) a plurality of naming systems, each of said naming systems having a naming syntax which is unknown to any other naming system, thereby permitting a new naming system to be added to said computer system without requiring changes in any existing naming system, each naming system comprising;

i ) a plurality of names, each name being comprised of one or more atomic names, said atomic names being pointers to corresponding objects;

ii) a first lookup device for resolving a composite name and operative to return a head name and a tail name in response to any request for a name to be resolved, and if said tail name is a non-null value said head name is operative to point to a context where said tail name can be further resolved, and repeating said resolving operation iteratively until said tail name returned is a null value, at which time a location of an object designated by said composite name has been determined; and

iii) a second lookup device for resolving a name unique to said naming system into said name'"'"'s corresponding atomic names and to return a pointer to an object designated by at least one said corresponding atomic name; and

b) a composite name created by combining a first name from a first naming system with a second name from a second naming system by attaching a prefix to each of said first and second names, said prefix designating said corresponding first or second naming system, and combining an arbitrary number of said naming system identifier prefix and naming system name combinations in a left-to-right order corresponding to a hierarchy of said naming systems wherein said composite name is a sequence of one or more names which constitute an address of a particular object.