Source: http://www.google.com.br/patents/US7734747
Timestamp: 2018-01-22 20:27:29
Document Index: 784039418

Matched Legal Cases: ['Application No. 60', 'Application No. 60', 'Application No. 60', 'art 1', 'art 2', 'art 1', 'art 2']

Patente US7734747 - Dynamic lookup service in a distributed system - Patentes do Google
An improved lookup service is provided that allows for the dynamic addition and deletion of services. This lookup service allows for the addition and deletion of services automatically, without user intervention. As a result, clients of the lookup service may continue using the lookup service and its...http://www.google.com.br/patents/US7734747?utm_source=gb-gplus-sharePatente US7734747 - Dynamic lookup service in a distributed system
Número da publicação US7734747 B2
Número do pedido US 10/669,692
Data de publicação 8 jun. 2010
Data de depósito 25 set. 2003
Data da prioridade 26 fev. 1998
Também publicado como US6185611, US8713089, US20030191842, US20050102353
Número da publicação 10669692, 669692, US 7734747 B2, US 7734747B2, US-B2-7734747, US7734747 B2, US7734747B2
Inventores Brian T. Murphy, Robert W. Scheifler, Zane Pan, James H. Waldo, Ann M. Wollrath, Kenneth C. R. C. Arnold
Cessionário original Oracle America, Inc.
Citações de patente (344), Citações de não patente (222), Citada por (7), Classificações (69), Eventos legais (5)
US 7734747 B2
An improved lookup service is provided that allows for the dynamic addition and deletion of services. This lookup service allows for the addition and deletion of services automatically, without user intervention. As a result, clients of the lookup service may continue using the lookup service and its associated services while the updates occur. Additionally, the lookup service provides a notification mechanism that can be used by clients to receive a notification when the lookup service is updated. By receiving such a notification, clients can avoid attempting to access a service that is no longer available and can make use of new services as soon as they are added to the lookup service.
receiving, at a client lookup manager, from a client computer, a request to access a network service, said client lookup manager having an associated cache, said client computer being an element of a distributed system, said distributed system comprising a plurality of lookup services with associated network services; and
the client look up manager:
searching the associated cache for a service reference associated with an instance of the requested network service;
returning, when said searching step is successful, the instance of the requested network service to the client computer;
sending, when said searching step is unsuccessful, a request for the service reference to a lookup service, said service reference identifying the requested network service, said request including an integer argument representing a desired maximum number of references matching said service reference that should be returned; and
storing said matching references in the associated cache.
2. The method according to claim 1, wherein the searching step further comprises searching a table of the plurality of lookup services and the associated network services for said service reference.
3. A computer-readable storage device containing instructions encoded thereon for a data client lookup manager to implement a method, the method comprising the steps:
receiving, at a client lookup manager, from a client computer, a request to access a network service, said client lookup manager having an associated cache, said client computer being an element of a distributed system, said distributed system comprising a plurality of lookup services with associated network services; and the client look up manager: searching the associated cache for a service reference associated with an instance of the requested network service;
4. The computer-readable storage device according to claim 3, wherein the searching step further comprises searching a table of the plurality of lookup services and associated network services for the said service reference.
a server computer with a lookup service having references to a plurality of network services; and
a client computer including a client lookup manager with an associated cache, wherein said client lookup manager:
receives, from the client computer, a request to access a network service;
searches the associated cache for a service reference associated with an instance of the requested network service;
returns, when said searching step is successful, the instance of the requested network service to the client computer;
sends, when said searching step is unsuccessful, a request for the service reference to the lookup service, said service reference identifying the requested network service, said request including an integer argument representing a desired maximum number of references matching said service reference that should be returned; and
stores said matching references in the associated cache.
This is a divisional of application Ser. No. 10/408,365, filed Apr. 8, 2003, which is a divisional of application Ser. No. 09/915,645, filed Jul. 27, 2001, now U.S. Pat. No. 6,604,127, issued Aug. 5, 2003, which is a continuation of application Ser. No. 09/417,908, filed Oct. 13, 1999, now abandoned, which is a continuation of application Ser. No. 09/044,931, filed Mar. 20, 1998, issued as U.S. Pat. No. 6,185,611, which claims the benefit of U.S. Provisional Application No. 60/076,048, filed Feb. 26, 1998, all of which are incorporated herein by reference.
This application is a continuation-in-part of U.S. patent application Ser. No. 09/044,931, filed on Mar. 20, 1998, which is incorporated by reference.
The following identified U.S. patents and patent applications are relied upon and are incorporated by reference in this application.
U.S. Provisional Application No. 60/138,680, entitled “Jini™ Technology Helper Utilities and Services,” filed on Jun. 14, 1999.
U.S. Provisional Application No. 60/076,048, entitled “Distributed Computing System.” filed on Feb. 26, 1998.
U.S. patent application Ser. No. 09/044,923, now U.S. Pat. No. 6,263,350, entitled “Method and System for Leasing Storage.”
U.S. patent application Ser. No. 09/044,838, now U.S. Pat. No. 6,247,026, entitled “Method. Apparatus and Product for Leasing of Delegation Certificates in a Distributed System.”
U.S. patent application Ser. No. 09/044,834, now U.S. Pat. No. 6,421,704, entitled “Method. Apparatus and Product for Leasing of Group Membership in a Distributed System.”
U.S. patent application Ser. No. 09/044,933, now U.S. Pat. No. 6,463,446, entitled “Method for Transporting Behavior in Event Based System.”
U.S. patent application Ser. No. 09/044,919, now U.S. Pat. No. 6,272,559, entitled “Deferred Reconstruction of Objects and Remote Loading for Event Notification in a Distributed System.”
U.S. patent application Ser. No. 09/045,652, now U.S. Pat. No. 6,134,603, entitled “Method and System for Deterministic Hashes to Identify Remote Methods.”
U.S. patent application Ser. No. 09/044,790, now U.S. Pat. No. 6,598,094, entitled “Method and Apparatus for Determining Status of Remote Objects in a Distributed System.”
U.S. patent application Ser. No. 09/044,930, now U.S. Pat. No. 6,393,497, entitled “Downloadable Smart Proxies for Performing Processing Associated with a Remote Procedure Call in a Distributed System.”
U.S. patent application Ser. No. 09/044,917, now U.S. Pat. No. 6,237,024, entitled “Method and Apparatus for the Suspension and Continuation of Remote Processes.”
U.S. patent application Ser. No. 09/044,835, now U.S. Pat. No. 6,182,083, entitled “Method and System for Multi-Entry and Multi-Template Matching in a Database.”
U.S. patent application Ser. No. 09/044,839, entitled “Method and System for In-Place Modifications in a Database,” now abandoned.
U.S. patent application Ser. No. 09/044,945, now U.S. Pat. No. 6,578,044, entitled “Method and System for Typesafe Attribute Matching in a Database.”
U.S. patent application Ser. No. 09/044,939, now U.S. Pat. No. 6,560,656, entitled “Apparatus and Method for Providing Downloadable Code for Use in Communicating with a Device in a Distributed System,” filed Mar. 20, 1998.
U.S. patent application Ser. No. 09/044,826, entitled “Method and System for Facilitating Access to a Lookup Service,” filed Mar. 20, 1998.
U.S. patent application Ser. No. 09/044,932, now U.S. Pat. No. 6,466,947, entitled “Apparatus and Method for Dynamically Verifying Information in a Distributed System.”
U.S. patent application Ser. No. 09/030,840, now U.S. Pat. No. 6,446,070, entitled “Method and Apparatus for Dynamic Distributed Computing Over a Network.”
U.S. patent application Ser. No. 09/044,936, entitled “An Interactive Design Tool for Persistent Shared Memory Spaces,” now abandoned.
U.S. patent application Ser. No. 09/044,934, now U.S. Pat. No. 6,438,614, entitled “Polymorphic Token-Based Control.”
U.S. patent application Ser. No. 09/044,915, now U.S. Pat. No. 6,138,238, entitled “Stack-Based Access Control.”
U.S. patent application Ser. No. 09/044,944, now U.S. Pat. No. 6,226,746, entitled “Stack-Based Security Requirements.”
U.S. patent application Ser. No. 09/044,837, now U.S. Pat. No. 6,282,652, entitled “Per-Method Designation of Security Requirements.”
The present invention relates generally to data processing systems and, more particularly, to a dynamic lookup service in a distributed system.
A lookup service contains an indication of where network services are located within a distributed system comprised of multiple machines, such as computers and related peripheral devices, connected in a network (for example, a local area network, wide area network, or the Internet). A “network service” refers to a resource, data, or functionality that is accessible on the network. Typically, for each service, the lookup service contains an address used by a client (e.g., a program) to access the service (e.g., a printer).
Conventional lookup services are static: whenever updates to the lookup service are needed to either add a new service or delete an existing service, the lookup service is taken offline, rendering the lookup service inaccessible, and then, the lookup service is manually updated by the system administrator. During the time when the lookup service is offline, clients in the distributed system are unable to access the lookup service and any of its network services. Another limitation of conventional lookup services is that, when updated, clients are not made aware of the updates to the lookup service until they explicitly perform a refresh operation, which downloads the latest service information to the clients. Before such a refresh, however, if a client requests a service that is no longer available, an error occurs which may cause the client to hang. Also, before a refresh, the client is not aware of any new services that have been recently added to the lookup service. It is therefore desirable to improve lookup services for distributed systems.
Systems consistent with the present invention provide an improved lookup service that allows for the dynamic addition and deletion of services. This lookup service allows for the update, i.e., addition and deletion of available services automatically, without user intervention. As a result, clients of the lookup service may continue using the lookup service and its associated services while the updates occur. Additionally, the lookup service provides a notification mechanism that can be used by clients to receive a notification when the lookup service is updated. By receiving such a notification, clients can avoid attempting to access a service that is no longer available and can make use of new services as soon as they are added to the lookup service.
In accordance with methods consistent with the present invention, a method is provided in a data processing system having a lookup service with associated services. This method receives a request by the lookup service for notification when the lookup service is updated, determines when the lookup service is updated, and generates a notification when it is determined that the lookup service is updated.
In accordance with methods consistent with the present invention, a method is provided in a data processing system having a lookup service with associated services. This method sends a request to the lookup service to be notified when the lookup service is updated and receives an indication that the lookup service has been updated.
In accordance with methods consistent with the present invention, a method is provided in a data processing system having a lookup service with associated services and a client lookup manager with an associated cache. This method transmits an event by the lookup service that identifies a change to one of the associated network services. The client lookup manager receives the event and updates the associated cache to reflect the change.
In accordance with methods consistent with the present invention, a method is provided in a data processing system having a client and lookup service with associated services. This method receives a request from a client for access to a network service, then retrieves a reference from a cache reflecting a particular network service corresponding to the requested network service and transmits the reference to the client.
In accordance with systems consistent with the present invention, a data processing system comprising a memory and a processor is provided. The memory includes a lookup service containing indications of services that are available for use, a first client for updating the lookup service, and a second client for utilizing the lookup service while the first client is updating the lookup service. The processor runs the lookup service, the first client, and the second client.
In accordance with systems consistent with the present invention, a data processing system containing a memory and a processor is provided. The memory contains a lookup service with indications of services available for use and a client. The lookup service receives requests for notification of when the lookup service is updated, determines when the lookup service is updated, and generates notifications when the lookup service is updated. The client sends a request to the lookup service to be notified when the lookup service is updated. The processor runs the client and the lookup service.
In accordance with systems consistent with the present invention, a data processing system containing a memory and a processor is provided. The memory contains a lookup service with references to a plurality of network services available for use, a client, and a client lookup manager with an associated cache stored on the client computer. The client lookup manager accesses the lookup service and stores service references in the cache. The processor runs the client and the lookup service.
In accordance with systems consistent with the present invention, a computer-readable memory device containing a data structure is provided. This data structure is for accessing a lookup service with associated network services available for use. The data structure contains a notify method for use by a client to register with the lookup service to receive a notification from the lookup service when the lookup service is updated.
FIG. 2 depicts a more detailed block diagram of a computer depicted in FIG. 1;
FIGS. 3A and 3B depict a flow chart of the steps performed when a client utilizes the lookup service depicted in FIG. 1;
FIG. 4 depicts a flow chart of the steps performed by the lookup service of FIG. 1 when performing event-related processing;
FIG. 5 depicts a conference room containing a number of devices consistent with the present invention;
FIG. 6 depicts a screen displaying icons representing services available in the conference room of FIG. 5;
FIG. 7 depicts a screen displaying the available services provided by a computer in the conference room of FIG. 5;
FIG. 8 depicts an alternate embodiment of the computer depicted in FIG. 2;
FIG. 9 depicts a flow chart of the steps performed by the client lookup manager of FIG. 8 when populating the cache;
FIG. 10 depicts a flow chart of the steps performed by the filtering algorithm contained within the client lookup manager;
FIG. 11 depicts a flow chart of the steps performed by a first query processing algorithm contained within the client lookup manager;
FIGS. 12A and 12B depict a flow chart of the steps performed by a second query processing algorithm contained within the client lookup manager; and
FIG. 13 depicts a flow chart of the steps performed by a notification process contained within the client lookup manager.
Methods and systems consistent with the present invention provide an improved lookup service that allows for the dynamic addition and deletion of services. As such, the addition and deletion of services is performed automatically, without user intervention, and clients of the lookup service may continue using the services while the updates to the lookup service occur. Additionally, clients may register with the lookup service to receive notification of when the lookup service is updated. As a result, when an update occurs, all registered clients receive a notification of the update, enabling the clients to avoid attempting to access a service that is no longer available and to use a service recently added to the lookup service.
In the exemplary distributed system, different computers and devices are federated into what appears to the user to be a single system By appearing as a single system, the exemplary distributed system provides the simplicity of access and the power of sharing that can be provided by a single system without giving up the flexibility and personalized response of a personal computer or workstation. The exemplary distributed system may contain thousands of devices operated by users who are geographically disperse, but who agree on basic notions of trust, administration, and policy. Within the exemplary distributed system are various logical groupings of services provided by one or more devices, and each such logical grouping is known as a Djinn. A “service” refers to a resource, data, or functionality that can be accessed by a user, program, device, or another service and that can be computational, storage related, communication related, or related to providing access to another user. Examples of services provided as part of a Djinn include devices, such as printers, displays, and disks; software, such as applications or utilities; information, such as databases and files; and users of the system.
FIG. 1 depicts the exemplary distributed system 100 containing a computer 102, a computer 104, and a device 106 interconnected by a network 108. The device 106 may be any of a number of devices, such as a printer, fax machine, storage device, input device, computer, or other devices. The network 108 may be a local area network, wide area network, or the Internet. Although only two computers and one device are depicted as comprising the exemplary distributed system 100, one skilled in the art will appreciate that the exemplary distributed system 100 may include additional computers or devices.
FIG. 2 depicts the computer 102 in greater detail to show a number of the software components of the exemplary distributed system 100. One skilled in the art will appreciate that computer 104 or device 106 may be similarly configured. Computer 102 includes a memory 202, a secondary storage device 204, a central processing unit (CPU) 206, an input device 208, and a video display 210. The memory 202 includes a lookup service 212, a discovery server 214, and a Java runtime system 216. The Java runtime system 216 includes the Java remote method invocation system (RMI) 218 and a Java virtual machine 220. The secondary storage device 204 includes a Java space 222.
As mentioned above, the exemplary distributed system 100 is based on the Java programming environment and thus makes use of the Java runtime system 216. The Java runtime system 216 includes the Java Application Programming Interface (API), allowing programs running on top of the Java runtime system to access, in a platform-independent manner, various system functions, including windowing capabilities and networking capabilities of the host operating system. Since the Java API provides a single common API across all operating systems to which the Java runtime system 216 is ported, the programs running on top of a Java runtime system run in a platform-independent manner, regardless of the operating system or hardware configuration of the host platform. The Java runtime system 216 is provided as part of the Java software development kit available from Sun Microsystems of Mountain View, Calif.
The Java virtual machine 220 also facilitates platform independence. The Java virtual machine 220 acts like an abstract computing machine, receiving instructions from programs in the form of bytecodes and interpreting these bytecodes by dynamically converting them into a form for execution, such as object code, and executing them. RMI 218 facilitates remote method invocation by allowing objects executing on one computer or device to invoke methods of an object on another computer or device. Both RMI and the Java virtual machine are also provided as part of the Java software development kit.
The discovery server 214 detects when a new device is added to the exemplary distributed system 100, during a process known as boot and join or discovery, and when such a new device is detected, the discovery server passes a reference to the lookup service 212 to the new device, so that the new device may register its services with the lookup service and become a member of the Djinn. After the device discovers the lookup service 212, the device may access any of the services registered with the lookup service 212. Furthermore, the device may also advertise its own services by registering with the lookup service 212. Once registered, the services provided by the device may be accessed through the lookup service 212, by all other entities that also discover lookup service 212. The process of boot and join is described in greater detail in U.S. patent application Ser. No. 09/044,939, now U.S. Pat. No. 6,560,656, entitled “Apparatus and Method for Providing Downloadable Code for Use in Communicating with a Device in a Distributed System,” which has previously been incorporated by reference.
Although systems and methods consistent with the present invention are described as operating in the exemplary distributed system and the Java programming environment, one skilled in the art will appreciate that the present invention can be practiced in other systems and other programming environments. Additionally, although aspects of the present invention are described as being stored in memory, one skilled in the art will appreciate that these aspects can also be stored on or read from other types of computer-readable media, such as secondary storage devices, like hard disks, floppy disks, or CD-ROM; a carrier wave from the Internet; or other forms of RAM or ROM. Sun, Sun Microsystems, the Sun Logo, Java, and Java-based trademarks are trademarks or registered trademarks of Sun Microsystems, Inc. in the United States and other countries
The Lookup Service Definition
A lookup service provides a central registry of services available within a Djinn. This lookup service is the primary mechanism for programs to find services within the Djinn and is the foundation for providing user interfaces through which users and administrators can discover and interact with services of the Djinn.
The lookup service maintains a flat collection of service items. The collection is flat in that the service items do not form a hierarchy. Each service item represents an instance of a service available within the Djinn. The service item contains a stub (if the service is implemented as a remote object) or a serialized object (if the service is a local object stored in the lookup service) that programs use to access the service, and an extensible collection of attributes that describe the service or provide secondary interfaces to the service. A “stub” is code and data that facilitates access to a remote function, and a “serialized object” is an object placed in a serialized form.
Although the collection of service items is flat, a wide variety of hierarchical views can be imposed on the collection by aggregating items according to service types and attributes. The lookup service provides a set of methods to enable users and administrators to browse the collection and build a variety of user interfaces. Once an appropriate service is found, the user can interact with the service by loading a user interface applet, attached as another attribute on the item.
When a new service is created (e.g., when a new device is added to a Djinn), the service registers itself with the lookup service, providing an initial collection of attributes. For example, a printer may include attributes indicating speed (in pages per minute), resolution (in dots per inch), and whether duplex printing is supported. The attributes also contain an indicator that the service is new and needs to be configured. To configure a new service, the administrator locates an attribute that provides an applet for this purpose, and during configuration, the administrator may add new attributes, such as the physical location of the service and a common name for it. The lookup service provides an event mechanism that generates notifications as new services are registered, existing services are deleted, or attributes of a service are modified. To use the event mechanism, a client registers to be notified upon the occurrence of a particular event, and when the event occurs, the lookup service notifies the client.
Programs (including other services) that need a particular type of service can use the lookup service to find an instance of the service. A match may be made based on the specific Java programming language types implemented by the service as well as the specific attributes attached to the service.
If a service encounters a problem that needs administrative attention, like a printer running out of toner, the service can add an attribute that indicates the problem. Administrators (or programs) can then use the event mechanism to receive notification of such problems.
The attributes of a service item are represented as a set of attribute sets. An individual set of attributes may be represented as an instance of a class in the Java programming language, each attribute being a public field of that class. The class provides strong typing of both the set and the individual attributes. A service item can contain multiple instances of the same class with different attribute values as well as multiple instances of different classes. For example, an item may have multiple instances of a Name class, each giving the common name of the service in a different language, plus an instance of a Location class, an Owner class, and various service-specific classes.
Service Items are stored in the lookup service as instances of the ServiceItem class, as described below:
public class Service Item {
public static final long ASSIGN_SERVICE_ID = 0;
public Object service;
public Entry [ ] attributeSets;
The “serviceID” element is a numerical identifier of the service. The “service” element is an object representing the service or a stub facilitating access to the service, and the “attributeSets” element contains the array of attributes for the service.
Items in the lookup service are matched using instances of the ServiceTemplate class, and the ServiceItemFilter interface which are defined below:
public class Service Template {
public static final long ANY_SERVICE_ID = 0;
public Class[ ] serviceTypes;
public Entry[ ] attributeSetTemplates;
The “serviceTypes” element defines the types of the service. An item (item) matches a service template (tmpl) if item.serviceID equals tmpl.serviceID (or if tmpl.serviceID is zero) and item.service is an instance of every type in tmpl.serviceTypes, and item.attributeSets contains at least one matching entry for each entry template in tmpl.attributeSetTemplates. Entry matching uses the following rule: an entry matches an entry template if the class of the entry is the same as, or a superclass of, the class of the template and every non-null field in the template equals the corresponding field of the entry. Every entry can be used to match more than one template. Both serviceTypes and attributeSetTemplates can be null in a service template.
The ServiceItemFilter interface defines the methods used by an object to apply additional matching criteria when searching for services on a lookup service. This filtering mechanism is particularly useful to entities that wish to extend the capabilities of the standard template matching schema previously discussed. For example, since template matching does not allow one to easily search for services based on a range of attribute values, this additional matching mechanism can be exploited by the entity to ask the managing object to find all registered printer services that have a resolution attribute between 300 and 1200 dpi. As seen below, the “check” method defines the implementation of the additional matching criteria to apply to a ServiceItem object found through standard template matching. This method takes the ServiceItem object as the sole argument, to test against the additional criteria. This method returns true if the input object satisfies the additional criteria, and false otherwise.
public interface ServiceItemFilter
public boolean check(ServiceItem item);
The ServiceMatches class is used for the return value when looking up multiple items. The definition of this class follows:
public class ServiceMatches {
public ServiceItem[ ] items;
public int totalMatches;
The interface to the lookup service is defined by a ServiceRegistrar interface data structure. This interface is not a remote interface. Instead, each implementation of the lookup service exports proxy objects that implement the ServiceRegistrar interface local to the client, using an implementation-specific protocol to communicate with the actual remote server. “Proxy objects” refer to objects that run in the client's address space and that facilitate access to the lookup service. Methods are provided to register service items, find items that match a template, modify attributes of existing items, receive notifications when items are modified, and incrementally explore the collection of items along the three major axes: service ID, service type, and attributes. The definition of the interface follows:
public interface ServiceRegistrar {
long REGISTRAR_SERVICE_ID = 1;
ServiceLease register (Service Item item,
long lease expiration) throws RemoteException;
Object lookup (ServiceTemplate tmpl)
ServiceMatches lookup(ServiceTemplate tmpl,
int addAttributes (ServiceTemplate tmpl,
Entry [ ] attrSets)
int modifyAttributes(ServiceTemplate tmpl,
int TRANSITION_MATCH_NOMATCH = 1;
int TRANSITION_NOMATCH_MATCH = 2;
int TRANSITION_MATCH_MATCH = 3;
EventRegID notify (Service Template tmpl,
int transition,
long leaseExpiration)
Class [ ] getEntryClasses (ServiceTemplate tmpl)
Object [ ] getFieldValues (ServiceTemplate tmpl),
int setIndex,
Class [ ] getServiceTypes (Service Template tmpl,
String packagePrefix
This interface includes various methods, including the register method, the lookup method (single parameter form), the lookup method (two parameter form), the addAttributes method, the modifyAttributes method, the notify method, the getEntryClass method, the getFieldValues method, and the getServiceTypes method. The “register” method is used to register a new service and to re-register an existing service. This method is defined so that it can be used in an idempotent fashion. Specifically, if a call results in generation of an exception (in which case the item might or might not have been registered), the caller can simply repeat the call with the same parameters.
To register a new service using the register method, item.ServiceID should be zero; if item.ServiceID does not equal any existing item's service object, then a new unique service id will be assigned and returned. The service id is unique over time with respect to this lookup service. If item.ServiceID does equal an existing item's service object, the existing item is deleted from the lookup service (even if it has different attributes), but that item's service id is reused for the newly registered item.
To re-register an existing service using the register method, item.ServiceID should be set to the same unique service id that was returned by the initial registration. If an item is already registered under the same service id, the existing item is deleted (even if it has different attributes or a different service instance). Note that service object equality is not checked in this case to allow for reasonable evolution of the service (e.g., the serialized form of the stub changes, or the service implements a new interface).
When an item is registered, duplicate attribute sets are eliminated in the stored representation of the item. Additionally, the registration is persistent across restarts of the lookup service.
The single-parameter form of the “lookup” method returns the service object (i.e., ServiceItem.service) from an item matching the template, or null if there is no match. If multiple items match the template, it is arbitrary as to which service object is returned. If the returned object cannot be deserialized, an exception is generated.
The two-parameter form of the “lookup” method returns at most maxMatches items matching the template, plus the total number of items that match the template. The return value is never null, and the returned items array is only null if maxMatches is zero. For each returned item, if the service object cannot be deserialized, the service field of the item is set to null and no exception is generated. Similarly, if an attribute set cannot be deserialized, that element of the attributeSets array is set to null and no exception is generated.
The “addAttributes” method adds the specified attribute sets (those that aren't duplicates of existing attribute sets) to all items matching the template. The number of items that were matched is returned. Note that this operation has no effect on existing attribute sets of the matching items. and the operation can be repeated in an idempotent manner.
The “modifyAttributes” method is used to modify existing attribute sets. The lengths of tmpl.attributeSetTemplates and attrSets must be equal or an exception is generated. For each item that matches the template, the item's attribute sets are modified as follows. For each array index I: if attrSets[i] is null, then every entry that matches tmpl.attributeSetTemplates[i] is deleted; otherwise, for every non-null field in attrSets [I], the value of that field is stored into the corresponding field of every entry that matches tmpl.attributeSettemplates[i]. The class of attrSets[i] must be the same as, or a superclass of, the class of tmpl.attributeSetTemplates [I], or an exception is generated. If the modification results in duplicate entries within an item, the duplicates are eliminated. The number of items that were matched is returned.
The “notify” method is used to register for event notification. The registration is leased, and the lease expiration request is exact. The concept of a lease is described in greater detail in U.S. patent application Ser. No. 09/044,923, now U.S. Pat. No. 6,263,350 entitled “Method and System for Leasing Storage,” which has previously been incorporated by reference. The registration is persistent across restarts of the lookup service until the lease expires or is canceled. The event id in the returned EventRegId is unique at least with respect to all other active event registrations at this lookup service with different service templates of transitions.
While the event registration is in effect, a notification containing an indication of the event is sent to the specified listener whenever a register, lease cancellation or expiration, addAttributes, or modifyAttributes operation results in a service item changing state in a way that satisfied the template and transition combination. A list of the transitions follows, although other transitions may also be implemented within the scope of the present invention:
TRANSITION_MATCH_NOMATCH: an event is sent when the changed item matches the template before the operation, but doesn't match the template after the operation (this includes deletion of the item).
TRANSITION_NOMATCH_MATCH: an event is sent when the changed item doesn't match the template before the operation, (this includes not existing), but does match the template after the operation.
TRANSITION_MATCH_MATCH: an event is sent when the changed item matches the template both before and after the operation.
The “getEntryClasses” method looks at all items that match the specified template, finds every entry among those items that either doesn't match any entry templates or is a subclass of at least one match entry template, and returns the set of the (most specific) classes of those entries. Duplicate classes are eliminated, and the order of classes within the returned array is arbitrary. Null (not a empty array) is returned if there are no such entries or no matching items. If a returned class cannot be deserialized, that element of the returned array is set to null and no exception is thrown.
The “getFieldValue” method identifies all items that match the specified template. This method returns the values of the items that match the specified template.
The “getServiceTypes” method looks at all items that match the specified template, and for every service object, this method finds every type (class or interface) of which the service object is an instance that is neither equal to, nor a superclass of, any of the service types in the template, and returns the set of all such types that start with the specified package prefix. Duplicate types are eliminated, and the order of types within the returned array is arbitrary. Null (not an empty array) is returned if there are no such types. If a returned type cannot be deserialized, that element of the returned array is set to null and no exception is thrown.
The Lookup Service Processing
FIGS. 3A and 3B depict a flowchart of the steps performed when a client, a program running on a particular device, makes use of the lookup service 212. Initially, the device on which the client runs is connected to the Jini distributed system (302). Next, the client sends a multi-cast packet containing code for communication with the client (step 304). In this step, the client is performing the discovery protocol as described in further detail in U.S. patent application Ser. No. 09/044,945, now U.S. Pat. No. 6,578,044, entitled “Apparatus and Method for Providing Downloadable Code for Use in Communication With a Device in a Distributed System,” which has previously been incorporated by reference.
After the client sends the multi-cast packet, the discovery server 214 receives the packet and uses the code contained in the packet to send a reference to the lookup service to the client (step 306). After the client receives the reference to the lookup service, the client is able to utilize the interface of the lookup service to either add a service, delete a service, access a service, or request notification when the lookup service is updated, as reflected by steps 308-326.
At some point during the processing of the client, it may decide to add a service to the lookup service (step 308). If it decides to add a service, the client adds a service to the lookup service by invoking the register method, which sends to the lookup service either an object representing the service or a stub containing code and data to facilitate access to the service (step 310). The addition of the stub to the lookup service is described in greater detail in co-pending U.S. patent application Ser. No. 09/044,826, entitled “Method and System for Facilitating Access to a Lookup Service,” which has previously been incorporated by reference.
Next, the client may decide to delete one of its services from the lookup service (step 312). If a client decides to do so, the client deletes the service from the lookup service by canceling the service's lease with the lookup service (step 314). It should be noted that both the addition of service and the deletion of a service are done dynamically and in a manner that does not prohibit other clients from using the lookup service while the update occurs.
At some point later in the processing of the client, the client may decide to access a service provided by the lookup service (step 316). If a client decides to access a service provided by the lookup service, the client accesses the service by invoking the lookup method, which retrieves from the lookup service either the object or the stub information for the service, and the client then either invokes methods on the object to use the service or uses the stub information to access the service (step 318). The step is described in greater detail in co-pending U.S. patent application Ser. No. 09/044,826, entitled “Method and System for Facilitating Access to a Lookup Service,” which has previously been incorporated by reference.
The client may also request to be notified when an update occurs to the lookup service (step 320 in FIG. 3B). If a client wishes to be notified, the client invokes the notify method on the lookup service interface to register a callback routine with the lookup service (step 322). A “callback routine” is a function that is invoked when the lookup service is updated. Additionally, the notify method allows the client to register an object that will be passed back, via RMI, as a parameter to the callback function.
Next, if an event has occurred for which the client wants to be notified (step 324), the registered callback routine is invoked by the lookup service (step 326). In this step, the client is notified of the occurrence of the event and can take appropriate action. For example, if a service that the client was currently using has become unavailable, the client may store information so that it no longer uses it.
FIG. 4 depicts a flow chart of the steps performed by the lookup service when performing event-related processing. Initially, the lookup service receives registrations from a number of clients interested in receiving notifications when particular events occur (step 402). In this step, the lookup service receives the registrations via invocation of the notification method on the lookup service interface and stores into a table, known as the event table, all of the associated information, such as an indication of the client to be notified, a reference to the callback routine, an object to be passed as a parameter to the callback routine, and an indication of the event in which the client is interested. It should be noted that a client may register to be notified upon the occurrence of an event, or the client may register for a third party to be notified. After receiving the registrations, the lookup service determines whether an event occurred such that at least one client has registered an interest in the event (step 404). The lookup service makes this determination by identifying when, for example, a new service has been added to the lookup service, an existing service has been deleted from the lookup service, or the attributes of a service have been modified. If such an event has not occurred, the event notification process of the lookup service remains in a wait state.
However, if an event has occurred, the lookup service determines all clients registered for notification for this event (step 406). The lookup service makes this determination by accessing the event table. Next, the lookup service invokes the callback routines registered for each client identified in step 406 (step 408). In this step, the event table contains a reference to the callback routine registered by each client, and the lookup service invokes each callback routine, passing the registered objects as parameters, to notify the clients of the occurrence of the event.
Since lookup services are generally located on a computer remote from the client, a query to a lookup service typically involves a remote call. Such remote calls are much more costly in terms of processing overhead and failure risk than are local procedure calls. This cost is magnified when a client must make frequent queries for multiple services. Such scenarios make it desirable for a client to internally store references to discovered lookup services and network services of interest. This approach permits the client to identify and access lookup services by simply searching a locally stored cache. It also provides the capability for a client to efficiently react to network failures by maintaining a redundant collection of network services. The processing overhead required to perform these functions also makes it desirable to delegate the scheduling of them to a client lookup manager, and thereby free the client to perform other functions. FIG. 8 depicts a client computer in accordance with an alternate embodiment of the present invention. As shown in FIG. 8, computer 104, includes a memory 802, secondary storage device 804, CPU 806, input device 808, video display 810, and Java runtime system 316. Client computer 104 additionally includes a client 812, a client lookup manager 814 and a cache 815. The client lookup manager 814 is implemented by a client lookup manager class comprised of a helper utility class that any client 812 can use to create and populate a cache 815, and with which the client can register for notification of the availability of services of interest. A helper utility is a programming component that can be used during construction of Jini services and/or clients. Helper utilities are not remote. In other words, their methods typically do not execute on remote hosts. Consequently, they do not register with a lookup service and they are instantiated locally by devices wishing to employ them.
In accordance with the alternate embodiment, when the client lookup manager discovers a lookup service 212, the client lookup manager 814 evaluates each of the associated network services and stores references to network services of interest in the local cache 815. As shown in FIG. 9, when the client lookup manager receives a reference to a lookup service (step 900), it extracts the network service (step 910) and evaluates whether the service is of interest to the client (step 920). If the service is of interest, the client lookup manager adds the service to the cache in step 930 and process flows to step 940. If the service is not of interest, process immediately flows to step 940 where the client lookup manager determines whether there are more network services available in the lookup service. If there are more services available, program execution returns to step 910, where another network service is extracted. If there are not any more network services available, process flows to step 950 where the client lookup manager determines whether there are any remaining undiscovered lookup services. If there are undiscovered lookup services, program execution returns to step 900 and a new lookup service is discovered. In the event that all lookup services have been discovered, then the process of populating the cache is complete and program execution ends.
To perform the function of populating the cache as shown in step 920, the client lookup manager utilizes a complex filtering algorithm to extract any subset of network services desired by a client. As shown in FIG. 10, this process begins in step 1000 with a user inputting the ServiceTemplate and ServiceItemFilter arguments described earlier. As shown in step 1010, a null reference input to the template argument is treated as the equivalent of inputting a ServiceTemplate constructed with all null arguments (all wildcards). That is, as shown in step 1030, the cache attempts to discover all services contained in a lookup service. Otherwise, the cache attempts to discover services contained in each lookup service that match the inputted criteria (step 1020). Next, the process performs the filtering specified by the ServiceItemFilter argument. In contrast to a null input to the ServiceTemplate as previously discussed, a null input to the filter argument (step 1040) has the opposite effect in that processing terminates and only template-matching will be employed to find the desired services. Otherwise, additional filtering in accordance with the inputted criteria will be employed (step 1050) and the cache will be populated accordingly.
Once the cache is populated, the client lookup manager handles all activities related to the cache including accessing, updating and deleting the cache. For example, as shown in FIG. 11, when the client desires access to a service reference, it transmits a request, via a local event to the client lookup manager (step 1100). In step 1110, the client lookup manager searches the cache to determine whether an instance of the requested service is stored in the cache. If the service is found (step 1120), the client lookup manager returns an instance of the requested service in step 1130 and the process ends. If, the service is not found, the client lookup manager returns a null reference in step 1140, and the process terminates. Depending on the specific implementation of the client lookup manager, the process can either re-institute a new search, wait for a new query request from the client, or re-query the associated lookup services.
As shown in FIGS. 12A and 12B, if a requested service reference is not found in the cache or if an insufficient number of references is retrieved (in the case of a client request for multiple references), the client lookup manager can re-query the associated lookup services. As shown in step 1200, this form of lookup takes as input an integer argument (MaxMatches) that represents the maximum number of matches that should be returned. In other words, the object returned by this method will contain no more than that number of service references, although it may contain less. This method also takes an integer argument (WAIT) that indicates the maximum amount of time the process is to wait before returning the identified service references. This argument prevents the client lookup manager from attempting to discover a requested number of MaxMatches for an infinite period of time. This feature is particularly useful to a user who is interested in choosing a service from a list of possible candidates instead of receiving a single service.
Once the ServiceTemplate, ServiceItemFilter, MaxMatches, and WAIT arguments are input, the process proceeds to step 1210 where the method accesses a lookup service. In step 1220, the method retrieves a service reference from the lookup service and in step 1230, determines whether the retrieved service reference is a qualifying service. If a qualifying service is found, the process proceeds to step 1240 and an array of Serviceltem objects is recorded. Otherwise, the process proceeds to step 1250. After an array of ServiceItem objects is recorded in step 1240, the process then compares the number of identified matches with the MaxMatches value previously input (step 1260). If the number of identified matches equals the MaxMatches value, the process returns the identified array of Serviceltem objects in step 1270 and the process terminates. Otherwise, the process proceeds to step 1250. As indicated earlier, this process will wait a predetermined period of time for the client lookup manager to identify the requested number of qualifying services. But, it returns immediately upon discovering the requested number of service references. In step 1250, the process determines whether any more unexamined services exist inside the lookup service. If there are more, process flows to step 1220 and another service reference is retrieved. If there are no more services in the lookup service, process flows to step 1280 to determine whether any more unexamined lookup services exist. If there are more lookup services, the process continues back to step 1210 to access another lookup service. If there are no more unexamined lookup services in step 1280, the process proceeds to step 1290 where the method determines whether the WAIT argument has been invoked (WAIT>=0) and if so, whether the duration has been exceeded.
The “wait” feature is quite useful to entities that cannot proceed until such a service of interest is found. As shown in FIGS. 12A and 12B, entities wishing to employ this feature must input a positive value to the WAIT argument which represents the number of milliseconds to wait for the desired service or services to be discovered. If a non-positive value is input to this argument, then this method will not wait. It will simply query all available lookup services once, and return the array of identified ServiceItem objects. If WAIT has been invoked and the elapsed time exceeds the WAIT duration, the process continues to step 1270, returns the array of ServiceItem objects found thus far and then the process terminates. On the other hand, if WAIT has been invoked and the duration has not been exceeded, the process continues to step 1291 and the client lookup manager registers with the event mechanism of the discovered lookup services. The event mechanism requests the lookup services notify the client lookup manager when one of the lookup service's associated networks services changes. When a service changes, the client lookup manager determines whether the new service is a service of interest in step 1292. If the service is of interest, it is recorded in the ServiceItem array (step 1293). Otherwise, execution flows to step 1296 where the process determines whether the elapsed time is less than or equal to the WAIT duration. If it is, the client lookup manager waits to be notified of a new service. If the time has expired, the client lookup manager returns the array of ServiceItem objects found thus far in step 1295. Once a service is recorded in the ServiceItem array (step 1293) the client lookup manager determines whether the number of ServiceMatches is less than MaxMatches. If it is, execution flows to step 1296 where the process determines whether the elapsed time is less than or equal to the WAIT duration. If the number of ServicesMatches is equal to MaxMatches, then the desired number of services has been found and process flows to step 1295 where the identified array is returned. It should be obvious to those skilled in the art that instead of an array of objects, this process could return an instance of an object without departing from the scope of this process. It should also be obvious to those skilled in the art that instead of returning when the total number of references equals the maxMatches object, this method could instead return once a minimum number of references (minMatches) have been found.
Just as the client may request that it be notified of state changes in network services occurring within each lookup service, as previously described in FIG. 4, so too can the cache request that it be notified. In other words, the client and the cache can separately be notified of the same or different events after receiving notification from a lookup service. FIG. 13 shows the steps performed by the client lookup manager when either the cache or the client has requested event notification. First, as shown in step 1310, the lookup service observes a state change in a registered service. Next, the lookup service determines, in step 1320, whether the event satisfies matching criteria specified by one of its associated clients. If it does, the lookup service transmits the event notification to the requesting client (step 1330) via a remote event. If the event does not satisfy matching criteria, the process ends. Next, the cache (step 1350) determines whether the reported event necessitates a cache update. More specifically, since the cache may receive multiple events corresponding to the same service, it must first determine whether it has previously been notified of this particular event. For example, a particular service may be registered with more than one lookup service or multiple configurations of the same service can be registered with a lookup service. When a lookup service reports an event to a client, the lookup service has no way of knowing whether the event has previously been reported to the client via another lookup service. If the cache has not previously been notified of this event, the cache is updated in step 1360. Otherwise, the process ends (note: if the cache has been previously notified, then the client has also previously been notified). Once the cache has been updated, it next determines whether the client is required to be notified as well (step 1370). If the client requested notification, a notification message is sent via local event to the client in step 1380 and the process terminates. This “many-to-one” relationship between the events received by the cache 815 and the events sent by the cache hides from the client 812, the lookup services with which the cache 815 interacts. For many entities that use the cache's event mechanism to interact with the cache's discovered services, knowledge of the number of distinct service references, as well as identification of the lookup services with which those references are registered, is of no interest. Such entities typically are interested only in acquiring a reference—not all references to the services it needs to do its job. For entities which are interested in this additional information, the cache 815 provides methods separate from the event mechanism for obtaining that information.
The Conference Room Example
Described below is an example use of the lookup service 212 with respect to a conference room 500 as depicted in FIG. 5. The conference room 500 contains a printer 502, a fax machine 504, a computer 506, a projection screen 508, and a storage device 510, all interconnected by a network 512. The computer 506 contains a lookup service 518 that defines all services made available by the conference room Djinn. In this example, the user enters the conference room 500 with laptop 514. Such a situation occurs when a user with a laptop enters the conference room 500 for a meeting. If the user wishes to make use of the services provided by various devices in the conference room 500, the user must join the Djinn of the conference room. In order to do so, the user connects the laptop to the network 512 and runs a program, client 516, to perform the boot and join (or discovery) process, as described above. After the completion of the boot and join process, the client 516 (e.g., a browser) receives a reference to the lookup service 518 defining the services provided by the conference room Djinn. Using this reference, the client 516 downloads an applet from the lookup service 518 that displays a screen 600, as shown in FIG. 6.
FIG. 6 depicts screen 600 displaying the available services of the lookup service 518 represented as various icons, including a printer 602, a fax 604, a file system 606, and a projection screen 608. The screen 600 also displays an add service button 610. When the printer icon 602 is selected, the stub code (i.e., service item) for the printer is downloaded to the client so that the client may make use of the printer. Similarly, selection of the fax icon 604, the file system icon 606, or the projection screen icon 608 downloads the appropriate stub information so that the client can use those services. The file system icon 606 represents the file system of the computer 506.
The user, however, may want to add a service and thus selects the add service button 610. Upon selection of the add service button 610, a screen 700 is presented to the user as shown in FIG. 7. The screen 700 depicts the available services of the laptop 514 which the user may add to the Djinn. For example, the available services on the laptop 514 may include a Java space 702, the laptop file system 704, a database 706, and a dictionary 708. The user may select any of these services, which are then automatically added to the lookup service and made available to other users of the Djinn.
Although methods and systems consistent with the present invention have been described with reference to a preferred embodiment thereof, those skilled in the art will know of various changes in form and detail which may be made without departing from the spirit and scope of the present invention as defined in the appended claims.
US3449669 7 fev. 1966 10 jun. 1969 Aga Ab Frequency control circuit transforming phase angle into frequency
US4800488 12 nov. 1985 24 jan. 1989 American Telephone And Telegraph Company, At&T Bell Laboratories Method of propagating resource information in a computer network
US5339430 1 jul. 1992 16 ago. 1994 Telefonaktiebolaget L M Ericsson System for dynamic run-time binding of software modules in a computer system
US5491791 13 jan. 1995 13 fev. 1996 International Business Machines Corporation System and method for remote workstation monitoring within a distributed computing environment
US5634008 18 jul. 1994 27 maio 1997 International Business Machines Corporation Method and system for threshold occurrence detection in a communications network
US5664191 30 jun. 1994 2 set. 1997 Microsoft Corporation Method and system for improving the locality of memory references during execution of a computer program
US5674982 5 jun. 1995 7 out. 1997 Bayer Corporation Multimeric form of human rhinovirus receptor protein
US5675804 31 ago. 1995 7 out. 1997 International Business Machines Corporation System and method for enabling a compiled computer program to invoke an interpretive computer program
US5682534 12 set. 1995 28 out. 1997 International Business Machines Corporation Transparent local RPC optimization
US5721825 3 out. 1996 24 fev. 1998 Netvision, Inc. System and method for global event notification and delivery in a distributed computing environment
US5734706 7 maio 1996 31 mar. 1998 Windsor; Victoria Brein Caller identification and data retrieval system
US5758083 30 out. 1995 26 maio 1998 Sun Microsystems, Inc. Method and system for sharing information between network managers
US5758328 22 fev. 1996 26 maio 1998 Giovannoli; Joseph Computerized quotation system and method
US5758344 31 out. 1996 26 maio 1998 Novell, Inc. Method and apparatus for moving subtrees in a distributed network directory
US5761507 5 mar. 1996 2 jun. 1998 International Business Machines Corporation Client/server architecture supporting concurrent servers within a server with a transaction manager providing server/connection decoupling
US5764915 8 mar. 1996 9 jun. 1998 International Business Machines Corporation Object-oriented communication interface for network protocol access using the selected newly created protocol interface object and newly created protocol layer objects in the protocol stack
US5764982 11 ago. 1994 9 jun. 1998 International Business Machines Corporation Peer-to-peer communication interface
US5768524 30 abr. 1996 16 jun. 1998 International Business Machines Corporation Method for processing requests for notice of events
US5774729 29 nov. 1993 30 jun. 1998 International Business Machines Corporation Event handling in a high level programming language environment
US5778187 9 maio 1996 7 jul. 1998 Netcast Communications Corp. Multicasting method and apparatus
US5784560 15 dez. 1995 21 jul. 1998 Novell, Inc. Method and apparatus to secure distributed digital directory object changes
US5790677 29 jun. 1995 4 ago. 1998 Microsoft Corporation System and method for secure electronic commerce transactions
US5794207 4 set. 1996 11 ago. 1998 Walker Asset Management Limited Partnership Method and apparatus for a cryptographically assisted commercial network system designed to facilitate buyer-driven conditional purchase offers
US5799173 21 maio 1997 25 ago. 1998 International Business Machines Corporation Dynamic workload balancing
US5805805 4 ago. 1995 8 set. 1998 At&T Corp. Symmetric method and apparatus for interconnecting emulated lans
US5806042 11 out. 1995 8 set. 1998 Kelly; William Franklin System for designing and implementing bank owned life insurance (BOLI) with a reinsurance option
US5808911 19 jun. 1997 15 set. 1998 Sun Microsystems, Inc. System and method for remote object resource management
US5809144 24 ago. 1995 15 set. 1998 Carnegie Mellon University Method and apparatus for purchasing and delivering digital goods over a network
US5812819 5 jun. 1995 22 set. 1998 Shiva Corporation Remote access apparatus and method which allow dynamic internet protocol (IP) address management
US5818448 2 jul. 1996 6 out. 1998 Sun Microsystems, Inc. Apparatus and method for identifying server computer aggregation topologies
US5828842 15 maio 1996 27 out. 1998 Hitachi, Ltd. Method of creating information for executing network management operations from a simplified definition of an operation sequence and providing a network management operation sequence, used in the information
US5832219 20 dez. 1995 3 nov. 1998 Object Technology Licensing Corp. Distributed object networking service
US5845090 30 set. 1996 1 dez. 1998 Platinium Technology, Inc. System for software distribution in a digital computer network
US5850442 26 mar. 1996 15 dez. 1998 Entegrity Solutions Corporation Secure world wide electronic commerce over an open network
US5872973 26 out. 1995 16 fev. 1999 Viewsoft, Inc. Method for managing dynamic relations between objects in dynamic object-oriented languages
US5887172 10 jan. 1996 23 mar. 1999 Sun Microsystems, Inc. Remote procedure call system and method for RPC mechanism independent client and server interfaces interoperable with any of a plurality of remote procedure call backends
US5889951 13 maio 1996 30 mar. 1999 Viewpoint Corporation Systems, methods, and computer program products for accessing, leasing, relocating, constructing and modifying internet sites within a multi-dimensional virtual reality environment
US5889988 8 nov. 1996 30 mar. 1999 Intel Corporation Debugger for debugging tasks in an operating system virtual device driver
US5905868 22 jul. 1997 18 maio 1999 Ncr Corporation Client/server distribution of performance monitoring data
US5913029 7 fev. 1997 15 jun. 1999 Portera Systems Distributed database system and method
US5915112 2 jan. 1996 22 jun. 1999 International Business Machines Corporation Remote procedure interface with support for multiple versions
US5925108 31 out. 1996 20 jul. 1999 Novell, Inc. Event notification in a computer system
US5933647 24 jan. 1997 3 ago. 1999 Cognet Corporation System and method for software distribution and desktop management in a computer network environment
US5940504 29 jun. 1992 17 ago. 1999 Infologic Software, Inc. Licensing management system and method in which datagrams including an address of a licensee and indicative of use of a licensed product are sent from the licensee's site
US5944793 13 fev. 1997 31 ago. 1999 International Business Machines Corporation Computerized resource name resolution mechanism
US5949998 3 jul. 1996 7 set. 1999 Sun Microsystems, Inc. Filtering an object interface definition to determine services needed and provided
US5951652 6 out. 1997 14 set. 1999 Ncr Corporation Dependable data element synchronization mechanism
US5956509 18 ago. 1995 21 set. 1999 Microsoft Corporation System and method for performing remote requests with an on-line service network
US5960404 28 ago. 1997 28 set. 1999 International Business Machines Corp. Mechanism for heterogeneous, peer-to-peer, and disconnected workflow operation
US5961582 25 out. 1994 5 out. 1999 Acorn Technologies, Inc. Distributed and portable execution environment
US5963924 26 abr. 1996 5 out. 1999 Verifone, Inc. System, method and article of manufacture for the use of payment instrument holders and payment instruments in network electronic commerce
US5963947 27 jan. 1998 5 out. 1999 International Business Machines Corporation Technique of dynamically adding functionality from a client to manipulated data at a server
US5966435 16 dez. 1997 12 out. 1999 Pino; Locillo G. Intermediate switch service management system architecture and method
US5969967 31 dez. 1997 19 out. 1999 Sun Microsystems, Inc. Methods and apparatus for conspiracy between objects
US5974201 3 jul. 1997 26 out. 1999 Siemens Corporate Research, Inc. Smart image system
US5978484 25 abr. 1996 2 nov. 1999 Microsoft Corporation System and method for safety distributing executable objects
US5978773 3 out. 1995 2 nov. 1999 Neomedia Technologies, Inc. System and method for using an ordinary article of commerce to access a remote computer
US5982773 24 mar. 1997 9 nov. 1999 Fujitsu Limited Lan connection method
US5987506 2 maio 1997 16 nov. 1999 Mangosoft Corporation Remote access and geographically distributed computers in a globally addressable storage environment
US5991808 2 jun. 1997 23 nov. 1999 Digital Equipment Corporation Task processing optimization in a multiprocessor system
US5996075 2 nov. 1995 30 nov. 1999 Sun Microsystems, Inc. Method and apparatus for reliable disk fencing in a multicomputer system
US5999988 31 mar. 1997 7 dez. 1999 Sun Microsystems, Inc. Method and apparatus for generating and employing a run-time generated stub to reference an object in object oriented systems
US6003050 10 fev. 1998 14 dez. 1999 Microsoft Corporation Method for integrating a virtual machine with input method editors
US6003065 24 abr. 1997 14 dez. 1999 Sun Microsystems, Inc. Method and system for distributed processing of applications on host and peripheral devices
US6009413 17 nov. 1997 28 dez. 1999 America Online, Inc. System for real time shopping
US6009464 16 out. 1995 28 dez. 1999 Sun Microsystems, Inc. Method and apparatus for enabling application programs to communicate with network clients and servers
US6014686 20 jun. 1997 11 jan. 2000 Telcordia Technologies, Inc. Apparatus and methods for highly available directory services in the distributed computing environment
US6016496 20 nov. 1997 18 jan. 2000 International Business Machines Corporation Method and apparatus for an object-oriented object for retrieving information from local and remote databases
US6016516 30 jul. 1997 18 jan. 2000 Fuji Xerox Co. Ltd. Remote procedure processing device used by at least two linked computer systems
US6018619 24 maio 1996 25 jan. 2000 Microsoft Corporation Method, system and apparatus for client-side usage tracking of information server systems
US6023586 10 fev. 1998 8 fev. 2000 Novell, Inc. Integrity verifying and correcting software
US6026414 5 mar. 1998 15 fev. 2000 International Business Machines Corporation System including a proxy client to backup files in a distributed computing environment
US6031977 18 dez. 1995 29 fev. 2000 Object Technology Licensing Corp. Object-oriented distributed communications directory service
US6032151 17 nov. 1997 29 fev. 2000 Sun Microsystems, Inc. Database system employing polymorphic entry and entry matching
US6034925 2 dez. 1996 7 mar. 2000 Thomson Consumer Electronics, Inc. Accessing control method for identifying a recording medium in a jukebox
US6041351 17 abr. 1997 21 mar. 2000 Newmoon.Com Network traffic by instruction packet size reduction
US6044381 11 set. 1997 28 mar. 2000 Puma Technology, Inc. Using distributed history files in synchronizing databases
US6052761 31 jan. 1997 18 abr. 2000 Hewlett-Packard Company Increment update in an SCI based system
US6055562 1 maio 1997 25 abr. 2000 International Business Machines Corporation Dynamic mobile agents
US6058381 30 out. 1997 2 maio 2000 Nelson; Theodor Holm Many-to-many payments system for network content materials
US6058383 26 jun. 1997 2 maio 2000 Kent Ridge Digital Labs Computationally efficient method for trusted and dynamic digital objects dissemination
US6067575 8 dez. 1995 23 maio 2000 Sun Microsystems, Inc. System and method for generating trusted, architecture specific, compiled versions of architecture neutral programs
US6078655 27 ago. 1997 20 jun. 2000 At&T Corp Automatic international reattempt method and apparatus
US6085030 2 maio 1997 4 jul. 2000 Novell, Inc. Network component server
US6085255 23 jan. 1998 4 jul. 2000 Us West, Inc. System and associated method for re-engineering a telecommunications support system with object-oriented translators
US6092194 6 nov. 1997 18 jul. 2000 Finjan Software, Ltd. System and method for protecting a computer and a network from hostile downloadables
US6093216 29 maio 1998 25 jul. 2000 Intel Corporation Method of run-time tracking of object references in Java programs
US6101528 28 nov. 1997 8 ago. 2000 Intel Corporation Method and apparatus for discovering server applications by a client application in a network of computer systems
US6104716 28 mar. 1997 15 ago. 2000 International Business Machines Corporation Method and apparatus for lightweight secure communication tunneling over the internet
US6108346 13 mar. 1999 22 ago. 2000 Xiox Corporation Combined synchronous and asynchronous message transmission
US6119122 17 set. 1997 12 set. 2000 Novell, Inc. Method and apparatus for generically viewing and editing objects
US6134603 20 mar. 1998 17 out. 2000 Sun Microsystems, Inc. Method and system for deterministic hashes to identify remote methods
US6154844 22 dez. 1997 28 nov. 2000 Finjan Software, Ltd. System and method for attaching a downloadable security profile to a downloadable
US6157960 7 maio 1997 5 dez. 2000 International Business Machines Corporation Technique for programmatically creating distributed object programs
US6182083 20 mar. 1998 30 jan. 2001 Sun Microsystems, Inc. Method and system for multi-entry and multi-template matching in a database
US6185602 16 out. 1998 6 fev. 2001 Sony Corporation Multi-user interaction of multimedia communication
US6185625 * 20 dez. 1996 6 fev. 2001 Intel Corporation Scaling proxy server sending to the client a graphical user interface for establishing object encoding preferences after receiving the client's request for the object
US6189046 27 mar. 1997 13 fev. 2001 Hewlett-Packard Company Mechanism and method for merging cached location information in a distributed object environment
US6192044 * 31 mar. 1997 20 fev. 2001 Intel Corporation Employing a look-up service and a callee connection service to establish a network phone call between a caller and a callee
US6199068 21 maio 1998 6 mar. 2001 Abb Power T&D Company Inc. Mapping interface for a distributed server to translate between dissimilar file formats
US6199116 24 maio 1996 6 mar. 2001 Microsoft Corporation Method and system for managing data while sharing application programs
US6212578 9 set. 1996 3 abr. 2001 Oracle Corporation Method and apparatus for managing dependencies in a distributed computing environment for ensuring the safety of remote procedure calls
US6216138 22 abr. 1994 10 abr. 2001 Brooks Automation Inc. Computer interface system for automatically generating graphical representations of computer operations linked together according to functional relationships
US6216158 25 jan. 1999 10 abr. 2001 3Com Corporation System and method using a palm sized computer to control network devices
US6219675 5 jun. 1997 17 abr. 2001 Microsoft Corporation Distribution of a centralized database
US6226746 20 mar. 1998 1 maio 2001 Sun Microsystems, Inc. Stack-based system and method to combine security requirements of methods
US6243716 20 ago. 1999 5 jun. 2001 Sun Microsystems, Inc. Methods and systems for distributed failure detection and recovery using leasing
US6243814 13 fev. 1998 5 jun. 2001 Sun Microsystem, Inc. Method and apparatus for reliable disk fencing in a multicomputer system
US6247091 28 abr. 1997 12 jun. 2001 International Business Machines Corporation Method and system for communicating interrupts between nodes of a multinode computer system
US6253256 15 out. 1997 26 jun. 2001 Sun Microsystems, Inc. Deferred reconstruction of objects and remote loading in a distributed system
US6263350 20 mar. 1998 17 jul. 2001 Sun Microsystems, Inc. Method and system for leasing storage
US6263379 20 ago. 1997 17 jul. 2001 Microsoft Corporation Method and system for referring to and binding to objects using identifier objects
US6269401 28 ago. 1998 31 jul. 2001 3Com Corporation Integrated computer system and network performance monitoring
US6272559 20 mar. 1998 7 ago. 2001 Sun Microsystems, Inc. Deferred reconstruction of objects and remote loading for event notification in a distributed system
US6282295 28 out. 1997 28 ago. 2001 Adam Lucas Young Auto-recoverable and auto-certifiable cryptostem using zero-knowledge proofs for key escrow in general exponential ciphers
US6282568 4 dez. 1998 28 ago. 2001 Sun Microsystems, Inc. Platform independent distributed management system for manipulating managed objects in a network
US6282581 27 mar. 1997 28 ago. 2001 Hewlett-Packard Company Mechanism for resource allocation and for dispatching incoming calls in a distributed object environment
US6292934 1 maio 1997 18 set. 2001 Microsoft Corporation Method and system for improving the locality of memory references during execution of a computer program
US6301613 3 dez. 1998 9 out. 2001 Cisco Technology, Inc. Verifying that a network management policy used by a computer system can be satisfied and is feasible for use
US6321275 24 out. 1997 20 nov. 2001 Microsoft Corporation Interpreted remote procedure calls
US6327677 27 abr. 1998 4 dez. 2001 Proactive Networks Method and apparatus for monitoring a network environment
US6339783 8 dez. 1997 15 jan. 2002 Fuji Xerox Co., Ltd. Procedure execution device and procedure execution method
US6343308 14 ago. 1997 29 jan. 2002 International Business Machines Corporation Systems, methods and computer programs for mixing different versions of Java classes
US6351735 22 ago. 1996 26 fev. 2002 Catalina Marketing International, Inc. Check transaction processing, database building and marketing method and system utilizing automatic check reading
US6360266 25 fev. 1999 19 mar. 2002 Object Technology Licensing Corporation Object-oriented distributed communications directory system
US6363409 24 abr. 1995 26 mar. 2002 Microsoft Corporation Automatic client/server translation and execution of non-native applications
US6378001 18 jun. 1997 23 abr. 2002 International Business Machines Corp. Collaborative framework with shared objects
US6385643 23 set. 1999 7 maio 2002 Bea Systems, Inc. Clustered enterprise Java™ having a message passing kernel in a distributed processing system
US6408342 28 mar. 1997 18 jun. 2002 Keith E. Moore Communications framework for supporting multiple simultaneous communications protocols in a distributed object environment
US6418468 11 jul. 2001 9 jul. 2002 Cisco Technology, Inc. Automatically verifying the feasibility of network management policies
US6463480 10 mar. 1997 8 out. 2002 International Business Machines Corporation Method and system of processing a plurality of data processing requests, and method and system of executing a program
US6496865 12 mar. 1997 17 dez. 2002 Novell, Inc. System and method for providing interpreter applications access to server resources in a distributed network
US6505248 24 mar. 1999 7 jan. 2003 Gte Data Services Incorporated Method and system for monitoring and dynamically reporting a status of a remote server
US6564174 29 set. 1999 13 maio 2003 Bmc Software, Inc. Enterprise management system and method which indicates chaotic behavior in system resource usage for more accurate modeling and prediction
US6578074 25 jun. 1999 10 jun. 2003 Mediaone Group, Inc. Provisioning server enhancement
US6603772 31 mar. 1999 5 ago. 2003 Cisco Technology, Inc. Multicast routing with multicast virtual output queues and shortest queue first allocation
US6604127 27 jul. 2001 5 ago. 2003 Brian T. Murphy Dynamic lookup service in distributed system
US6604140 23 set. 1999 5 ago. 2003 International Business Machines Corporation Service framework for computing devices
US6654793 30 jun. 1998 25 nov. 2003 Sun Microsystems, Inc. System and method for facilitating dynamic loading of stub information to enable a program operating in one address space to invoke processing of a remote method or procedure in another address space
US6704803 29 dez. 1998 9 mar. 2004 International Business Machines Corporation Method and system for distributing data events over an information bus
US6757262 15 set. 2000 29 jun. 2004 Motorola, Inc. Service framework supporting remote service discovery and connection
US6757729 7 out. 1996 29 jun. 2004 International Business Machines Corporation Virtual environment manager for network computers
US6801940 11 jan. 2002 5 out. 2004 Networks Associates Technology, Inc. Application performance monitoring expert
US6801949 8 maio 2000 5 out. 2004 Rainfinity, Inc. Distributed server cluster with graphical user interface
US6804711 19 out. 1999 12 out. 2004 Mci, Inc. Method and apparatus for managing call processing services in an intelligent telecommunication network
US6804714 14 abr. 2000 12 out. 2004 Oracle International Corporation Multidimensional repositories for problem discovery and capacity planning of database applications
US7075412 29 maio 2003 11 jul. 2006 Thingmagic L.L.C. Methods and apparatus for operating a radio device
US7123608 17 mar. 2000 17 out. 2006 Array Telecom Corporation Method, system, and computer program product for managing database servers and service
US20010003824 14 mar. 1997 14 jun. 2001 International Business Machines Corporation Bootstrapping technique for distributed object client systems
US20010011350 2 jul. 1997 2 ago. 2001 Mahboud Zabetian Apparatus and method for electronic document certification and verification
US20020059212 22 out. 2001 16 maio 2002 Nec Corporation Stub search loading system and method, server apparatus, client apparatus, and computer-readable recording medium
US20020099812 11 dez. 1998 25 jul. 2002 Owen Davis Method and apparatus for tracking client interaction with a network resource and creating client profiles and resource database
US20020111814 12 dez. 2000 15 ago. 2002 Barnett Janet A. Network dynamic service availability
US20030005132 16 maio 2001 2 jan. 2003 Nortel Networks Limited Distributed service creation and distribution
US20030033280 15 maio 2002 13 fev. 2003 Van Den Hamer Peter Self-descriptive data tag
US20030084204 23 abr. 1996 1 maio 2003 Ann M. Wollrath System and method for facilitating dynamic loading of "stub"information to enable a program operating in one address space to invoke processing of a remote method or procedure in another address space
US20030155415 27 nov. 2002 21 ago. 2003 Kimberly-Clark Worldwide, Inc. Communication between machines and feed-forward control in event-based product manufacturing
US20030191984 27 ago. 2002 9 out. 2003 International Business Machines Corporation Data processing arrangement and method
US20040263319 30 jun. 2003 30 dez. 2004 Nokia Corporation System and method for supporting multiple reader-tag configurations using multi-mode radio frequency tag
US20050027796 4 ago. 2004 3 fev. 2005 Microsoft Corporation Directory service for a computer network
DE2262825A1 22 dez. 1972 27 jun. 1974 Bosch Gmbh Robert Elektrische steuereinrichtung fuer fahrzeuge
EP300516A2 Título indisponível
EP351536A3 Título indisponível
EP384339A3 Título indisponível
EP472874A1 Título indisponível
EP474340A2 Título indisponível
EP497022A1 Título indisponível
EP555997A2 Título indisponível
EP565849A2 Título indisponível
EP569195A3 Título indisponível
EP625750A2 Título indisponível
EP635792A2 Título indisponível
EP651328A1 Título indisponível
EP660231A2 Título indisponível
EP697655A2 Título indisponível
EP718761A1 Título indisponível
EP767432A2 Título indisponível
EP778520A2 Título indisponível
EP794493A2 Título indisponível
EP803810A2 Título indisponível
EP803811A2 Título indisponível
EP805393A2 Título indisponível
EP810524A1 Título indisponível
EP817020A2 Título indisponível
EP817022A2 Título indisponível
EP817025A2 Título indisponível
EP836140A2 Título indisponível
EP865180A2 Título indisponível
EP892530A2 Título indisponível
GB2262825A Título indisponível
GB2305087A Título indisponível
WO1993025962A1 18 jun. 1992 23 dez. 1993 International Business Machines Corporation Distributed applications processing network
WO2001013228A2 11 ago. 2000 22 fev. 2001 Sun Microsystems, Inc. Graceful distribution in application server load balancing
WO2001086394A2 9 maio 2001 15 nov. 2001 Sun Microsystems, Inc. Method and apparatus to obtain service capability credentials
WO2001090903A1 23 maio 2001 29 nov. 2001 Cohere Networks, Inc. Apparatus, system, and method for balancing loads to network servers
1 "Consumers Can View, Share Picture On-Line as Kodak Picture Network Goes ‘Live’," Business Wire, Aug. 25, 1997, pp. 18-19.
2 "Consumers Can View, Share Picture On-Line as Kodak Picture Network Goes 'Live'," Business Wire, Aug. 25, 1997, pp. 18-19.
3 "Dynamic code downloading using RMI," http://java.sun.com/j2se/1.4.2/docs/guide/mi/codebase.html, 2003 (9 pages).
4 "Eden Project Proposal," Department of Computer Science, University of Washington, Oct. 1980, Technical Report #80-10-01, cover and Foreword.
5 "FAQ and Links to Resources," Jini-Users Mailing List Archives (Apr. 30, 1999).
6 "ISN Dataweb Sells Software, Hardware," Datamation, Apr. 1, 1996, p. 40.
7 "Java(TM) Object Serialization Specification," Sun Microsystems, Inc. XP-002242372, www.dei.estg,iplei.pt/P3/N/material/extra/serial-spec-JDK1-2.pdf, Nov. 30 1998 (76 pages).
8 "Java.io ObjectInputStream," XP-002243027, The Java Class Libraries, 2nd Edition, vol. 1, , Mar. 9, 1998, pp. 1230-1232, 1263-1264 and 1283 (7 pages).
9 "Java.io ObjectInputStream," XP-002243027, The Java Class Libraries, 2nd Edition, vol. 1, <java.sun.com/products/jdk/1.1/docs/guide/serialization/spec>, Mar. 9, 1998, pp. 1230-1232, 1263-1264 and 1283 (7 pages).
10 "Java™ Object Serialization Specification," Sun Microsystems, Inc. XP-002242372, www.dei.estg,iplei.pt/P3/N/material/extra/serial-spec-JDK1—2.pdf, Nov. 30 1998 (76 pages).
11 "Java™ Remote Method Invocation Specification," Sun Microsystems, Inc., <java.sun.com/products/jdk1.2beta1>, 1997.
12 "Jini Distributed Leasing Specification," Sun Microsystems, Jan. 1999, XP-002209076. (26 pages).
13 "Kodak DC220 and DC260 Digital Cameras Are Shipping To Retailers Across The Country Cameras Are Optimized for USB Interface Supported in Windows 98," Business Wire, Jun. 24, 1998, pp. 42-44.
14 "Kodak demonstrates leadership across entire photographic category," M2 Presswire, Feb. 13, 1998, pp. 31-35.
15 "Kodak PhotoNet Online Makes It a Snap to Share Summer Photos," PR Newswire, Jul. 2, 1998, pp. 63-64.
16 "Kodak Picture Network Sends Prints Home From the Holidays," Business Wire, Dec. 29, 1997, pp. 58-60.
17 "Passing Proxies as Parameters to Methods and Return Values from Methods," IBM Technical Disclosure Bulletin, vol. 41, No. 1, Jan. 1998, pp. 89-92. (4 pages).
18 "Photo processing made easy on the Internet; Storm Software and PictureVision team up with Konica Corp.," Business Wire, Feb. 22, 1996, pp. 3-4.
19 "Seeing your photos a whole new way," Business Wire, Dec. 12, 1996, pp. 9-10.
20 "Transparent Network Computing," Locus Computing Corporation, Jan. 5, 1995.
21 "Webwatch: MCI Announces Internet Access," Boardwatch Magazine, Jan. 1995.
22 Administrator's Guide, Netscape Enterprise Server, Version 3.0, Netscape Communications Corp., 1998.
23 Agha et al., "Actorspaces: An Open Distributed Programming Paradigm," University of Illinois, Report No. UIUCDCS-R-92-1766, Open Systems Laboratory TR No. 8, pp. 1-12, Nov. 1992.
24 Ahmed et al., "A Program Building Tool for Parallel Applications," Yale University, pp. 1-23, Dec. 1, 1993.
25 Aldrich et al., "Providing Easier Access to Remote Objects in Client-Server Systems," System Sciences, 1998, Proceedings of the 31st Hawaii Internat'l. Conference, Jan. 6-9, 1998, pp. 366-375.
26 Aldrich et al., "Providing Easier Access to Remote Objects in Distributed Systems," Calif. Institute of Technology, www.cs.caltech.edu/%7Ejedi/paper/jedipaper.html, Nov. 21, 1997.
27 Alexander et al., "Active Bridging," Proceedings of the ACM/SIGCOMM'97 Conference, Cannes, France, Sep. 1997.
28 Almes et al., "Edmas: A Locally Distributed Mail System," Department of Computer Science, University of Washington, Technical Report 83-07-01, Jul. 7, 1983, Abstract & pp. 1-17.
29 Almes et al., "Research in Integrated Distributed Computing," Department of Computer Science, University of Washington, Oct. 1979, pp. 1-42.
30 Almes et al., "The Eden System: A Technical Review," Department of Computer Science, University of Washington, Technical Report 83-10-05, Oct. 1983, pp. 1-25.
31 Almes, "Integration and Distribution in the Eden System," Department of Computer Science, University of Washington, Technical Report 83-01-02, Jan. 19, 1983, pp. 1-18 & Abstract.
32 Almes, "The Evolution of the Eden Invocation Mechanism," Department of Computer Science, University of Washington, Technical Report 83-01-03, Jan. 19, 1983, pp. 1-14 & Abstract.
33 Amitabh, D., et al., Proxies, Application Interfaces, and Distributed Systems, IEEE, pp. 212-220, 1992.
34 Anderson et al., "Persistent Linda: Linda + Transactions + Query Processing," Proceedings of the 13th Symposium on Fault Tolerant Systems, pp. 93-109, 1991.
35 Anonymo , "Change-Notification Service for Shared Files," IBM Technical Disclosure Bulletin, vol. 36, No. 8, pp. 77-82, XP002108713, New York, US, Aug. 1993.
36 Anonymo , "Resource Preemption for Priority Scheduling," IBM Technical Disclosure Bulletin, vol. 16, No. 6, p. 1931, XP002109435 New York, US , Nov. 1973.
37 Arnold, Ken, "The Jini Architecture: Dynamic Services in a Flexible Network," Sun Microsystems, Inc., Proceedings of the 36th ACM IEEE Design Automation Conference, Jun. 1999, pp. 157-162.
38 Auto-ID Center, "Auto-ID Savant Specification 1.0," Version of Oct. 13, 2003 (58 pages).
39 Bandrowski, "Stores Without Doors: Kiosks Generate New Profits," Corporate Computing, Oct. 1992, pp. 193-195.
40 Beech et al., "Object Databases as Generalizations of Relational Databases," Computer Standards & Interfaces, vol. 13, Nos. 1/3, pp. 221-230, Amsterdam, NL, Jan. 1991.
41 Begole et al., "Transparent Sharing of Java Applets: A Replicated Approach," Oct. 1997, pp. 55-65.
42 Bertino et al., "Object-Oriented Database Management Systems: Concepts and Issues," Computer, vol. 24, No. 4, pp. 33-47, Los Alamitos, CA, Apr. 1991.
43 Betz et al., "Interoperable Objects: Laying the Foundation for Distributed Object Computing," Dr. Dobb's Journal, vol. 19, No. 11, p. 18(13), Oct. 1994.
44 Bevan et al., "An Efficient Reference Counting Solution to the Distributed Garbage Collection Problem," Parallel Computing, NL, Elsevier Science Publishers, Amsterdam, vol. 9, No. 2, pp. 179-192, Jan. 1989.
45 Birrell et al., "Distributed Garbage Collection for Network Objects," Digital Systems Research Center, No. 116, pp. 1-18, Dec. 15, 1993.
46 Birrell et al., "Grapevine: An Exercise in Distributed Computing," Communications of the ACM, vol. 25, No. 4, pp. 260-274, Apr. 1982.
47 Birrell et al., "Implementing Remote Procedure Calls," ACM Transactions on Computer Systems, vol. 2, No. 1, pp. 39-59, Feb. 1984.
48 Birrell et al., "Network Objects," DEC SRC Research Report 115, Feb. 28, 1994.
49 Birrell et al., "Network Objects," Operating Systems Review, 27(5), pp. 217-230, Dec. 1993.
50 Black et al., "A Language for Distributed Programming," Department of Computer Science, University of Washington, Technical Report 86-02-03, Feb. 1986, p. 10.
51 Black et al., "Distribution and Abstract Types in Emerald," University of Washington, Technical Report No. 85-08-05, Aug. 1985, pp. 1-10.
52 Black et al., "Object Structure in the Emerald System," University of Washington, Technical Report 86-04-03, Apr. 1986, pp. 1-14.
53 Black et al., "The Eden Project: A Final Report," Department of Computer Science, University of Washington, Technical Report 86-11-01, Nov. 1986, pp. 1-28.
54 Black, "Supporting Distributed Applications: Experience with Eden," Department of Computer Science, University of Washington, Technical Report 85-03-02, Mar. 1985, pp. 1-21.
55 Black, "The Eden Programming Language," Department of Computer Science, FR-35, University of Washington, Technical Report 85-09-01, Sep. 1985 (Revised Dec. 1985), pp. 1-19.
56 Black, "The Eden Project: Overview and Experiences," Department of Computer Science, University of Washington, EUUG, Autumn '86 Conference Proceedings, Manchester, UK, Sep. 22-25, 1986, pp. 177-189.
57 Braine et al., "Object-Flow," 1997, pp. 418-419.
58 Bruno, "Working the Web," Data Communications, Apr. 1997, pp. 50-60.
59 Burns et al., "An Analytical Study of Opportunistic Lease Renewal," Distributed Computing Systems, 21st International Conference, pp. 146-153, Apr. 2000.
60 Cannon et al., "Adding Fault-Tolerant Transaction Processing to LINDA," Software-Practice and Experience, vol. 24(5), pp. 449-466, May 1994.
61 Cardelli, "Obliq, A Lightweight Language For Network Objects," Digital SRC, pp. 1-37, Nov. 5, 1993.
62 Carriero et al., "Distributed Data Structures in Linda," Principles of Programming Language, pp. 1-16,1986.
63 Carriero et al., "Distributed Data Structures in Linda," Yale Research Report YALEU/DCS/RR-438, Nov. 1985.
64 Chung et al., "A ‘Tiny’ Pascal Compiler: Part 1: The P-Code Interpreter," BYTE Publications, Inc., Sep. 1978.
65 Chung et al., "A ‘Tiny’ Pascal Compiler: Part 2: The P-Compiler," BYTE Publications, Inc., Oct. 1978.
66 Chung et al., "A 'Tiny' Pascal Compiler: Part 1: The P-Code Interpreter," BYTE Publications, Inc., Sep. 1978.
67 Chung et al., "A 'Tiny' Pascal Compiler: Part 2: The P-Compiler," BYTE Publications, Inc., Oct. 1978.
68 Ciancarini et al., "Coordinating Distributed Applets with Shade/Java," Feb. 1998, pp. 130-138.
69 Cohen, "Electronic Commerce," C/Information Sciences Institute, Oct. 1989.
70 Conhaim, "Online shopping: a beginner's guide; includes related listing of videotex services," Link-Up, vol. 5, No. 6, p. 32, Nov. 1988.
71 Coulouris et al., "Distributed Systems Concepts and Designs," Second Edition, Addison-Wesley, 1994.
72 Dave et al., "Proxies, Application Interface, And Distributed Systems," Proceedings International Workshop on Object Orientation in Operating Systems, pp. 212-220, Sep. 24, 1992.
73 Delcambre et al., "Simulation of the Object Flow Model: A Conceptual Modeling Language for Object-Driven Applications," 1993, pp. 216-225.
74 Design Project #2, Electronic Shopping at MIT, MIT Class 6.033 Handout 23, Massachusetts Institute of Technology, http://web.mit.edu/6.033/1995/handouts/html/h23.html, Spring 1995, pp. 1-6.
75 Deux et al., "The O2 System," Communications Of The Association For Computing Machinery, vol. 34, No. pp. 34-48, Oct. 1, 1991.
76 Dijkstra, "Self-stabilizing Systems in Spite of Distributed Control," Communications of the ACM, vol. 17, No. pp. 643-644, Nov. 1974.
77 Dolev et al., "On the Minimal Synchronism Needed for Distributed Consensus," Journal of the ACM, vol. 34, No. 1, pp. 77-97, Jan. 1987.
78 Dollimore et al., "The Design of a System for Distributing Shared Objects," The Computer Journal, No. 6, Cambridge, GB, Dec. 1991.
79 Dourish, "A Divergence-Based Model of Synchrony and Distribution in Collaborative Systems," Xerox Technical Report EPC-1194-102, pp. 1-10, 1994.
80 Drexler et al., "Incentive Engineering for Computational Resource Management," The Ecology of Computation, Elsevier Science Publishers B.V., pp. 231-266, 1988.
81 Droms, "RFC 1541 Dynamic Host Configuration Protocol," , pp. 1-33, Oct. 1993.
82 Droms, "RFC 1541 Dynamic Host Configuration Protocol," <http://www.cis.ohio-state.edu/htbin/rfc/rfc1541.html>, pp. 1-33, Oct. 1993.
83 Ellsworth, "Boom Town," Internet World, Jun. 1995, pp. 33-35.
84 Emms, "A Definition Of An Access Control Systems Language," Computer Standards And Interfaces, vol. 6, No. 4, pp. 443-454, Jan. 1, 1987.
85 Estrin, "Inter-Organization Networks: Implications of Access Control Requirements for Interconnection Protocols," ACM, 1986, pp. 254-263.
86 Fleisch et al., "High Performance Distributed Objects Using Distributed Shared Memory & Remote Method Invocation," System Sciences, 1998, Proceedings of the 31st Hawaii Internat'l Conference, Jan. 6-9, 1998, pp. 574-578.
87 Fleischer, "SkyMall's ‘Supplier Network’ Takes Flight", Retailtech, The Technology Magazine for Retail Executives, Apr. 1997.
88 Fleischer, "SkyMall's 'Supplier Network' Takes Flight", Retailtech, The Technology Magazine for Retail Executives, Apr. 1997.
89 Foley, "Managing Camp -Wide Information Systems: Issues and Problems," Capitalizing on Communication, ACM SIGUCCS XVII, 1989, pp. 169-174.
90 Fryxell, "eaasySABRE," Link-Up, May/Jun. 1996, pp. 10-11.
91 Gardner, "Kodak Follows Startup Into Online Photo Processing Business," Internet World, Sep. 8, 1997, pp. 5-6.
92 Gelernter et al., "Parallel Programming in Linda," Yale University, pp. 1-21, Jan. 1985.
93 Gelernter, "Generative Communication in Linda," ACM Transactions on Programming Languages and Systems, vol. 7, No. 1, pp. 80-112, Jan. 1985.
94 Gogan et al., "Open Market, Inc.: Managing in a Turbulent Environment," Harvard Business School Publishing, Aug. 29, 1996, pp. 1-30.
95 Goldberg et al., "Smalltalk-80-The Language and its Implementation," Xerox Palo Alto Research Center, 1983 (reprinted with corrections, Jul. 1985), pp. 1-720.
96 Goldberg et al., "Smalltalk-80—The Language and its Implementation," Xerox Palo Alto Research Center, 1983 (reprinted with corrections, Jul. 1985), pp. 1-720.
97 Gosling et al., "The Java(TM) Language Specification," Addison-Wesley, 1996.
98 Gosling et al., "The Java™ Language Specification," Addison-Wesley, 1996.
99 Gottlob et al., "Extending Object-Oriented Systems with Roles," ACM Transactions On Information Systems, vol. 14, No. 3, pp. 268-296, Jul. 1996.
100 Gray et al., "Leases: An Efficient Fault-Tolerant Mechanism for Distributed File Cache Consistency," ACM, pp. 202-210, 1989.
101 Gray et al., "Leases: An Efficient Fault-Tolerant Mechanism for Distributed File Cache Consistency," Proceedings of the 12th ACM Symposium on Operating Systems Principles, pp. 202-210, 1989.
102 Guth, "JavaOne: Sun to Expand Java Distributed Computing Effort," , XP-002109935, p. 1, Feb. 20, 1998.
103 Guth, "JavaOne: Sun to Expand Java Distributed Computing Effort," <http://www.sunworld.com/swol-02-1998/swol-02-sunspots.html>, XP-002109935, p. 1, Feb. 20, 1998.
104 Guyennet et al., "A New Consistency Protocol Implemented in the CAliF System," IEEE, 1094-7256/97, pp. 82-87, 1997.
105 Guyennet et al., "Distributed Shared Memory Layer for Cooperative Work Applications," IEEE, 0742-1303/97, pp. 72-78, 1997.
106 Hamilton et al., "Subcontract: A Flexible Base For Distributed Programming," Proceedings of 14th Symposium of Operating System Principles, Dec. 1993.
107 Hamilton, "Java and the Shift to Net-Centric Computing," Computer, pp. 31-39, Aug. 1996.
108 Harris et al., "Proposal for a General Java Proxy Class for Distributed Systems and Other Uses," Netscape Communications Corp., Jun. 25, 1997.
109 Hartman et al., "Liquid Software: A New Paradigm for Networked Systems," Technical Report 96-11, Department of Comp. Sci., Univ. of Arizona, Jun. 1996.
110 Hodges, Douglas, "Managing Object Lifetimes in OLE," Aug. 25, 1994, pp. 1-41.
111 Holman et al., "The Eden Shared Calendar System," Department of Computer Science, FR-35, University of Washington, Technical Report 85-05-02, Jun. 22, 1985, pp. 1-14.
112 Hoshi et al., "Allocation of the Cross-Connect Function in Leased Circuit Networks," 1992, ICC'92, conference record, SUPERCOMM/ICC '92, A New World of Communications, IEEE International Conference, pp. 1408-1412.
113 Howard et al., "Scale and Performance in a Distributed File System," ACM Transactions on Computer Systems, vol. 6, No. 1, pp. 51-81, Feb. 1988.
114 Hsu, "Reimplementing Remote Procedure Calls," University of Washington, Thesis, Mar. 22, 1985, pp. 1-106.
115 Hunt, "IDF: A Graphical Data Flow Programming Language for Image Processing and Computer Vision," Proceedings of the International Conference on Systems, Man, and Cybernetics, pp. 351-360, Los Angeles, Nov. 4-7, 1990.
116 Hutchinson, "Emerald: An Object-Based Language for Distributed Programming," a Dissertation, University of Washington, 1987, pp. 1-107.
117 IBM(TM) Technical Disclosure Bulletin, "Change Notification Service for Shared Files," Aug. 1993, vol. 36, pp. 77-82.
118 IBM(TM) Technical Disclosure Bulletin, "Local Network Monitoring to Populate Access Agent Directory," vol. 36, No. 09A, pp. 403-405, Sep. 1993.
119 IBM(TM) Technical Disclosure Bulletin, "Object Location Algorithm," vol. 36, No. 09B, pp. 257-258, Sep. 1993.
120 IBM(TM) Technical Disclosure Bulletin, "Retrieval of Qualified Variables Using Extendible Hashing," vol. 36, No. 12, pp. 301-303, Dec. 1993.
121 IBM, "Chapter 6—Distributed SOM (DSOM)," SOMobjects Developer Toolkit Users Guide, Version 2.1, pp. 6-1-6-90, Oct. 1994.
122 IBM™ Technical Disclosure Bulletin, "Change Notification Service for Shared Files," Aug. 1993, vol. 36, pp. 77-82.
123 IBM™ Technical Disclosure Bulletin, "Local Network Monitoring to Populate Access Agent Directory," vol. 36, No. 09A, pp. 403-405, Sep. 1993.
124 IBM™ Technical Disclosure Bulletin, "Object Location Algorithm," vol. 36, No. 09B, pp. 257-258, Sep. 1993.
125 IBM™ Technical Disclosure Bulletin, "Retrieval of Qualified Variables Using Extendible Hashing," vol. 36, No. 12, pp. 301-303, Dec. 1993.
126 Israel et al., "Authentication in Office System Internetworks," ACM Transactions on Office Information Systems, vol. 1, No. 3, Jul. 1983, pp. 193-210.
127 Jacob, "The Use of Distributed Objects and Dynamic Interfaces in a Wide-Area Transaction Environment," SIGCOMMn '95 Workshop on Middleware: Cambridge, Mass., Aug. 1995, pp. 1-3.
128 Java Remote Method Invocation Specification, JDK 1.1 FCS, Sun Microsystems, Inc. Feb. 1997, chapters 5 and 7 (96 pages).
129 Jaworski, "Java 1.1 Developer's Guide, 2nd Edition," Sams.net, 1997.
130 Jennings, N.R. et al., "Using Intelligent Agents to Manage Business Processes," Dept. Electronic Engineering, Queen Mary & Westfield College, Mile End Road, London, E1 4NS, U.K., XP-002254546, 1996 (16 pages).
131 Jones et al., "Garbage Collection: Algorithms for Automatic Dynamic Memory Management," pp. 165-175, John Wiley & Sons, 1996.
132 Jul et al., "Fine-Grained Mobility in the Emerald System," University of Washington, ACM Transactions on Computer Systems, vol. 6, No. 1, Feb. 1988, pp. 109-133.
133 Jul, "Object Mobility in a Distributed Object-Oriented System," a Dissertation, University of Washington, 1989, pp. 1-154 (1 page Vita).
134 Kambhatla et al., "Recovery with Limited Replay: Fault-Tolerant Processes in Linda," Oregon Graduate Institute, Technical Report CSIE 90-019, pp. 1-16, Sep. 1990.
135 Kay et al., "An Overview of the Raleigh Object-Oriented Database System," ICL Technical Journal, vol. 7, No. 4, pp. 780-798, Oxford, GB, Nov. 1991.
136 Keller, "Smart Catalogs and Virtual Catalogs," Proceedings of the First USENIX Workshop of Electronic Commerce, USENIX Association, Jul. 11-12, 1995, pp. 125-131.
137 Klein et al., "TRADE'ex: The Stock Exchange of the Computer Industry," Harvard Business School Publishing, 1996, pp. 1-14.
138 Kodak Photonet FAQ, PhotoNet Online, Jun. 14, 2002, pp. 1-3.
139 Kolodner et al., "Atomic Garbage Collection: Managing a Stable Heap," ACM, 1989, pp. 15-25.
140 Koshizuka et al., "Window Real-Objects: A Distributed Shared Memory for Distributed Implementation of GUI Applications," Nov. 1993, pp. 237-247.
141 Kougiouris et al., "Support for Space Efficient Object Invocation in Spring," Sep. 1994.
142 Kramer, "NETWATCH; The AJC's Daily Online Guide; Get the picture: Kodak will send photos to Web," The Atlanta Journal and Constitution, Sec. Features, p. 08C, Jun. 5, 1997.
143 Krasner et al., "Smalltalk-80: Bits of History, Words of Advice," 1983, Xerox Corporation, pp. 1-344.
144 Krasner, "The Smalltalk-80 Virtual Machine," BYTE Publications Inc., pp. 300-320, Aug. 1991.
145 Lamport et al., "The Byzantine Generals Problem," ACM Transactions on Programming Languages and Systems, vol. 4, No. 3, pp. 382-401, Jul. 1982.
146 Lampson et al., "Authentication in Distributed Systems: Theory and Practice," ACM Transactions n Computer Systems, vol. 10, No. 4, Nov. 1992, pp. 265-310.
147 Lansky, "Without APS, Photo Life Goes on Via Internet," Photographic Trade News, Aug. 1996, pp. 19-23.
148 Lavana et al., "Executable Workflows: A Paradigm for Collaborative Design on the Internet," Jun. 1997, 6 pages.
149 Lemay, Laura, et al. "Teach Yourself Java in 21 Days, Professional Reference Edition", 1996, SAMS.NET Publishing.
150 Lewis, "Pacific Bell, MCI to Expand Internet Service," The New York Times, sec. D, col. 1 at 3, Mar. 28, 1995.
151 Li, Sing et al., "Professional Jini", Chapter 7, Aug. 2000.
152 LightSurf Instant Imaging—Press Releases, "Kodak and LightSurf Collaborate On Kodak Picture Center Online," LifeSurf Technologies Inc., Jun. 14, 2002, pp. 1-3.
153 Linda Database Search, pp. 1-68, Jul. 20, 1995.
154 Lindholm et al., "The Java™ Virtual Machine Specification," Addison Wesley, 1996.
155 Liskov et al., "Distributed Object Management in Thor," International Workshop on Distributed Object Management, p. 12, 1992.
156 Louwerse et al., "Data Protection Aspects in an Integrated Hospital Information System," North-Holland Computers & Security 3, 1984, pp. 286-294.
157 McDaniel, "An Analysis of a Mesa Instruction Set," Xerox Corporation, May 1982.
158 McEnaney, "Point-and-Click Memory Sharing; Launches PhotoNet online digital photography and imaging services, " Photographic Trade News, Sec. p. 23, Jan. 1997.
159 McGrath, "Discovery and Its Discontents: Discovery Protocols for Ubiquitous Computing," Presented at Center for Excellence in Space Data and Information Science, NASA Goddard Space Flight Center, Apr. 5, 2000.
160 Miller, "Web posting as a photo processing option," USA Today, Section: Life, p. 17D, Dec. 13, 1996.
161 Mitchell et al., "An Overview of the Spring System," Feb. 1994.
162 Mitchell et al., "Mesa Language Manual," Xerox Corporation, Palo Alto Research Center, 1978.
163 Morris et al., "Andrew: A Distributed Personal Computing Environment," Communications of the ACM, vol. 29, No. 3, Mar. 1986, pp. 184-201.
164 Mullender, "Distributed Systems," Second Edition, Addison-Wesley, 1993.
165 Mummert et al., "Long Term Distributed File Reference Tracing: Implementation and Experience," Carnegie Mellon University School of Computer Science, pp. 1-28, Nov. 1994.
166 MUX-Elektronik, Java 1.1 Interactive Course, www.lls.se/˜mux/javaic.html, 1995.
167 O'Mahony, "Security Considerations in a Network Management Environment," IEEE Network, May/Jun. 1994, pp. 12-17.
168 Oppen et al., "The Clearinghouse: A Decentralized Agent for Locating Names Objects in a Distributed Environment," ACM Transactions on Office Information Systems, vol. 1, No. 3, Jul. 1983, pp. 230-253.
169 Opyrchal et al., "Efficient Object Serialization in Java," Department of Electrical Engineering and Computer Science, University of Michigan, XP-002242373, May 31, 1999 (6 pages).
170 Orfali et al., "The Essential Distributed Objects Survival Guide," Chapter 11: Corba Commercial ORBs, pp. 203-215, John Wiley & Sons, Inc., 1996.
171 Osborn, "The Role of Polymorphism in Schema Evolution in an Object-Oriented Database," IEEE Transactions on Knowledge and Data Engineering, vol. 1, No. 3, Sep. 1989, pp. 310-317.
172 Oterhout et al., "The Sprite Network Operating System," Computer, IEEE, pp. 23-36, Feb. 1988.
173 Petersen, "New But Not Improved, " Direct Magazine, Nov. 1995.
174 Pier, "A Retrospective on the Dorando, A High-Performance Personal Computer," IEEE Conference Proceedings, The 10th Annual International Symposium on Computer Architecture, 1983.
175 Pier, "A Retrospective on the Dorando, A High-Performance Personal Computer," Xerox Corporation, Aug. 1983.
176 Pinakis, "Using Linda as the Basis of an Operating System Microkernel," University of Western Australia, Department of Computer Science, pp. 1-165, Aug. 1993.
177 Plainfosse, D., et al., "A Survey of Distributed Garbage Collection Techniques", http://citeseer.nj.nec.com/plainfosse95survey.html, Sep. 1995, pp. 1-33, XP002126410.
178 Press Release, "Sun Goes Live With The Kodak Picture Network," Sun Microsystems, Inc., Jun. 14, 2002, pp. 1-2.
179 Proceedings of the Eighth Symposium on Operating Systems Principles, Dec. 14-16, 1981, ACM, Special Interest Group: 2157on Operating Systems, Association for Computing Machinery, vol. 15, No. 5, Dec. 1981, ACM Order No. 534810.
180 Proudfoot, "Replects: Data Replication in the Eden System," Department of Computer Science, University of Washington, Technical Report No. TR-85-12-04, Dec. 1985, pp. 1-156.
181 Pu, "Replication and Nested Transaction in the Eden Distributed System," Doctoral Dissertation, University of Washington, Aug. 6, 1986, pp. 1-179 (1 page Vita).
182 Raeder, "Is there a Prodigy in your future?," Database Searcher, vol. 5, No. 6, pg. 18, Jun. 1989.
183 Ramm et al., "Exu—A System for Secure Delegation of Authority on an Insecure Network," Ninth System Administration Conference, 1995 LISA IX, Sep. 17-22, 1995, pp. 89-93.
184 Riggs et al., "Pickling State in the Java™ System," USENIX Association Conference on Object-Oriented Technologies and Systems, XP-002112719, pp. 241-250, Jun. 17-21, 1996.
185 Rosenberry et al., "Understanding DCE," Chapters 1-3, 6, 1992.
186 Sandholm et al., "Design of Object Caching in a CORBA OTM System" (Jun. 11, 1989).
187 Sandholm, "Object Caching in a Transactional, Object-Relational CORBA Environment," Dept. of Computer and Systems Sciences, University of Stockholm (Oct. 1998).
188 Satyanarayanan, "Integrating Security in a Large Distributed System," ACM Transactions on Computer Systems, vol. 7, No. 3, Aug. 1989, pp. 247-280.
189 Schroeder et al., "Experience with Grapevine: The Growth of a Distributed System," ACM Transactions on Computer Systems, vol. 2, No. 1, Feb. 1984, pp. 3-23.
190 Senn, "Capitalizing on Electronic Commerce: The Role of the Internet in Electronic Markets," Information Systems Management, Summer 1996, pp. 15-24.
191 Sharrott et al., "ObjectMap: Integrating High Performance Resources into a Distributed Object-oriented Environment," ICODP, 1995.
192 Smith, H.A. et al., "Object-Oriented Technology: Getting Beyond the Hype," ACM, Spring 1996, vol. 27, pp. 20-29.
193 Spiteri, M.D., et al., "An architecture to support storage and retrieval of events", 1998.
194 Steinke, "Design Aspects of Access Control in a Knowledge Base System," Computers & Security, 10, 1991, pp. 612-625.
195 Stern, "Industry Net," Link-Up, Mar./Apr. 1995, p. 10.
196 Stevenson, "Token-Based Consistency of Replicated Servers," IEEE, CH2686-4/89/0000/0179, pp. 179-183, 1989.
197 Stoyenko, A.D. "SUPRA-RPC: SUbprogram PaRAmeters in Remote Procedure Calls," Software-Practice and Experience, vol. 24(1), pp. 27-49, 1994. (24 pages).
198 Subramanian, Sakthi et al., "Automatic Verification of Object Code Against Source Code," IEEE, 1996, pp. 46-55. (24 pages).
199 Sun Microsystems, "Jini™ Architectural Overview," Technical White Paper (Jan. 1999).
200 Sun Microsystems, "Jini™ Discovery and Join Specification," Jini Specifications 1.0 (Jan. 25, 1999).
201 Sun Microsystems, "Jini™ Distributed Event Specification," Jini 1.0 Specifications (Jan. 25, 1999).
202 Sun Microsystems, "Jini™ Lookup Service Specification," Jini 1.0 Specifications (Jan. 25, 1999).
203 Tanenbaum et al., "Distributed Operating Systems," Computing Surveys, vol. 17, No. 4, Dec. 1985, pp. 419-470.
204 The Wall Street Journal, "Barclays Is Opening an ‘Electronic Mall’ For Internet Shopping," Tech. & Health Section at B2, Jun. 1, 1995.
205 The Wall Street Journal, "Prodigy Plans to Announce Internet ‘Electronic Mail’," Tech. Section at B5, Nov. 27, 1995.
206 Thompson, "Regular Expression Search Algorithm," Communications of the ACM, vol. II, No. 6, p. 149 et seq., Jun. 1968.
207 Trehan et al., "Toolkit for Shared Hypermedia on a Distributed Object Oriented Architecture," 1993, pp. 1-8.
208 Trommer, "Thomas Unveils Online Purchasing Network—Eases Product Sourcing And Ordering Through EDI," Electronic Buyers' News at 60, Dec. 11, 1995.
209 Van Den Berg et al., "Advanced Topics of a Computer Center Audit," North-Holland Computers & Security 3, 1984, pp. 171-185.
210 Van Der Lans, "Data Security in a Relational Database Environment," North-Holland Computers & Security 5, 1986, pp. 128-134.
211 Venners, "Jini Technology, Out of the Box," JAVAWORLD, ′Online!, pp. 1-4, Dec. 1998.
212 Waldo et al., "Events in an RPC Based Distributed System," Proceedings Of The 1995 ENIX Technical Conference, Proceedings USENIX Winter 1995 Technical Conference, New Orleans, LA, A, 16-20, pp. 131-142, Jan. 1995.
213 Welz, "New Deals: a ripening Internet market, secure systems and digital currency are reshaping global commerce," Internet World, Jun. 1995, pp. 36-41.
214 Wilson et al., "Design of the Opportunistic Garbage Collector," Proceedings of the Object Oriented Programming Systems Languages and Applications Conference, New Orleans, vol. 24, No. 10, Oct. 1989.
215 Wobber et al., "Authentication in the Taos Operating System," ACM, 1993, pp. 256-269.
216 Wollrath et al., "A Distributed Object Model for the Java™ System," USENIX Association, Conference on Object-Oriented Technologies and Systems, Jun. 17-21, 1996.
217 Wollrath, A., et al., "Simple Activation for Distributed Objects," USENIX Association, Conference on Object-Oriented Technologies (COOTS), Jun. 26-29, 1995. (11 pages).
218 Wu, "A Type System For An Object-Oriented Database System," Proceedings of the International Computer Software and Applications Conference (COMPSAC), Tokyo, Japan, pp. 333-338, Sep. 11-13, 1991.
219 Wyatt, "Netscape Enterprise Server," Prima Publishing, 1996.
220 Yemini et al., "Towards Programmable Networks," IFIP/IEEE International Workshop on Distributed Systems: Operations and Management, L'Aquila, Italy, Oct. 1996.
221 Yin et al., "Using Leases to Support Server Driven Consistency in Large-Scale Systems," Computer Services Department, University of Texas at A tin, p. 285-294, May 26-28, 1998.
222 Yin et al., "Volume Leases for Consistency in Large-Scale Systems," IEEE Transactions on Knowledge & Data Engineering, vol. 11, No. 4, pp. 563-576, Jul./Aug. 1999.
US7970722 9 nov. 2009 28 jun. 2011 Aloft Media, Llc System, method and computer program product for a collaborative decision platform
US8005777 27 jul. 2010 23 ago. 2011 Aloft Media, Llc System, method and computer program product for a collaborative decision platform
US8160988 27 jul. 2010 17 abr. 2012 Aloft Media, Llc System, method and computer program product for a collaborative decision platform
US9792166 * 4 nov. 2011 17 out. 2017 Open Invention Network, Llc System and method for managing an object cache
US20120047521 * 10 dez. 2010 23 fev. 2012 Hon Hai Precision Industry Co., Ltd. Electronic device and data collection method of the electronic device
US20130117405 * 4 nov. 2011 9 maio 2013 Recursion Software, Inc. System and method for managing an object cache
CN102375755A * 17 ago. 2010 14 mar. 2012 鸿富锦精密工业（深圳）有限公司 Data model object deletion identification device and use method thereof
Classificação nos Estados Unidos 709/223, 709/217, 709/203
Classificação internacional G06F21/54, G06F9/46, G06F17/30, H04L29/06, H04L12/28, H04L29/08, G06F9/445, G06F15/173, G06F12/02, H04L12/417, G06F9/50
Classificação cooperativa H04L67/2842, H04L69/329, H04L67/16, H04L69/24, H04L67/40, H04L67/10, H04L67/26, H04L67/42, H04L67/2804, G06F9/52, G06F9/547, H04L12/2809, G06F9/542, H04L12/417, H04L12/40169, H04L12/2805, H04L12/403, H04L12/40032, G06F9/548, H04L12/2803, G06F12/0261, G06F9/505, G06F21/54, H04L29/06, G06F9/5055, H04L12/2807, G06F9/465, G06F17/30607, G06F2209/462, G06F2209/5015
Classificação europeia G06F9/54P1, G06F9/54P, G06F21/54, G06F9/52, G06F9/54B, H04L12/403, H04L12/28H, H04L12/417, G06F9/50A6L, H04L12/28H2A, H04L12/28H2, H04L12/40A4, H04L12/40R, H04L29/08N27A, H04L12/28H1, H04L29/08N15, H04L29/06C8, H04L29/08N25, G06F9/50A6S, G06F17/30S8T, H04L29/08N9, H04L29/06, G06F9/46M, G06F12/02D2G2, H04L29/08N27S
20 jul. 2010 CC Certificate of correction
12 jul. 2011 CC Certificate of correction
17 jan. 2014 REMI Maintenance fee reminder mailed
8 jun. 2014 LAPS Lapse for failure to pay maintenance fees
29 jul. 2014 FP Expired due to failure to pay maintenance fee