US 6,832,223 B1Grant
Method and system for facilitating access to a lookup service
Issue Date:2004-12-14
•27 Claims
•9 Drawing Sheets
Abstract
Methods and systems are provided that facilitate access to a service via a lookup service. A lookup service defines a network's directory of services and stores references to these services. A client desiring use of a service on the network accesses the lookup service, which returns the stub information that facilitates the user's access of the service. The client uses the stub information to access the service.
Metadata
Assignee
- Sun Microsystems, Inc.
Inventors
- Robert W. Scheifler
- Ann M. Wollrath
- James H. Waldo
Application Information
Application Number:US 09/044,826
Filing Date:1998-03-20
Priority Date:1996-04-23
Art Unit:7
Classifications
IPC:
G06F 1700
Field of Search:
709234
Patent Drawings (9 sheets)
Description
RELATED APPLICATIONS
[0002] This application is a Continuation-In-Part of U.S. patent application Ser. No. 08/636,706 filed on Apr. 23, 1996, which is incorporated herein by reference.
[0003] The following applications are relied upon and are hereby incorporated by reference in this application.
[0004] Provisional U.S. Patent Application No. 60/078,048, entitled “Distributed Computing System,” filed on Feb. 26, 1998.
[0005] U.S. patent application Ser. No. 09/044,923, entitled “Method and System for Leasing Storage,” and filed on the same date herewith.
[0006] U.S. patent application Ser. No. 09/044,838, entitled “Method, Apparatus, and Product for Leasing of Delegation Certificates in a Distributed System,” and filed on the same date herewith. U.S. patent application Ser. No. 09/044,834, entitled “Method, Apparatus and Product for Leasing of Group Membership in a Distributed System,” and filed on the same date herewith.
[0007] U.S. patent application Ser. No. 09/044,916, entitled “Leasing for Failure Detection,” and filed on the same date herewith.
[0008] U.S. patent application Ser. No. 09/044,933, entitled “Method for Transporting Behavior in Event Based System,” and filed on the same date herewith.
[0009] U.S. patent application Ser. No. 09/044,919, entitled “Deferred Reconstruction of Objects and Remote Loading for Event Notification in a Distributed System,” and filed on the same date herewith.
[0010] U.S. patent application Ser. No. 09/044,938, entitled “Methods and Apparatus for Remote Method Invocation,” and filed on the same date herewith.
[0011] U.S. patent application Ser. No. 90/045,652, entitled “Method and System for Deterministic Hashes to Identify Remote Methods,” and filed on the same date herewith.
[0012] U.S. patent application Ser. No. 09/044,790, entitled “Method and Apparatus for Determining Status of Remote Objects in a Distributed System,” and filed on the same date herewith.
[0013] U.S. patent application Ser. No. 09/044,930, entitled “Downloadable Smart Proxies for Performing Processing Associated with a Remote Procedure Call in a Distributed System,” and filed on the same date herewith.
[0014] U.S. patent application Ser. No. 09/044,917, entitled “Suspension and Continuation of Remote Methods,” and filed on the same date herewith.
[0015] U.S. patent application Ser. No. 09/044,835, entitled “Method and System for Multi-Entry and Multi-Template Matching in a Database,” and filed on the same date herewith.
[0016] U.S. patent application Ser. No. 09/044,839, entitled “Method and System for In-Place Modifications in a Database,” and filed on the same date herewith.
[0017] U.S. patent application Ser. No. 09/044,945, entitled “Method and System for Typesafe Attribute Matching in a Database,” and filed on the same date herewith.
[0018] U.S. patent application Ser. No. 09/044,931, entitled “Dynamic Lookup Service in a Distributed System,” and filed on the same date herewith.
[0019] U.S. patent application Ser. No. 09/044,939, entitled “Apparatus and Method for Providing Downloadable Code for Use in Communicating with a Device in a Distributed System,” and filed on the same date herewith.
[0020] U.S. patent application Ser. No. 09/044,932, entitled “Apparatus and Method for Dynamically Verifying Information in a Distributed System,” and filed on the same date herewith.
[0021] U.S. patent application Ser. No. 09/030,840, entitled “Method and Apparatus for Dynamic Distributed Computing Over a Network,” and filed on Feb. 26, 1998.
[0022] U.S. patent application Ser. No. 09/044,936, entitled “An Interactive Design Tool for Persistent Shared Memory Spaces,” and filed on the same date herewith.
[0023] U.S. patent application Ser. No. 09/044,934, entitled “Polymorphic Token-Based Control,” and filed on the same date herewith.
[0024] U.S. patent application Ser. No. 09/044,915, entitled “Stack-Based Access Control,” and filed on the same date herewith.
[0025] U.S. patent application Ser. No. 09/044,944, entitled “Stack-Based Security Requirements,” and filed on the same date herewith.
[0026] U.S. patent application Ser. No. 09/044,837, entitled “Per-Method Designation of Security Requirements,” and filed on the same date herewith.
FIELD OF THE INVENTION
[0027] The present invention relates generally to data processing systems and, more particularly, to a method and system for facilitating access to a lookup service.
BACKGROUND OF THE INVENTION
[0028] In modern “enterprise” computing, a number of personal computers, workstations, and other devices such as mass storage subsystems, network printers and interfaces to the public telephony system, are typically interconnected in one or more computer networks. The personal computers and workstations are used by individual users to perform processing in connection with data and programs that may be stored in the network mass storage subsystems. In such an arrangement, the personal computers/workstations, operating as clients, typically download the data and programs from the network mass storage subsystems for processing. In addition, the personal computers or workstations will enable processed data to be uploaded to the network mass storage subsystems for storage, to a network printer for printing, to the telephony interface for transmission over the public telephony system, or the like. In such an arrangement, the network mass storage subsystems, network printers and telephony interface operate as servers, since they are available to service requests from all of the clients in the network. By organizing the network in such a manner, the servers are readily available for use by all of the personal computers/workstations in the network. Such a network may be spread over a fairly wide area, with the personal computers/workstations being interconnected by communication links such as electrical wires or optic fibers.
[0029] In addition to downloading information from servers for processing, a client, while processing a program, can remotely initiate processing by a server computer of particular routines and procedures (generally “procedures”), in connection with certain “parameter” information provided by the client. After the server has processed the procedure, it will provide results of its processing to the client, which the client may thereafter use in its processing operations. Typically in such “remote procedure calls” the program will make use of a local “stub” which, when called, transfers the request to the server which implements the particular procedure, receives the results and provides them to the program. Conventionally, the stub must be compiled with the program, in which case the information needed to call the remote procedure must be determined at compile time, rather than at the time the program is run. Since the stub available to the client's programs is static, it may be at best the closest that can be determined should be provided for the program when it (the program) is compiled. Accordingly, errors and inefficiencies can develop due to mismatches between the stub that is provided to a program and the requirements of the remote procedure that is called when the program is run.
SUMMARY OF THE INVENTION
[0030] A new and improved system and method for facilitating the obtaining and dynamic loading of a stub is provided to enable a program operating in one address space to remotely invoke processing of a method or procedure in another address space, so that the stub can be loaded by the program when it is run and needed, rather than being statically determined when the program is compiled. Indeed, the stub that is loaded can be obtained from the resource providing the remote method or procedure, and so it (the stub) can exactly define the invocation requirements of the remote method or procedure. Since the stub can be located and dynamically loaded while the program is being run, rather that being statically determined when the program is compiled, run-time errors and inefficiencies which may result from mis-matches between the stub that is provided and the requirements of the remote method or procedure that is invoked can be minimized. In an alternative embodiment of the present invention, the stub is obtained from a lookup service to provide access to a service defined in the lookup service.
[0031] In brief summary, methods and systems consistent with an alternative embodiment of the present invention facilitate access to a service via a lookup service. A lookup service defines a network's directory of services and stores references to these services. A client desiring use of a service on the network accesses the lookup service, which returns the stub information that facilitates the user's access of the service. The client uses the stub information to access the service.
BRIEF DESCRIPTION OF THE DRAWINGS
[0032] This invention is pointed out with particularity in the appended claims. The above and further advantages of this invention may be better understood by referring to the following description taken in conjunction with the accompanying drawings, in which:
[0033] FIG. 1 is a function block diagram of a computer network including an arrangement constructed in accordance with the present invention for facilitating the obtaining, dynamic loading and use 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;
[0034] FIGS. 2 and 3 are flow charts depicting the operations performed by the arrangement depicted in FIG. 1, with FIG. 2 depicting operations performed in connection with obtaining and dynamic loading of the stub information and FIG. 3 depicting operations performed in connection with use of the stub information to invoke processing of the remote method or procedure.
[0035] FIG. 4 is a diagram illustrating a lookup service consistent with the present invention;
[0036] FIG. 5 is a flowchart illustrating a method of adding a stub to the lookup service consistent with the present invention.
[0037] FIG. 6 is a flowchart illustrating a method for retrieving a stub from a lookup service by systems consistent with the present invention.
DETAILED DESCRIPTION OF AN ILLUSTRATIVE EMBODIMENT
[0038] FIG. 1 is a schematic diagram of a computer network 10 including an arrangement for facilitating dynamic loading of “stub” information to enable a program operating in one address space to remotely invoke processing of a method or procedure in another address space, where this method or procedure represents a network service. With reference to FIG. 1, computer network 10 includes a plurality of client computers 11(1) through 11(N) (generally identified by reference numeral 11(n)), a plurality of server computers 12(1) through 12(M) (generally identified by reference numeral 12(m)), all of which are interconnected by a network represented by a communication link 14. In addition, the network 10 may include at least one nameserver computer 13, which may also be connected to communication link 14, whose purpose will be described below. As is conventional, at least some of the client computers 11(n) are in the form of personal computers or computer workstations, each of which typically includes a system unit, a video display unit and operator input devices such as a keyboard and mouse (all of which are not separately shown). The server computers 12(m) and nameserver computer 13 also typically include a system unit (also not separately shown), and may also include a video display unit and operator input devices.
[0039] The client computers 11(n), server computers 12(m) and nameserver computer 13 are all of the conventional stored-program computer architecture. A system unit generally includes processing, memory, mass storage devices such as disk and/or tape storage elements and other elements (not separately shown), including network interface devices 15(n), 16(m) for interfacing the respective computer to the communication link 14. The video display unit permits the computer to display processed data and processing status to the operator, and an operator input device enables the operator to input data and control processing by the computer. The computers 11(n) and 12(m) and 13 transfer information, in the form of messages, through their respective network interface devices 15(n), 16(m) among each other over the communication link 14.
[0040] In one embodiment, the network 10 is organized in a “client-server” configuration, in which one or more computers, shown in FIG. 1 as computers 12(m), operate as servers, and the other computers, shown in FIG. 1 as computers 11(n) operate as clients. In one aspect, one or more of the server computers 12(m) may, as “file servers,” include large-capacity mass storage devices which can store copies of programs and data which are available for retrieval by the client computers over the communication link 14 for use in their processing operations. From time to time, a client computer 11(n) may also store data on the server computer 12, which may be later retrieved by it (the client computer that stored the data) or other client computers for use in their processing operations. In addition, one or more of the server computers 12(m) may, as “compute servers,” perform certain processing operations in response to a remote request therefor from a client computer 11(n), and return the results of the processing to the requesting client computer 11(n) for use by them (that is, the requesting client computers 11(n)) in their subsequent processing. In either case, the server computers may be generally similar to the client computers 11(n), including a system unit, video display unit and operator input devices and may be usable by an operator for data processing operations in a manner similar to a client computer. Alternatively, at least some of the server computers may include only processing, memory, mass storage and network interface elements for receiving and processing retrieval, storage or remote processing requests from the client computers, and generating responses thereto. It will be appreciated a client computer 11(n) may also perform operations described herein as being performed by a server computer 12(m), and similarly a server computer 12(m) may also perform operations described herein as being performed by a client computer 11(n).
[0041] The network represented by communication link 14 may comprise any of a number of types of networks over which client computers 11(n), server computers 12(m) and nameserver computers 13 may communicate, including, for example, local area networks (LANs) and wide area networks (WANs) which are typically maintained within individual enterprises, the public telephony system, the Internet, and other networks, which may transfer digital data among the various computers. The network may be implemented using any of a number of communication media, including, for example, wires, optical fibers, radio links, and/or other media for carrying signals representing information among the various computers depicted in FIG. 1. As noted above, each of the computers typically includes a network interface which connects the respective computer to the communications link 14 and allows it to transmit and receive information thereover.
[0042] Systems consistent with the present invention facilitate the obtaining and 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, which may be located on the same computer as the invoking program or on a different computer. Reference will be made to programs provided in the Java™ programming language, as described in James Gosling, Bill Joy, Guy Steele, “The Java™ Language Specification”, Addison-Wesley, 1996, (hereinafter referred to as the “Java language specification”), incorporated herein by reference, which are processed in connection with an execution environment which is provided by a Java virtual machine. The Java virtual machine, in turn, is specified in the Lindholm and Yellin, “The Java Virtual Machine Specification”, Addison-Wesley, 1996, incorporated herein by reference. As described in the Java language specification, programs in the Java programming language define “classes” and “interfaces.” Classes are used to define one or more methods or procedures, each of which may be invoked by reference to an interface. A class may be associated with and extend a “super-class,” and in that regard will incorporate all of the interfaces and methods of the super-class, and may also include additional interfaces and/or methods. A class may also have one or more sub-classes (and thus will comprise a super-class of each of its sub-classes), with each sub-class incorporating and possibly extending their respective super-classes.
[0043] An interface provides a mechanism by which a set of methods may be declared. In that connection, an interface identifies each method that is declared by the interface by, for example, a name, identities the data type(s) of argument(s) that are to be provided for the method, the data type(s) of return values that are to be returned by the method, and identifiers for exceptions which can be thrown during processing of the method. A class may indicate that it implements a particular interface, and in that connection will include the program code which will be used in processing all of the methods which are declared in the interface. In addition, different classes may indicate that they implement the same interface, and each will have program code which will be used in processing all of the methods which are declared in the interface, but the program code provided in each class for use in processing the methods may differ from the program code provided in the other classes which is used in processing the same methods; thus, an interface provides a mechanism by which a set of methods can be declared without providing an indication of the procedure which will be used in processing any of the methods. An interface may be declared independently of the particular class which implements the method or methods which can be invoked using the interface. In that regard, a class that invokes the method and a class that actually implements the method will not need to share a common super-class.
[0044] During processing of a Java program, as described in the Java virtual machine specification, a client computer 11(n) provides an execution environment 20 for interpreting the Java program. The Java virtual machine includes a class loader 21 that, under control of a control module 19, can dynamically link instances of classes, generally identified in FIG. 1 by reference numeral 22, into the running program's execution environment while the program is being executed. In that operation, the control module 19 effectively enables the class loader to retrieve uninstantiated classes, which generally identified by reference numeral 23, instantiate them and link them as class instances 22 into the execution environment's address space at the Java program's run time as the methods which the respective classes 23 implement are called. In addition, the class loader 21 can discard ones of the class instances 22 when they are not needed or to conserve memory. It will be appreciated that, if a class instance 22 has been discarded, it may be reloaded by the class loader 21 at a later point if it is then needed.
[0045] Systems consistent with the present invention provide an arrangement which facilitates the remote invocation, by a program executing in an execution environment 20 by a client computer 11(n), of methods implemented by classes on a server computer 12(m). In executing a method, the server computer 12(m) will also provide an execution environment 24 for processing, under control of a control module 28, the Java method. In that operation, the Java virtual machine which provides the execution environment 24 includes a class loader 25 (which may be similar to the class loader 21) that, under control of the control module 28, can dynamically link an instance of the class 26, to enable the method to be processed in the execution environment 24, and instances of other classes (also generally represented by reference numeral 26) which may be needed to process the remotely-invoked method. In that operation, the control module 28 effectively enables the class loader 25 to retrieve an uninstantiated class for the method to be invoked, from a plurality of uninstantiated classes which are generally identified by reference numeral 27, instantiate it (that is, the uninstantiated class which provides the method to be invoked) and link it as a class instance 26 into the execution environment. In addition, the class loader 25 can discard the class instances 26 when processing of the method has terminated. It will be appreciated that, if class instances 26 has been discarded, it may be reloaded by the class loader 25 at a later point if it is then needed.
[0046] The structure of nameserver computer 13, if provided, is generally similar to that of the server computer 12(m), and will not be separately described.
[0047] To facilitate remote invocation of a method, the control module 19 of the client computer's execution environment 20 makes use of one or more stub class instances generally identified by reference numeral 30 which are provided as part of the execution environment 20 in which the various class instances 22, including the class instance which is invoking the remote method, are being processed. Each stub class instance 30 is an instance of an uninstantiated stub class 31, which the server computer 12(m) may maintain for the various class instances 26 and uninstantiated classes 27 which the server computer 12(m) has “exported,” that is, which the server computer 12(m) makes available to client computers 11(n) for use in remote invocation of methods provided thereby. An uninstantiated stub class 31 includes declarations for the complete set of interfaces for the particular remote uninstantiated class 27 which implements the remote method to be invoked, and also provides or invokes methods which facilitate accessing of the remote method(s) which are implemented by the remote class. The uninstantiated stub class 31, when it is instantiated and provided to the execution environment 20 of the client computer 11(n) as a stub class instance 30, effectively provides the information which is needed by the control module 19 of the execution environment 20 of the invoking Java program, so that, when a remote method that is implemented by its associated class is invoked by a Java program running in a particular execution environment, the remote method will be processed and the return value(s) provided to the invoking Java program. In one embodiment, the arrangement by which the stub class instance may be provided to the execution environment 20 is similar to that described in the aforementioned Waldo, et al., patent application.
[0048] In addition, the server computer 12(m) provides a skeleton 32, which identifies the particular classes and methods which have been exported by the server computer 12(m) and information as to how it (that is, the server computer 12(m)) may load the respective classes and initiate processing of the particular methods provided thereby. Additionally, the server computer 12(m) contains a lookup service 400 for registering services on a network. The lookup service 400 will be discussed below.
[0049] When a class instance invokes a remote method maintained by a server computer 12(m), it will provide values for various parameters to the stub class instance 30 for the remote method, which values the remote method will use in its processing. If the remote method is implemented on the same computer as the invoking Java program, when the invoking Java program invokes a remote method, the computer may establish an execution environment, similar to the execution environment 20, enable the execution environment's class loader to load and instantiate the class which implements the method as a class instance similar to class instances 22, and process the remote method using values of parameters which are provided by the invoking class instance in the remote invocation. After processing of the method has been completed, the execution environment in which the remote method has been processed will provide the results to the stub class instance 30 for the remote method that was invoked, which, in turn, will provide to the particular class instance 22 which invoked the remote method.
[0050] Similar operations will be performed if client computer 11(n) and server computer 12(m) are implemented on different physical computers. In that case, in response to a remote invocation, the client computer 11(n) that is processing the invoking class instance 22, under control of the control module 19 for the execution environment 20 for the invoking class instance 22, will use the appropriate stub class instance 30 to communicate over the network represented by the communication link 14 with the server computer 12(m) which implements the remote method to enable it (that is, the server computer 12(m)) to establish an execution environment 24 for the class which implements the remote method, and to use the class loader 25 to load an instance of the class as a class instance 26. In addition, the client computer 11(n), also using the appropriate stub class instance 30, will provide any required parameter values to the server computer 12(m) over the network 14. Thereafter, the server computer 12(m) will process the remote method using parameter values so provided, to generate result value(s) which are transferred over the network to the client computer 11(n), in particular to the appropriate stub class instance 30. The client computer 11(n) will, after it receives the result value(s) from the network, provide them to the invoking class instance 22 for its processing.
[0051] In any case, when the control module 19 of the client computer's execution environment 20 determines that a reference to the remote object has been received, if it determines that the stub class instance 30 is not present when it receives the reference, it will attempt to obtain the stub class instance 30 from, for example, the server computer 12(m) which implements the remote method, and enable the stub class instance 30 to be dynamically loaded in the execution environment 20 for the invoking class instance 22. A reference to the remote object may be received, for example, either as a return value of another remote method invocation or as a parameter that is received during another remote method invocation. The stub class instance may be dynamically loaded into the execution environment in a manner similar to that used to load class instances 22 in the execution environment 20. The execution environment 20 is provided with a stub class loader 33 which, under control of the control module 19, will attempt to find and load the stub class instances 30 as required by the class instances 22 processed in the execution environment. The location of a particular server computer 12(m) that maintains the class that implements a method to be invoked remotely may be included in the call from the invoking class instance or may be made known to the stub class loader 33 through another mechanism (not shown) maintained by the client computer 11(n).
[0052] However, if the stub class loader 33 is not otherwise notified of which server computer 12(m) maintains the class which implements a method which may be invoked remotely, it may use the nameserver computer 13 to provide that identification. The identification may comprise any identifier which may be used to identify a server computer 12(m) or other resource which is available on the network 14 and to which the server computer 12(m) can respond. Illustrative identifiers include, for example, a network address which identifies the server computer and/or resource, or, if the network 14 is or includes the Internet, an identifier to, for example, a World Wide Web resource which may provide the identification or a “uniform resource locator” (“URL”) which provides a uniform mechanism for identifying resources that are available over the Internet. The server computer 12(m) which implements the remote method, in response to a request from the client computer 11(n) will provide stub class instance 30 which the client computer 11(n) may load into the execution environment 20 to thereafter enable the remote invocation to be initiated.
[0053] As noted above, if the stub class loader 33 does not know which server computer 12(m) implements the remote method which may be invoked (and thus does not know which computer is to provide the stub class code for the remote invocation), it may, under control of the control module 19, obtain the identification from the nameserver computer 13. In that operation, the stub class loader 33 may use a previously-provided default stub class which is provided for use in such cases. The default class stub, when used by the invoking Java program, enables the computer that is processing the invoking Java program to communicate with the nameserver computer 13 to obtain information which can be used in invoking the remote method. This operation is essentially the same as the invocation of a remote method to be processed by the nameserver computer 13, with the remote method including a parameter identifying the class and method to be remotely invoked, and enabling the nameserver computer 13 to provide the identification of a server computer 12(m) which can process the method to the requesting client computer 11(n) and other information which may be helpful in communicating with the server computer 12(m) and invoking the particular method. It will be appreciated that the nameserver computer 13 will maintain a table (not separately shown) of “exported” resources, that is, resources, such as classes and methods, that are available to client computers 11(n) connected to the network 14, and information, such as the identifications of the particular server computers 12(m) which provide those resources, which will be useful to the client computers 11(n) in making use of the exported resources.
[0054] It will be appreciated that the nameserver computer 13 may create and maintain the exported resource table in a number of ways that are known in the art. For example, the nameserver computer 13 may periodically broadcast requests for exported resource information over the network 14, to which the various server computers 12(m) which maintain exported resources may respond; in that case, the nameserver computer 13 may establish its exported resource table based on the responses from the server computers 12(m). Alternatively, each of the various server computers 12(m) which maintains an exported resource may periodically broadcast information as to the exported resources which it maintains, and the nameserver computer 13 can update its exported resource table based on the broadcasts from the server computer. In addition, the nameserver computer's exported resource table may be established by a system operator and may be fixed until he or she updates it.
[0055] In any case, the information provided by the nameserver computer 13 in response to a request initiated by the default stub would include such information as, for example, the identification of a computer 12(m) which can provide a class which implements the remote method to be invoked, particular information which the computer (that is, the computer which implements the remote method) will require to provide the required stub class code, and the like. After receiving the information from the nameserver computer 13, the computer 11(n) that is processing the invoking Java program may, under control of the control module 19, use the information communicate with the computer (that is, the computer which implements the remote method) to obtain the stub class, and may thereafter invoke the method as described above.
[0056] With this background, the operations performed by client computer 11(n), server computer 12(m) and, if necessary, nameserver 13 in connection with obtaining and dynamic loading of a stub class instance when a reference to a remote method is received will be described in connection with the flow chart depicted in FIG. 2. In addition, operations performed by the client computer 11(n) and server computer in connection with remote invocation of a method using the stub class instance will be described in connection with the flow chart depicted in FIG. 3. With reference initially to FIG. 2, the execution environment control module 19 will, when it receives a reference to a remote method, will initially determine whether an appropriate stub class instance is present in the execution environment 20 to facilitate invocation of the remote method (step 100). If the control module 19 determines that such a stub class instance 30 for the remote method is present in the execution environment, it may continue other operations (step 101). However, if the control module 19 determines in step 101 that such a stub class instance is not present in the execution environment 20 for the remote method, the control module 19 will use the stub class loader 33 to attempt to locate and load a stub class instance 30 for the class to process the remote method. In that case, the control module 19 will initially determine whether the invocation from the class instance 22 included a resource locator to identify the server computer 12(m) or other resource which maintains the class for the method to be invoked, or whether it (that is, the control module 19) or the stub class loader 33 otherwise are provided with such a resource locator (step 102). If the control module 19 makes a positive determination in that step, it will sequence to step 103 to enable the stub class loader 33 to initiate communications with identified server computer 12(m) to obtain a stub class instance for the class and method to be invoked (step 103). When the stub class loader 33 receives the stub class instance 30 from the server computer 12(m), it will load the stub class instance 30 into execution environment 20 for the class instance 22 which initiated the remote method invocation call in step 100 (step 104). After the stub class instance 30 for the referenced remote method has been loaded in the execution environment, the method can be invoked as will be described below in connection with
[0057] Returning to step 102, if the control module 19 determines that the invocation from the class instance 22 did not include a resource locator to identify the server computer 12(m) or other resource which maintains the class for the method to be invoked, and further that it (that is, the control module 19) or the stub class loader 33 is not otherwise provided with such a resource locator, a “class not found” exception may be indicated, at which point the control module 19 may call an exception handler. The exception handler may perform any of a number of recovery operations, including, for example, merely notifying the control module 19 that the remote method could not be located and allow it to determine subsequent operations.
[0058] Alternatively, the control module 19 may attempt to obtain a resource locator from the nameserver computer 13 or other resource provided by the network 14 (generally represented in FIG. 1 by the nameserver computer 13), using a call, for example, a default stub class instance 30. The call to the default stub class instance 30 will include an identification of the class and method to be invoked and the name of the nameserver computer 13. Using the default stub class instance 30, the control module 19 will enable the computer 11(n) to initiate communications with nameserver computer 13 to obtain an identifier for a server computer 12(m) which maintains the class and method to be invoked (step 110). The communications from the default stub class instance 30 will essentially correspond to a remote method invocation, with the method enabling the nameserver computer to provide the identification for the server computer 12(m), if one exists associated with the class and method to be remotely invoked, or alternatively to provide an indication that no server computer 12(m) is identified as being associated with the class and method. During the communications in step 110, the default stub class interface 30 will provide, as a parameter value, the identification of class and method to be invoked.
[0059] In response to the communications from the default stub class instance 30, the nameserver computer 13 will process the request as a remote method (step 111), with the result information comprising the identification for the server computer 12(m), if one exists that is associated with the class and method to be remotely invoked, or alternatively an indication that no server computer 12(m) is identified as being associated with the class and method. After finishing the method, the nameserver computer 13 will initiate communications with the default stub class instance 30 to provide the result information to the default stub class instance 30 (step 112).
[0060] After receipt of the result information from the nameserver computer 13, the default stub class instance, under control of the control module 19, will pass result information to the stub class loader 33 (step 113). Thereafter, the stub class loader 33 determines whether the result information from the nameserver computer comprises the identification for the server computer 12(m) or an indication that no server computer 12(m) is identified as being associated with the class (step 114). If the stub class loader 33 determines that the result information comprises the identification for the server computer 12(m), it (that is, the stub class loader 33) will return to step 103 to initiate communication with the identified server computer 12(m) to obtain stub class instance for the class and method that may be invoked. On the other hand, if the stub class loader 33 determines in step 114 that the nameserver computer 13 had provided an indication that no server computer 12(m) is identified as being associated with the class and method that may be invoked, the “class not found” exception may be indicated (step 115) and an exception handler called as described above.
[0061] As noted above, the stub class instance 30 retrieved and loaded as described above in connection with FIG. 2 may be used in remote invocation of the method. Operations performed by the client computer 11(n) in connection with remote invocation of the method will be described in connection with the flow chart in FIG. 3. As depicted in FIG. 3, when a class instance 22 invokes a method, the control module 19 may initially verify that a stub class instance 30 is present in the execution environment for remote method to be invoked (step 120). If a positive determination is made in step 120, the stub class instance 30 will be used for the remote invocation, and in the remote invocation will provide parameter values which are to be used in processing the remote method (step 121). Thereafter, the stub class instance 30 for the remote method that may be invoked will be used to initiate communications with the server computer 12(m) which maintains the class for the remote method (step 122), in the process, the passing parameter values which are to be used in processing the remote method will be passed. It will be appreciated that, if the server computer 12(m) which is to process the method is the same physical computer as the client computer 12(n) which is invoking the method, the communications can be among execution environments which are being processed within the physical computer. On the other hand, if the server computer 12(m) which is to process the method is a different physical computer from that of the client computer 11(n) which is invoking the method, the communications will be through the client computer's and server computer's respective network interfaces 15(n) and 16(m) and over the network 14.
[0062] In response to the communications from the stub class instance in step 122, the server computer 12(m), if necessary establishes an execution environment 24 for the class which maintains the method that may be invoked, and the uses the information provided by the skeleton 32 to create a class instance 26 for that class (step 123). Thereafter, the server computer 12(m), under control of the control module 28, will process the method in connection with parameter values that were provided by stub class instance 30 (step 124). After completing processing of the method, the server computer 12(m), also under control of the control module 28, will initiate communications with the client computer's stub class instance 30 to provide result information to the stub class instance (step 125). In a manner similar to that described above in connection with step 102, if the server computer 12(m) which processed the method is the same physical computer as the client computer 11(n) which invoked the method, the communications can be among execution environments 24 and 20 which are being processed within the physical computer. On the other hand, if the server computer 12(m) which processed the method is a different physical computer from that of the client computer 11(n) which is invoking the method, the communications will be through the server computer's and client computer's respective network interfaces 16(m) and 15(n) and over the network 14. After the stub class instance 30 receives the result information from the server computer, it may provide result information to the class instance 22 which initiated the remote method invocation (step 126), and that class instance 22 can continue processing under control of the control module 19.
[0063] Returning to step 120, if the control module 19 determines in that step that it does not have a stub class instance 30 that is appropriate for the remote method that may be invoked, it may at that point call an exception handler (step 127) to perform selected error recovery operations.
[0064] Methods and systems consistent with the present invention provide a number of advantages. In particular, they provide a new system and method for facilitating dynamic loading of a stub which enables a program that is operating in one execution environment to remotely invoke processing of a method in another execution environment, so that the stub can be loaded by the program when it is run and needed. In systems in which stubs are compiled with the program, and thus are statically determined when the program is compiled, they (the stubs) may implement subsets of the actual set of remote interfaces which are supported by the remote references that are received by the program, which can lead to errors and inefficiencies due to mismatches between the stub that is provided to a program and the requirements of the remote procedure that is called when the program is run. However, since, in the dynamic stub loading system and method, the stub that is loaded can be obtained from the particular resource which provides the remote method, it (the stub) can define the exact set of interfaces to be provided to the invoking program at run time, thereby obviating run-time incompatibilities which may result from mismatches between the stub that is provided and the requirements of the remote method that is invoked.
[0065] It will be appreciated that a number of modifications may be made to the arrangement as described above. For example, although the execution environment 20 has been described as obtaining and loading stub class instances to facilitate invocation of remote methods when references to the remote methods are received, it will be appreciated that stub class instances may instead be obtained and loaded when the remote methods are initially invoked. Obtaining and loading of the stub class instance for a remote method when a reference thereto is received will have the advantages that (i) the stub class instance will be present in the execution environment when the remote method is actually invoked, and (ii) if the appropriate stub class instance can not be located, the program or an operator may be notified at an early time. On the other hand, obtaining and loading of the stub class instance for a remote method when the method is to be invoked may result in a delay of the invocation until the correct stub class instance can be found, if the method is in fact not invoked even if a reference to it is received the stub class instance may not need to be located and loaded.
[0066] It will be appreciated that a system in accordance with the invention can be constructed in whole or in part from special purpose hardware or a general purpose computer system, or any combination thereof, any portion of which may be controlled by a suitable program. Any program may in whole or in part comprise part of or be stored on the system in a conventional manner, or it may in whole or in part be provided to the system over a network or other mechanism for transferring information in a conventional manner. In addition, it will be appreciated that the system may be operated and/or otherwise controlled by means of information provided by an operator using operator input elements (not shown) which may be connected directly to the system or which may transfer the information to the system over a network or other mechanism for transferring information in a conventional manner.
ALTERNATIVE EMBODIMENT OF THE PRESENT INVENTION
[0067] Although an embodiment consistent with the present invention has been previously described that dynamically retrieves and loads stubs, an alternative embodiment also consistent with the present invention loads and retrieves objects in a lookup service, where the objects contain code (stub information) for facilitating communication with a particular service or the objects contain code that performs the service. Although the alternative embodiment is described below as downloading objects from the lookup service that represent stubs, the techniques described below are equally applicable to downloading objects that actually perform the services. A lookup service defines a network's directory of services and stores references to these services. A user desiring use of a service on the network accesses the lookup service, which returns the stub information that facilitates the user's access of the service.
[0068] The lookup service may contain a subset of all services available in the network, referred to as a “Djinn” as described in copending U.S. patent application Ser. No. 09/044,931, entitled “Dynamical Lookup Service in a Distributed System,” assigned to a common assignee, filed on even date herewith, which has been previously incorporated by reference. A “Djinn” refers to a logical grouping of one or more of the services or resources that are provided by a network. Devices connected to the network may either dynamically add themselves to the Djinn or dynamically remove themselves from the Djinn. When added, a device provides zero or more of its services to the Djinn and may utilize all of the services currently provided by the Djinn. The services provided by the Djinn are defined by the lookup service, which provides a common way to both find and utilize the services for the Djinn.
[0069] The lookup service is a fundamental part of the infrastructure for a Djinn or other computer network offering a range of services. It is the primary means for programs to find services available within the Djinn and is the foundation for providing stubs through which users and administrators can discover and interact with services in the Djinn.
[0070] Reference will now be made to FIG. 4, which depicts lookup service 400 in greater detail. Server computer 12(m), also includes a lookup service 400, further described below. The lookup service 400, located on a server 12(m) as shown in FIG. 1, maintains a collection of “service items” 410-418. Each service item 410-418 represents an instance of a service available within the Djinn, and each service item 410-418 contains a service ID 402 that uniquely identifies the service item, a stub 404 providing code that programs use to access the service, and a collection of attributes 406 that describe the service.
[0071] Upon registering a new service with the lookup service 400, the lookup service gives the new service item 410 a unique service ID 402, typically a number. This service ID 402 can later be used to access the specific service, avoiding unnecessary searching or locating several matching service items upon a query.
[0072] When a new service is created (e.g., when a new device is added to the Djinn), the service registers itself with the lookup service 400, providing a stub 404 to be used by a client to access the service and an initial collection of attributes 406 associated with the service. For example, a printer might include attributes indicating speed (in pages per minute), resolution (in dots per inch), color, and whether duplex printing is supported. The lookup service administrator (not shown) might also add new attributes, such as the physical location of the service and common names for it. Additionally, if a service encounters some problem that needs administrative attention, such as a printer running out of toner, the service can add an attribute that indicates what the problem is. In one implementation consistent with the present invention, attributes are stored as multi-entries, and the addition, modification and deletion of attributes can be made using multi-templates and the techniques explained in co-pending U.S. patent application Ser. No. 09/044,839, entitled “Method and System for In-Place Modifications In A Database”, previously incorporated herein.
[0073] An individual set of attributes is represented as an instance of a class, each attribute being a field of that class. An example of an attribute set for a printer is:
| public class Printer { |
[0074] The class provides strong typing of both the set and the individual attributes.
[0075] The attributes 406 of service items 410-418 can also be represented as a set of sets of attributes. Attributes 406 of a service item 410 can contain multiple instances of the same class with different attribute values, as well as multiple instances of different classes. For example, the attributes 406 of a service item 410 might 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, a Type class, or various other service-specific classes. An example of some added attributes to describe the printer may be the Name, Type, or Location:
| public class Name implements Entry { |
[0076] In this example, the attributes 406 for this service item 410 would be a set of attributes containing the Printer, Name, Type, and Location class instances, each class containing their own individual attributes. However, it should be noted that the scheme used for attributes is not constrained by these examples.
[0077] Programs (including other services) that need a particular type of service can use the lookup service 400 to find a stub that can be used to access the service. A match can be made based on the type of service as well as the specific attributes attached to the service. For example, a client could search for a printer by requesting a stub type corresponding to the service desired or by requesting certain attributes such as a specific location or printing speed. In one implementation consistent with the present invention, attributes are stored as multi-entries, and a match on attributes can be made using multi-templates, as explained in co-pending U.S. patent application Ser. No. 09/044,835, entitled “Method and System For Multi-Entry and Multi-Template Matching In A Database”, previously incorporated herein.
Accessing a Lookup Service Employing Dynamic Stub Loading and Retrieval
[0078] Referring back to FIG. 4, the stub 404 corresponding to a service is registered in the lookup service 400 and is used by the client computer 11(n) to access the service methods remotely. This stub 404 may also be a “smart proxy.” A smart proxy, code within which a stub is embedded, helps the client more efficiently implement the stub and the method to be remotely invoked. A smart proxy often performs some local computation for efficiency before or after it actually calls the stub. For example, a smart proxy may contain code to cache information, so if a client requested it again, instead of going back to the server to get the information, it may have cached the answer and be able to return it quickly. If the situation called for it, a smart proxy might also transform the parameters received from the client into other types and then send the transformed types. The smart proxy concept is further explained in co-pending U.S. patent application Ser. No. 09/044,930, entitled “Downloadable Smart Proxies for Performing Processing Associated with a Remote Procedure Call in a Distributed System,” assigned to a common assignee, filed on even date herewith, which is hereby incorporated by reference.
[0079] FIG. 5 depicts a flowchart illustrating the steps used by systems consistent with the present invention for adding a service stub to the lookup service. When a device joins the network, it typically registers a service with the lookup service (step 500). Upon registration with the lookup service 400, the device supplies a stub 404 to the lookup service, and it may also give its associated attributes 406 to the lookup service (step 502). In response, the lookup service 400 assigns a unique service ID 402, typically a number as previously stated, to the service registered with the lookup service (step 504). Once the device has supplied the lookup service 400 with a stub 404 and attributes 406, and the lookup service has assigned a unique service ID 402, the device has completed registration of the service with the lookup service (step 506). After services are registered with the lookup service 400, clients can use the lookup service to obtain stub information needed to access the registered services.
[0080] FIG. 6 depicts a flowchart illustrating steps used by systems and methods consistent with the present invention to download a service item from the lookup service. In one implementation, the client computer 11(n) sends a request for a service to the server 12(m) with the lookup service 400 (step 600). The request originates from the remote method invocation of a class instance 22 on client computer 11(n), and the requested service may reside on a remote server as the exemplary service 38 resides on server 12(1). In one implementation consistent with the present invention, the client computer 11(n) may request one or more services from the lookup service 400. The client's request comes in the form of a specific service ID 402, a type of stub 404, or a set of attributes 406, or any combination thereof (step 602). In response to the request, control 19 directs the stub class loader 33 to locate the corresponding stub 404 from the server 12(m). To do so, the control 19 enables the stub class loader 33 to initiate communication with the server 12(m) to obtain a stub 404 for the service to be obtained.
[0081] Upon receipt of the request from the client computer 11(n), the control 28 in the server 12(m) searches the lookup service 400 for the stub 404 corresponding to the requested service (step 604). If there are no matches found, the control 28 returns a null value (steps 606 and 608). Otherwise, if it locates the stub 404 corresponding to the service that the client computer 11(n) is attempting to access, the server 12(m) returns the stub to the stub class loader 33 on the client computer (step 612). If more than one stub was located matching the client's request (step 610), in one embodiment consistent with the present invention, any one of the stubs is returned (step 616). In another implementation where the client requests more than one service, the server 12(m) returns the requested number of the stubs with their attributes (steps 614 and 618).
[0082] When the stub 404 is received by the stub class loader 33, the stub class loader loads it into the execution environment 20. After it is loaded, the service 38 can be remotely invoked. The use of the stub information to invoke remote processing of the service 38 is performed in the same manner as previously discussed in connection with FIG. 3.
[0083] Generally, the class instance 22 can use the stub 404 to access the service 38 on the server 12(1). When the class instance 22 requires use of the service 38 corresponding to the returned stub 404, control 19 verifies that the stub 404 is present in the execution environment 20. If so, the class instance 22 can then use the stub 404 to initiate communications with the server 12(1) that maintains the service 38, and parameters will be passed to the service 38 for implementation.
[0084] This lookup service implementation is one application of the dynamic loading and retrieval of stub information to enable a program operating in one address space to invoke processing of a procedure in another address space. This implementation of using the dynamic stub loading on the lookup service allows a client to receive stub information to facilitate use of that service directly. Unlike previous lookup services, the lookup service consistent with the present invention returns the code needed to access the service directly. Using the dynamic loading of stub information in this way allows the client to receive all the code necessary to facilitate use of the service on a remote server.
[0085] The foregoing description has been limited to a specific embodiment of the present invention. It will be apparent, however, that various variations and modifications may be made. It is the object of the appended claims to cover these and such other variations and modifications as come within the true spirit and scope of the invention.
Claims
What is claimed is:
1. A method in a data processing system for accessing network services associated with a lookup service, comprising the steps of:
receiving a request by the lookup service for access to one of the network services; and
returning, by the lookup service, executable code to facilitate the access of the one network service.
2. The method of claim 1, further including the step of:
accessing the network service using the returned executable code.
3. The method of claim 1, wherein the step of returning the executable code includes the step of:
returning a stub.
4. The method of claim 1, wherein the step of returning the executable code includes the step of:
returning a smart proxy.
5. The method of claim 1, wherein the receiving step includes the step of:
receiving the request to access the one network service such that the one network service is identified by a type of service.
6. The method of claim 1, wherein the receiving step includes the step of:
receiving the request to access the one network service such that the one network service is identified by a service identification number.
7. The method of claim 1, wherein the receiving step includes the step of:
receiving the request to access the one network service such that the one network service is identified by an attribute of the one network service.
8. The method of claim 1, wherein the step of returning executable code includes the step of:
returning a plurality of stubs associated with a plurality of network services that match the request.
9. The method of claim 8, wherein the step of returning a plurality of stubs includes the step of:
returning attributes associated with each stub.
10. A method in a data processing system having a lookup service with a plurality of services, the method comprising the steps of:
sending to the lookup service a request to access one of the services; and
receiving executable code, from the lookup service and responsive to the request, that facilitates use of the one service.
11. The method of claim 10, further including the step of:
accessing the one service using the received executable code.
12. The method of claim 10, wherein the step of receiving executable code includes the step of:
receiving a stub that facilitates access of the one service.
13. A distributed system with a plurality of network services, comprising:
a server computer with a lookup service having stubs for facilitating access to the network services; and
a client computer with a program that sends a request to the lookup service for one of the stubs corresponding to one of the network services, that receives the stub, and that accesses the one network service using the received stub.
14. A method in a data processing system having a first computer with a client and a second computer with a lookup service containing service stubs used for accessing associated services, the method comprising the steps of:
sending a request by the client to the lookup service identifying one of the associated services to be accessed;
receiving the request by the lookup service;
searching the lookup service for the identified service;
returning a service stub associated with the identified service to the client;
receiving the service stub by the client;
loading the service stub into an address space of the client to render the service stub available for use to invoke the identified service; and
using the stub by the client to access the identified service.
15. The method of claim 14, wherein the sending step includes the step of:
sending a request for more than one service to be returned, and wherein the returning step further includes the step of:
returning more than one stub to the client in response to the request.
16. The method of claim 14, wherein the searching step includes the step of:
returning a null value if no service is found matching the request.
17. The method of claim 10, wherein the step of receiving executable code includes the step of:
receiving a smart proxy that facilitates access of the one service.
18. The distributed system of claim 13, wherein the client computer utilizes a remote procedure call mechanism to receive the stub.
19. A system having a first computer with a client and a second computer with a lookup service containing service stubs used for accessing associated services, the system comprising:
means for sending a request by the client to the lookup service identifying one of the associated services to be accessed;
means for receiving the request by the lookup service;
means for searching the lookup service for the identified service;
means for returning a service stub associated with the identified service to the client;
means for receiving the service stub by the client;
means for loading the service stub into an address space of the client to render the service stub available for use to invoke the identified service; and
means for using the stub by the client to access the identified service.
20. A computer-readable medium containing instructions for controlling a data processing system to perform a method for accessing network services contained in a lookup service, the method comprising the steps of:
receiving a request by the lookup service for access to one of the network services; and
returning, by the lookup service, executable code to facilitate the access of the one network service.
21. The computer-readable medium of claim 20, wherein the method further includes the step of:
accessing the network service using the returned executable code.
22. The computer-readable medium of claim 20, wherein the returning step includes the step of:
returning a stub to the client.
23. The computer-readable medium of claim 20, wherein the returning step includes the step of:
returning a smart proxy to the client.
24. A computer-readable medium containing instructions for controlling a data processing system to perform a method for accessing network services contained in a lookup service, the method comprising the steps of:
sending to the lookup service a request to access one of the services; and
receiving executable code, from the lookup service and responsive to the request, that facilitates use of the one service.
25. The computer-readable medium of claim 24, wherein the method further includes the step of:
accessing the one service using the received executable code.
26. The computer-readable medium of claim 24, wherein the step of receiving executable code includes the step of:
receiving a stub that facilitates access of the one service.
27. The computer-readable medium of claim 24, wherein the step of receiving executable code includes the step of:
receiving a smart proxy that facilitates access of the one service.
Patent Citations (246)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4430699(A) | 1984-02-01 | Segarra et al. | Applicant |
| US4491946(A) | 1985-01-01 | Kryskow, Jr. et al. | Applicant |
| US4558413(A) | 1985-12-01 | Schmidt et al. | Applicant |
| US4567359(A) | 1986-01-01 | Lockwood | Applicant |
| US4713806(A) | 1987-12-01 | Oberlander et al. | Applicant |
| US4809160(A) | 1989-02-01 | Mahon et al. | Applicant |
| US4823122(A) | 1989-04-01 | Mann et al. | Applicant |
| US4939638(A) | 1990-07-01 | Stephenson et al. | Applicant |
| US4956773(A) | 1990-09-01 | Saito et al. | Applicant |
| US4992940(A) | 1991-02-01 | Dworkin | Applicant |
| US5088036(A) | 1992-02-01 | Ellis et al. | Applicant |
| US5101346(A) | 1992-03-01 | Ohtsuki | Applicant |
| US5109486(A) | 1992-04-01 | Seymour | Applicant |
| US5187787(A) | 1993-02-01 | Skeen et al. | Applicant |
| US5218699(A) | 1993-06-01 | Brandle et al. | Applicant |
| US5253165(A) | 1993-10-01 | Leiseca et al. | Applicant |
| US5257369(A) | 1993-10-01 | Skeen et al. | Applicant |
| US5293614(A) | 1994-03-01 | Ferguson et al. | Applicant |
| US5297283(A) | 1994-03-01 | Kelly et al. | Applicant |
| US5307490(A) | 1994-04-01 | Davidson et al. | Applicant |
| US5311591(A) | 1994-05-01 | Fischer | Applicant |
| US5319542(A) | 1994-06-01 | King, Jr. et al. | Applicant |
| US5327559(A) | 1994-07-01 | Priven et al. | Applicant |
| US5339435(A) | 1994-08-01 | Lubkin et al. | Applicant |
| US5386568(A) | 1995-01-01 | Wold et al. | Applicant |
| US5390328(A) | 1995-02-01 | Frey et al. | Applicant |
| US5392280(A) | 1995-02-01 | Zheng | Applicant |
| US5423042(A) | 1995-06-01 | Jalili et al. | Applicant |
| US5440744(A) | 1995-08-01 | Jacobson et al. | Applicant |
| US5448740(A) | 1995-09-01 | Kiri et al. | Applicant |
| US5452459(A) | 1995-09-01 | Drury et al. | Applicant |
| US5455952(A) | 1995-10-01 | Gjovaag | Applicant |
| US5471629(A) | 1995-11-01 | Risch | Applicant |
| US5475792(A) | 1995-12-01 | Stanford et al. | Applicant |
| US5475817(A) | 1995-12-01 | Waldo et al. | Applicant |
| US5475840(A) | 1995-12-01 | Nelson et al. | Applicant |
| US5481721(A) | 1996-01-01 | Serlet et al. | Applicant |
| US5504921(A) | 1996-04-01 | Dev et al. | Applicant |
| US5511196(A) | 1996-04-01 | Shackelford et al. | Applicant |
| US5511197(A) | 1996-04-01 | Hill et al. | Examiner |
| US5524244(A) | 1996-06-01 | Robinson et al. | Applicant |
| US5544040(A) | 1996-08-01 | Gerbaulet | Applicant |
| US5548726(A) | 1996-08-01 | Pettus | Applicant |
| US5553282(A) | 1996-09-01 | Parrish et al. | Applicant |
| US5555367(A) | 1996-09-01 | Premerlani et al. | Applicant |
| US5555427(A) | 1996-09-01 | Aoe et al. | Applicant |
| US5557798(A) | 1996-09-01 | Skeen et al. | Applicant |
| US5560003(A) | 1996-09-01 | Nilsen et al. | Applicant |
| US5561785(A) | 1996-10-01 | Blandy et al. | Applicant |
| US5577231(A) | 1996-11-01 | Scalzi et al. | Applicant |
| US5592375(A) | 1997-01-01 | Salmon et al. | Applicant |
| US5594921(A) | 1997-01-01 | Pettus | Applicant |
| US5603031(A) | 1997-02-01 | White et al. | Applicant |
| US5617537(A) | 1997-04-01 | Yamada et al. | Applicant |
| US5628005(A) | 1997-05-01 | Hurvig | Applicant |
| US5640564(A) | 1997-06-01 | Hamilton et al. | Applicant |
| US5644768(A) | 1997-07-01 | Periwal et al. | Applicant |
| US5652888(A) | 1997-07-01 | Burgess | Applicant |
| US5655148(A) | 1997-08-01 | Richman et al. | Applicant |
| US5659751(A) | 1997-08-01 | Heninger | Applicant |
| US5664110(A) | 1997-09-01 | Green et al. | Applicant |
| US5664111(A) | 1997-09-01 | Nahan et al. | Applicant |
| US5666493(A) | 1997-09-01 | Wojcik et al. | Applicant |
| US5671225(A) | 1997-09-01 | Hooper et al. | Applicant |
| US5671279(A) | 1997-09-01 | Elgamal | Applicant |
| US5675796(A) | 1997-10-01 | Hodges et al. | Applicant |
| US5675797(A) | 1997-10-01 | Chung et al. | Applicant |
| US5680573(A) | 1997-10-01 | Rubin et al. | Applicant |
| US5680617(A) | 1997-10-01 | Gough et al. | Applicant |
| US5684955(A) | 1997-11-01 | Meyer et al. | Applicant |
| US5689709(A) | 1997-11-01 | Corbett et al. | Applicant |
| US5694551(A) | 1997-12-01 | Doyle et al. | Applicant |
| US5706435(A) | 1998-01-01 | Barbará et al. | Applicant |
| US5706502(A) | 1998-01-01 | Foley et al. | Applicant |
| US5710887(A) | 1998-01-01 | Chelliah et al. | Applicant |
| US5715314(A) | 1998-02-01 | Payne et al. | Applicant |
| US5721832(A) | 1998-02-01 | Westrope et al. | Applicant |
| US5724540(A) | 1998-03-01 | Kametani | Applicant |
| US5724588(A) | 1998-03-01 | Hill et al. | Examiner |
| US5727048(A) | 1998-03-01 | Hiroshima et al. | Applicant |
| US5727145(A) | 1998-03-01 | Nessett et al. | Examiner |
| US5729594(A) | 1998-03-01 | Klingman | Applicant |
| US5737607(A) | 1998-04-01 | Hamilton et al. | Applicant |
| US5742768(A) | 1998-04-01 | Gennaro et al. | Applicant |
| US5745678(A) | 1998-04-01 | Herzberg et al. | Applicant |
| US5745695(A) | 1998-04-01 | Gilchrist et al. | Applicant |
| US5745703(A) | 1998-04-01 | Cejtin et al. | Applicant |
| US5745755(A) | 1998-04-01 | Covey | Applicant |
| US5748897(A) | 1998-05-01 | Katiyar | Applicant |
| US5754849(A) | 1998-05-01 | Dyer et al. | Applicant |
| US5757925(A) | 1998-05-01 | Faybishenko | Applicant |
| US5758328(A) | 1998-05-01 | Giovannoli | Applicant |
| US5758344(A) | 1998-05-01 | Prasad et al. | Applicant |
| US5761656(A) | 1998-06-01 | Ben-Shachar | Applicant |
| US5764897(A) | 1998-06-01 | Khalidi | Applicant |
| US5768532(A) | 1998-06-01 | Megerian | Applicant |
| US5774551(A) | 1998-06-01 | Wu et al. | Applicant |
| US5774729(A) | 1998-06-01 | Carney et al. | Applicant |
| US5778179(A) | 1998-07-01 | Kanai et al. | Applicant |
| US5778187(A) | 1998-07-01 | Monteiro et al. | Applicant |
| US5778228(A) | 1998-07-01 | Wei | Applicant |
| US5778368(A) | 1998-07-01 | Hogan et al. | Applicant |
| US5784560(A) | 1998-07-01 | Kingdon et al. | Applicant |
| US5787425(A) | 1998-07-01 | Bigus | Applicant |
| US5787431(A) | 1998-07-01 | Shaughnessy | Applicant |
| US5790548(A) | 1998-08-01 | Sistanizadeh et al. | Applicant |
| US5790677(A) | 1998-08-01 | Fox et al. | Applicant |
| US5794207(A) | 1998-08-01 | Walker et al. | Applicant |
| US5802367(A) | 1998-09-01 | Held et al. | Applicant |
| US5805805(A) | 1998-09-01 | Civanlar et al. | Applicant |
| US5808911(A) | 1998-09-01 | Tucker et al. | Applicant |
| US5809144(A) | 1998-09-01 | Sirbu et al. | Applicant |
| US5809507(A) | 1998-09-01 | Cavanaugh, III | Examiner |
| US5812819(A) | 1998-09-01 | Rodwin et al. | Applicant |
| US5813013(A) | 1998-09-01 | Shakib et al. | Applicant |
| US5815149(A) | 1998-09-01 | Mutschler, III et al. | Applicant |
| US5815709(A) | 1998-09-01 | Waldo et al. | Examiner |
| US5815711(A) | 1998-09-01 | Sakamoto et al. | Applicant |
| US5818448(A) | 1998-10-01 | Katiyar | Applicant |
| US5829022(A) | 1998-10-01 | Watanabe et al. | Applicant |
| US5832219(A) | 1998-11-01 | Pettus | Applicant |
| US5832529(A) | 1998-11-01 | Wollrath et al. | Applicant |
| US5832593(A) | 1998-11-01 | Wurst et al. | Applicant |
| US5835737(A) | 1998-11-01 | Sand et al. | Applicant |
| US5842018(A) | 1998-11-01 | Atkinson et al. | Applicant |
| US5844553(A) | 1998-12-01 | Hao et al. | Applicant |
| US5845090(A) | 1998-12-01 | Collins, III et al. | Applicant |
| US5845129(A) | 1998-12-01 | Wendorf et al. | Applicant |
| US5850442(A) | 1998-12-01 | Muftic | Applicant |
| US5860004(A) | 1999-01-01 | Fowlow et al. | Examiner |
| US5860153(A) | 1999-01-01 | Matena et al. | Applicant |
| US5864862(A) | 1999-01-01 | Kriens et al. | Applicant |
| US5864866(A) | 1999-01-01 | Henckel et al. | Applicant |
| US5872928(A) | 1999-02-01 | Lewis et al. | Applicant |
| US5872973(A) | 1999-02-01 | Mitchell et al. | Applicant |
| US5875335(A) | 1999-02-01 | Beard | Applicant |
| US5878411(A) | 1999-03-01 | Burroughs et al. | Applicant |
| US5884024(A) | 1999-03-01 | Lim et al. | Applicant |
| US5884079(A) | 1999-03-01 | Furusawa | Applicant |
| US5887134(A) | 1999-03-01 | Ebrahim | Applicant |
| US5889951(A) | 1999-03-01 | Lombardi | Applicant |
| US5890158(A) | 1999-03-01 | House et al. | Applicant |
| US5892904(A) | 1999-04-01 | Atkinson et al. | Applicant |
| US5913029(A) | 1999-06-01 | Shostak | Applicant |
| US5933497(A) | 1999-08-01 | Beetcher et al. | Applicant |
| US5933647(A) | 1999-08-01 | Aronberg et al. | Applicant |
| US5935249(A) | 1999-08-01 | Stern et al. | Applicant |
| US5940827(A) | 1999-08-01 | Hapner et al. | Applicant |
| US5944793(A) | 1999-08-01 | Islam et al. | Applicant |
| US5946485(A) | 1999-08-01 | Weeren et al. | Applicant |
| US5946694(A) | 1999-08-01 | Copeland et al. | Applicant |
| US5949998(A) | 1999-09-01 | Fowlow et al. | Applicant |
| US5951652(A) | 1999-09-01 | Ingrassia, Jr. et al. | Applicant |
| US5956509(A) | 1999-09-01 | Kevner | Applicant |
| US5961582(A) | 1999-10-01 | Gaines | Applicant |
| US5963924(A) | 1999-10-01 | Williams et al. | Applicant |
| US5963947(A) | 1999-10-01 | Ford et al. | Applicant |
| US5966531(A) | 1999-10-01 | Skeen et al. | Applicant |
| US5969967(A) | 1999-10-01 | Aahlad et al. | Applicant |
| US5974201(A) | 1999-10-01 | Chang et al. | Applicant |
| US5978484(A) | 1999-11-01 | Apperson et al. | Applicant |
| US5982773(A) | 1999-11-01 | Nishimura et al. | Applicant |
| US5987506(A) | 1999-11-01 | Carter et al. | Applicant |
| US5999179(A) | 1999-12-01 | Kekic et al. | Applicant |
| US5999988(A) | 1999-12-01 | Pelegri-Llopart et al. | Applicant |
| US6003050(A) | 1999-12-01 | Silver et al. | Applicant |
| US6003763(A) | 1999-12-01 | Gallagher et al. | Applicant |
| US6009103(A) | 1999-12-01 | Woundy | Applicant |
| US6009413(A) | 1999-12-01 | Webber et al. | Applicant |
| US6016496(A) | 2000-01-01 | Roberson | Applicant |
| US6016516(A) | 2000-01-01 | Horikiri | Applicant |
| US6023586(A) | 2000-02-01 | Gaisford et al. | Applicant |
| US6026414(A) | 2000-02-01 | Anglin | Applicant |
| US6031977(A) | 2000-02-01 | Pettus | Applicant |
| US6032151(A) | 2000-02-01 | Arnold et al. | Applicant |
| US6044381(A) | 2000-03-01 | Boothby et al. | Applicant |
| US6052761(A) | 2000-04-01 | Hornung et al. | Applicant |
| US6058383(A) | 2000-05-01 | Narasimhalu et al. | Applicant |
| US6061699(A) | 2000-05-01 | DiCecco et al. | Applicant |
| US6061713(A) | 2000-05-01 | Bharadhwaj | Applicant |
| US6067575(A) | 2000-05-01 | McManis et al. | Applicant |
| US6085255(A) | 2000-07-01 | Vincent et al. | Applicant |
| US6093216(A) | 2000-07-01 | Adl-Tabatabai et al. | Applicant |
| US6108346(A) | 2000-08-01 | Doucette et al. | Applicant |
| US6134603(A) | 2000-10-01 | Jones et al. | Applicant |
| US6182083(B1) | 2001-01-01 | Scheifler et al. | Applicant |
| US6185602(B1) | 2001-02-01 | Bayrakeri | Applicant |
| US6185611(B1) | 2001-02-01 | Waldo et al. | Applicant |
| US6199116(B1) | 2001-03-01 | May et al. | Applicant |
| US6216138(B1) | 2001-04-01 | Wells et al. | Applicant |
| US6216158(B1) | 2001-04-01 | Luo et al. | Applicant |
| US6226746(B1) | 2001-05-01 | Scheifler | Applicant |
| US6243716(B1) | 2001-06-01 | Waldo et al. | Applicant |
| US6247091(B1) | 2001-06-01 | Lovett | Applicant |
| US6253256(B1) | 2001-06-01 | Wollrath et al. | Applicant |
| US6263350(B1) | 2001-07-01 | Wollrath et al. | Applicant |
| US6263379(B1) | 2001-07-01 | Atkinson et al. | Applicant |
| US6272559(B1) | 2001-08-01 | Jones et al. | Applicant |
| US6282295(B1) | 2001-08-01 | Young et al. | Applicant |
| US6282568(B1) | 2001-08-01 | Sondur et al. | Applicant |
| US6339783(B1) | 2002-01-01 | Horikiri | Applicant |
| US6343308(B1) | 2002-01-01 | Marchesseault | Applicant |
| US6385643(B1) | 2002-05-01 | Jacobs et al. | Applicant |
| US6687717(B1) | 2004-02-01 | Hamilton et al. | Examiner |
| US6697865(B1) | 2004-02-01 | Howard et al. | Examiner |
| US6701438(B1) | 2004-03-01 | Prabandham et al. | Examiner |
| EP300516(A) | 1989-01-01 | Applicant | |
| EP384339(A) | 1990-08-01 | Applicant | |
| EP472874(A1) | 1992-03-01 | Applicant | |
| EP474340(A) | 1992-03-01 | Applicant | |
| EP497022(A1) | 1992-08-01 | Applicant | |
| EP555997(A) | 1993-08-01 | Applicant | |
| EP565849(A) | 1993-10-01 | Applicant | |
| EP569195(A2) | 1993-11-01 | Applicant | |
| EP625750(A) | 1994-11-01 | Applicant | |
| EP635792(A) | 1995-01-01 | Applicant | |
| EP651328(A) | 1995-05-01 | Applicant | |
| EP660231(A) | 1995-06-01 | Applicant | |
| EP697655(A2) | 1996-02-01 | Applicant | |
| EP718761(A) | 1996-06-01 | Applicant | |
| EP767432(A2) | 1997-04-01 | Applicant | |
| EP778520(A2) | 1997-06-01 | Applicant | |
| EP794493(A2) | 1997-09-01 | Applicant | |
| EP803810(A2) | 1997-10-01 | Applicant | |
| EP803811(A2) | 1997-10-01 | Applicant | |
| EP805393(A2) | 1997-11-01 | Applicant | |
| EP810524(A) | 1997-12-01 | Applicant | |
| EP817020(A) | 1998-01-01 | Applicant | |
| EP817022(A2) | 1998-01-01 | Applicant | |
| EP817025(A2) | 1998-01-01 | Applicant | |
| EP836140(A2) | 1998-04-01 | Applicant | |
| EP351536(A3) | 1999-01-01 | Applicant | |
| GB2253079(A) | 1992-08-01 | Applicant | |
| GB2262825(A) | 1993-06-01 | Applicant | |
| GB2305087(A) | 1997-03-01 | Applicant | |
| JP11-45187 | 1999-02-01 | Applicant | |
| WO92/07335 | 1992-04-01 | Applicant | |
| WO92/09948 | 1992-06-01 | Applicant | |
| WO93/25962(A1) | 1993-12-01 | Applicant | |
| WO94/03855 | 1994-02-01 | Applicant | |
| WO96/03692(A) | 1996-02-01 | Applicant | |
| WO96/10787 | 1996-04-01 | Applicant | |
| WO96/18947 | 1996-06-01 | Applicant | |
| WO96/24099 | 1996-08-01 | Applicant | |
| WO98/02814 | 1998-01-01 | Applicant | |
| WO98/04971 | 1998-02-01 | Applicant |
Non-Patent Literature (182)
- Moller et al., Enhancing Jini's lookup service using XML-based service templates, Technology of Object-Oriented Languages and Systems, 2001, TOOLS 38, Proceedings, Mar. 12-14, 2001, pp. 19-31.Applicant
- Morgan, Jiini to the rescue, Spectrum IEEE, vol. 37, Issue 4, Apr. 2000, pp. 44-49.Applicant
- Shin et al., Grapes: topology-based hierarchical virtual network for peer-to-peer lookup services, Parallel Processing Workshops, 2002, Proceedings, International Conference on, Aug. 18-21, 2002, pp. 159-164.Applicant
- Jacob, “The use of distributed objects and dynamic interfaces in a wide-are transaction environment”, SIGCOMM '95 Workshop on Middleware: Cambridge Massachusetts, Aug. 1995.Applicant
- Alexander, et al., “Active Bridging”, Proceedings of the ACM/SIGCOMM'97 Conference, Cannes, France, 9/97.Applicant
- Anonymous: “Change-Notification Service for Shared Files”, IBM Technical Disclosure Bulletin, vol. 36, No. 8, pp. 77-82, Aug. 1993, XP002108713, New York, US.Applicant
- Anonymous: “Resource Preemption for Priority Scheduling.” Nov. 1973. IBM Technical Disclosure Bulletin, vol. 16, No. 6, p. 1931 XP002109435 New York, US.Applicant
- Beech et al., “Object Databases as Generalizations of Relational Databases,” Computer Standards & Interfaces, vol. 13, Nos. 1/3, pp. 221-230, (Jan. 1991) Amsterdam, NL.Applicant
- Bertino et al., “Object-Oriented Database Management Systems: Concepts and Issues,” Computer, vol. 24, No. 4, pp. 33-47, (Apr. 1991), Los Alamitos, CA.Applicant
- Betz, Mark; “Interoperable objects: laying the foundation for distributed object computing”; Dr. Dobb's. Journal, vol. 19, No. 11, p. 18(13); (Oct. 1994).Applicant
- Bevan, D.I., “An Efficient Reference Counting Solution To The Distributed Garbage Collection Problem”, Parall Computing, NL, Elsevier Publishers, Amsterdam, vol. 9, No. 2, pp. 179-192, Jan. 1989.Applicant
- Birrell et al., “Implementing Remote Procedure Calls”, ACM Transactions on Computer Systems, vol. 2, No. 1, Feb. 1984, pp. 39-59.Applicant
- Deux O et al: “The 02 System” Communications of the Association for Computing Machinery, vol. 34, No. 10, Oct. 1, 1991, pp. 34-48.Applicant
- Drexler, K. Eric, et al., “Incentive Engineering for Computational Resource Management,” The Ecology of Computation, Elsevier Science Publishers B.V., 1988, pp. 231-266.Applicant
- Droms, R., “RFC 1541 Dynamic Host Configuration Protocol”, HTTP://WWW.CIS.OHIO-STATE.EDU/HTBIN/RFC/RFC1541.HTML, Oct. 1993, pp. 1-33.Applicant
- Emms J: “A Definition of an Access Control Systems Language” Computer Standards and Interfaces, vol. 6, No. 4, Jan. 1, 1987, pp. 443-454.Applicant
- Gosling et al., “The Java (TM) Language Specification”, Addison-Wesley, 1996.Applicant
- Gottlob et al., “Extending Object-Oriented Systems with Roles,” ACM Transactions on information systems, vol. 14, No. 3, pp. 268-296 (Jul. 1996).Applicant
- Guth, Rob: “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.Applicant
- Hamilton et al., “Subcontract: a flexible base for distributed programming”; Proceedings of 14th Symposium of Operating System Principles; (Dec. 1993).Applicant
- Hartman, J., Manber, U., et al., Liquid Software: A new paradigm for networked systems, Technical Report 96-11, Department of Comp. Sci., Univ. of Arizona, 6/96.Applicant
- Hunt, N., “IDF: A Graphical Data Flow Programming Language for Image Processing and Computer Vision”, Proceedings of the International Conference on Systems, Man, and Cybernetics, Los Angeles, Nov. 4-7, pp. 351-360, (1990).Applicant
- IBM (TM) Technical Disclosure Bulletin, “Object Location Algorithm,” vol. 36, No. 09B, pp. 257-258, Sep. 1993.Applicant
- IBM (TM) Technical Disclosure Bulletin, “Retrieval of Qualified Variables Using Extendible Hashing,” vol. 36, No. 12, pp. 301-303, Dec. 1993.Applicant
- IBM: “Chapter 6—Distributed SOM (DSOM)” Somobjects Developer Toolkit Users Guide, Version 2.1, Oct. 1994 (1994-10), pp. 6-1-6-90.Applicant
- Jones, Richard, et al., “Garbage Collection: Algorithms for Automatic Dynamic Memory Management,” pp. 165-175, John Wiley & Sons, 1996.Applicant
- Kay, Michael H. et al., “An Overview of the Raleigh Object-Oriented Database System”, ICL Technical Journal, vol. 7, No. 4, pp. 780-798, (Nov. 1991), Oxford, GB.Applicant
- Kougiouris et al.; “Support for Space Efficient Object Invocation in Spring”; (Sep. 1994).Applicant
- Lindholm et al., “The Java (TM) Virtual Machine Specification”, Addison Wesley, 1996.Applicant
- Mitchell et al.; “An Overview of the Spring System”; (Feb. 1994).Applicant
- Orfali R. et al., “The Essential Distributed Objects Survival Guide,” Chapter 11: Corba Commercial ORBs, pp. 203-215, John Wiley & Sons, Inc., (1996).Applicant
- Riggs Roger et al., “Pickling State in the Java (TM) System,” USENIX Association Conference on Object-Oriented Technologies and Systems, XP-002112719, Jun. 17-21, 1996, pp. 241-250.Applicant
- Rosenberry et al., “Understanding DCE”; Chapters 1-3, 6; (1992).Applicant
- Waldo J et al: “Events in an RPC based distributed system” Proceedings of the 1995 Usenix Technical Conference, Proceedings Usenix Winter 1995 Technical Conference, New Orleans, LA. USA, Jan. 16-20, 1995, pp. 131-142.Applicant
- Wilson, P.R., 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.Applicant
- Wu, Xuequn, “A Type system for an Object-Oriented Database System,” Proceedings of the International Computer Software and Applications Conference (COMPSAC), pp. 333-338, Sep. 11-13, 1991, Tokyo, Japan.Applicant
- Yemini, Y. and S. da silva, “Towards Programmable Networks”, IFIP/IEEE International Workshop on Distributed Systems: Operations and Management, L'Aquila, Italy, 10/96.Applicant
- 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.Applicant
- 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.Applicant
- Burns et al., “An Analytical Study of Opportunistic Lease Renewal,” Distributed Computing Systems, 21st International Conference, pp. 146-153, Apr. 2000.Applicant
- Dollimore et al., “The Design of a System for Distributing Shared Objects,” The Computer Journal, No. 6, Cambridge, GB, Dec. 1991.Applicant
- 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.Applicant
- 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.Applicant
- Guyennet et al., “A New Consistency Protocol Implemented in the CAliF System,” IEEE, 1094-7256/97, pp. 82-87, 1997.Applicant
- Guyennet et al., “Distributetd Shared Memory Layer for Cooperative Work Applications,” IEEE, 0742-1303/97, pp. 72-78, 1997.Applicant
- Hoshi et al., “Allocation of the Cross-Connect Function in Leased Circuit Networks,” 1992, ICC'92, conference record, SUPERCOMM/ICC '02, D a New World of Communications, IEEE International Conference, pp. 1408-1412.Applicant
- IBM Technical Disclosure Bulletin, “Local Network Monitoring to Populate Access Agent Directory,” vol. 36, No. 09A, pp. 403-405, Sep. 1993.Applicant
- 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.Applicant
- MUX-Elektronik, Java 1.1 Interactive Course, www.lls.se/˜mux/javaic.html, 1995.Applicant
- Stevenson, “Token-Based Consistency of Replicated Servers,” IEEE, CH2686-4/89/0000/0179, pp. 179-183, 1989.Applicant
- Venners, “Jini Technology, Out of the Box,” JAVAWORLD, 'Online!, pp. 1-4, Dec. 1998.Applicant
- Yin et al., “Using Leases to Support Server Driven Consistency in Large-Scale Systems,” Computer Services Department, University of Texas at Austin, p. 285-294, May 26-28, 1998.Applicant
- 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.Applicant
- Amitabh Dave et al., “Proxies, Application Interfaces, and Distributed Systems,” Proceedings International Workshop on Object Orientation in Operating Systems, pp. 212-220 (Sep. 24, 1992) XP002009478.Applicant
- Howard et al., Scale and Performance in a Distributed File System, ACM Transactions on Computer Systems, vol. 6, No. 1, Feb. 1988, pp. 51-81.Applicant
- Cardelli, Obliq, A lightweight language for network objects, Nov. 5, 1993, pp. 1-37.Applicant
- Dijkstra, Self-stabilizing Systems in Spite of Distributed Control, Communications of the ACM, vol. 17, No. 11, Nov. 1974, pp. 643-644.Applicant
- Ousterhout et al., The Sprite Network Operating System, Computer, IEEE, Feb. 1988, pp. 23-36.Applicant
- Dourish, A Divergence-Based Model of Synchrony and Distribution in Collaborative Systems, Xerox Technical Report EPC-1194-102, 1994, pp. 1-10.Applicant
- Sharrott et al., ObjectMap: Integrating High Performance Resources into a Distributed Object-oriented Environment, ICODP, 1995.Applicant
- Birrell et al., Grapevine: An Exercise in Distributed Computing, Communication of the ACM, vol. 25, No. 4, Apr. 1982, pp. 260-274.Applicant
- Transparent Network Computing, Locus Computing Corporation, Jan. 5, 1995.Applicant
- Gray et al., Leases: An Efficient Fault-Tolerant Mechanism for Distributed File Cache Consistency, ACM, 1989, pp. 202-210.Applicant
- Lamport et al., The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems, vol. 4, No. 3, Jul. 1982, pp. 382-401.Applicant
- Dolev et al., On the Minimal Synchronism Needed for Distributed Consensus, Journal of the ACM, vol. 34, No. 1, Jan. 1987, pp. 77-97.Applicant
- Mummert et al., Long Term Distributed File Reference Tracing: Implementation and Experience, Carnegie Mellon University School of Computer Science, Nov. 1994, pp. 1-28.Applicant
- Gelernter et al., Parallel Programming in Linda, Yale University, Jan. 1985, pp. 1-21.Applicant
- Cannon et al., Adding Fault-Tolerant Transaction Processing to LINDA, Software-Practice and Experience, vol. 24(5), May 1994, pp. 449-466.Applicant
- Kambhatla et al., Recovery with Limited Replay: Fault-Tolerant Processes in Linda, Oregon Graduate Institute, Technical Report CSIE 90-019, Sep. 1990, pp. 1-16.Applicant
- Anderson et al., Persistent Linda: Linda + Transactions + Query Processing, Proceedings of the 13th Symposium on Fault Tolerant Systems, 1994, pp. 93-109.Applicant
- Gelernter, Generative Communication in Linda, ACM Transactions on Programming Languages and Systems, vol. 7, No. 1, Jan. 1985, pp. 80-112.Applicant
- Carriero et al., Distributed Data Structures in Linda, Principals of Programming Language, 1986, pp. 1-16.Applicant
- Pinakis, Using Linda as the Basis of an Operating System Microkernel, University of Western Australia, Department of Computer Science, Aug. 1993, pp. 1-165.Applicant
- LINDA Database Search, Jul. 20, 1995, pp. 1-68.Applicant
- Carriero et al., Distributed Data Structures in Linda, Yale Research Report YALEU/DCS/RR-438, Nov. 1985.Applicant
- Agha et al., Actorspaces: An Open Distributed Programming Paradigm, University of Illinois, Report No. UIUCDCS-R-92-1766, Open Systems Laboratory TR No. 8, Nov. 1992, pp.1-12.Applicant
- Ahmed et al., A Program Building Tool for Parallel Applications, Yale University, Dec. 1, 1993, pp. 1-23.Applicant
- Liskov et al., Distributed Object Management in Thor, International Workshop on Distributed Object Management, 1992, pp. 12.Applicant
- Birrell et al., Network Objects, DEC SRC Research Report 115, Feb. 28, 1994.Applicant
- Birrell et al., Distributed Gargage Collection for Network Objects, DEC SRC Research Report 116, Dec. 15, 1993.Applicant
- Wollrath et al., A Distributed Object Model for the Java™ System, USENIX Association, Conference on Object-Oriented Technologies and Systems, Jun. 17-21, 1996.Applicant
- Harris et al., Proposal for a General Java Proxy Class for Distributed Systems and Other Uses, Netscape Communications Corp., Jun. 25, 1997.Applicant
- Hamilton, Java and the Shift to Net-Centric Computing Computer, Aug. 1996, pp. 31-39.Applicant
- Chung et al., A ‘Tiny’ Pascal Compiler: Part 1: The P-Code Interpreter, BYTE Publications, Inc., Sep. 1978.Applicant
- Chung et al., A ‘Tiny’ Pascal Compiler: Part 2: The P-Compiler, BYTE Publications, Inc., Oct. 1978.Applicant
- Thompson, Regular Expression Search Algorithm, Communications of the ACM, vol. II, No. 6, p. 149 et seq., Jun. 1968.Applicant
- Mitchell et al., Mesa Language Manual, Xerox Corporation.Applicant
- McDaniel, An Analysis of a Mesa Instruction Set, Xerox Corporation, May 1982.Applicant
- Pier, A Retrospective on the Dorado, A High-Performance Personal Computer, Xerox Corporation, Aug. 1983.Applicant
- Pier, A Retrospective on the Dorado, A High-Performance Personal Computer, IEEE Conference Proceedings, The 10th Annual international Symposium on Computer Architecture, 1983.Applicant
- Krasner, The Smalltalk-80 Virtual Machine, BYTE Publications Inc., Aug. 1991, pp. 300-320.Applicant
- Operating Systems Review, ACM Press, vol. 27, No. 5, Dec. 1993, pp. 217-230.Applicant
- Remote Method Invocation Specification, Sun Microsystems, Inc., (1997), http://java.sun.com/products/jdk/1.1/docs/guide/rmi/spec/rmiTOC.doc.html.Applicant
- Kolodner et al., “Atomic Garbage Collection: Managing a Stable Heap,” ACM, 1989, pp. 15-25.Applicant
- 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.Applicant
- “Consumers Can View, Share Picture On-Line as Kodak Picture Network Goes ‘Live’,” Business Wire, Aug. 25, 1997, pp. 18-19.Applicant
- “Eden Project Proposal,” Department of Computer Science, University of Washington, Oct. 1980, Technical Report #80-10-01, cover and Foreword.Applicant
- “ISN Dataweb Sells Software, Hardware,” Datamation, Apr. 1, 1996, p. 40.Applicant
- “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.Applicant
- “Kodak demonsrates leadership across entire photographic category,” M2 Presswire, Feb. 13, 1998, pp. 31-35.Applicant
- “Kodak PhotoNet Online Makes It a Snap to Share Summer Photos,” PR Newswire, Jul. 2, 1998, pp. 63-64.Applicant
- “Kodak Picture Network Sends Prints Home From the Holidays,” Business Wire, Dec. 29, 1997, pp. 58-60.Applicant
- “Photo processing made easy on the Internet; Storm Software and PictureVision Team up with Konica Corp.,” Business Wire, Feb. 22, 1996, pp. 3-4.Applicant
- “Seeing your photos a whole new way,” Business Wire, Dec. 12, 1996, pp. 9-10.Applicant
- “Webwatch: MCI Announces Internet Access,”, Boardwatch Magazine, Jan. 1995.Applicant
- Administrator's Guide, Netscape Enterprise Server, Version 3.0, Netscape Communications Corp., 1998.Applicant
- 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.Applicant
- Almes et al., “Research in Integrated Distributed Computing,” Department of Computer Science, University of Washington, Oct. 1979, pp. 1-42.Applicant
- 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.Applicant
- 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.Applicant
- 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.Applicant
- 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.Applicant
- Bandrowski, “Stores Without Doors: Kiosks Generate New Profits,” Corporate Computing, Oct. 1992, pp. 193-195.Applicant
- Begole et al., “Transparent Sharing of Java Applets: A Replicated Approach,” Oct. 1997, pp. 55-65.Applicant
- Black et al., “A Language for Distributed Programming,” Department of Computer Science, University of Washington, Technical Report 86-02-03, Feb. 1986, p. 10.Applicant
- Black et al., “Distribution and Abstract Types in Emerald,” University of Washington, Technical Report No. 85-08-05, Aug. 1985, pp. 1-10.Applicant
- Black et al., “Object Structure in the Emerald System,” University of Washington, Technical Report 86-04-03, Apr. 1986, pp. 1-14.Applicant
- 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.Applicant
- Black, “Supporting Distributed Applications: Experience with Eden,” Department of Computer Science, University of Washington, Technical Report 85-03-02, Mar. 1985, pp. 1-21.Applicant
- 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.Applicant
- 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.Applicant
- Braine et al., “Object-Flow,” 1997, pp. 418-419.Applicant
- Bruno, “Working the Web,” Data Communications, Apr. 1997, pp. 50-60.Applicant
- Ciancarini et al., “Coordinating Distributed Applets with Shade/Java,” Feb. 1998, pp. 130-138.Applicant
- Cohen, “Electronic Commerce,” USC/Information Sciences Institute, Oct. 1989.Applicant
- Conhaim, “Online shopping: a beginner's guide; includes related listing of videotex services,” Link-Up, vol. 5, No. 6, p. 32, Nov. 1988.Applicant
- Delcambre et al., “Simulation of the Object Flow Model: A Conceptual Modeling Language for Object-Driven Applications,” 1993, pp. 216-225.Applicant
- 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.Applicant
- Ellsworth, “Boom Town,” Internet World, Jun. 1995, pp. 33-35.Applicant
- Estrin, “Inter-Organization Networks: Implications of Access Control Requirements for Interconnection Protocols,” ACM, 1986, pp. 254-263.Applicant
- Fleischer, “SkyMall's ‘Supplier Network’ Takes Flight”, Retailtech, The Technology Magazine for Retail Executives, Apr. 1997.Applicant
- Foley, “Managing Campus-Wide Information Systems: Issues and Problems,” Capitalizing on Communication, ACM SIGUCCS XVII, 1989, pp. 169-174.Applicant
- Fryxell, “eaasySABRE,” Link-Up, May/Jun. 1996, pp. 10-11.Applicant
- Gardner, “Kodak Follows Startup Into Online Photo Processing Business,” Internet World, Sep. 8, 1997, pp. 5-6.Applicant
- Gogan et al., “Open Market, Inc.: Managing in a Turbulent Environment,” Harvard Business School Publishing, Aug. 29, 1996, pp. 1-30.Applicant
- Goldberg et al., “Smalltalk-80—The Language and its Implementation,” Xerox Palo Alto Research Center, 1983 (reprinted with corrections, Jul. 1985), pp. 1-720.Applicant
- Hodges, Douglas, “Managing Object Lifetimes in OLE,” Aug. 25, 1994, pp. 1-41.Applicant
- 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.Applicant
- Hsu, “Reimplementing Remote Procedure Calls,” University of Washington, Thesis, Mar. 22, 1985, pp. 1-106.Applicant
- Hutchinson, “Emerald: An Object-Based Language for Distributed Programming,” a Dissertation, University of Washington, 1987, pp. 1-107.Applicant
- Israel et al., “Authentication in Office System Internetworks,” ACM Transactions on Office Information Systems, vol. 1, No. 3, Jul. 1983, pp. 193-210.Applicant
- 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.Applicant
- Jul, “Object Mobility in a Distributed Object-Oriented System,” a Dissertation, University of Washington, 1989, pp. 1-154 (1 page Vita).Applicant
- Keller, “Smart Catalogs and Virtual Catalogs,” Proceedings of the First USENIX Workshop of Electronic Commerce, USENIX Association, Jul. 11-12, 1995, pp. 125-131.Applicant
- Kline et al., “TRADE'ex: The Stock Exchange of the Computer Industry,” Harvard Business School Publishing, 1996, pp. 1-14.Applicant
- Kodak Photonet Faq, PhotoNet Online, Jun. 14, 2002, pp. 1-3.Applicant
- Koshizuka et al., “Window Real-Objects: A Distributed Shared Memory for Distributed Implementation of GUI Applications,” Nov. 1993, pp. 237-247.Applicant
- 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.Applicant
- Krasner et al., “Smalltalk-80: Bits of History, Words of Advice,” 1983, Xerox Corporation, pp. 1-344.Applicant
- Lampson et al., “Authentication in Distributed Systems: Theory and Practice,” ACM Transactions n Computer Systems, vol. 10, No. 4, Nov. 1992, pp. 265-310.Applicant
- Lansky, “Without APS, Photo Life Goes on Via Internet,” Photographic Trade News, Aug. 1996, pp. 19-23.Applicant
- Lavana et al., “Executable Workflows: A Paradigm for Collaborative Design on the Internet,” Jun. 1997, 6 pages.Applicant
- Lewis, “Pacific Bell, MCI to Expand Internet Service,” The New York Times, sec. D, col. 1 at 3, Mar. 28, 1995.Applicant
- LightSurf Instant Imaging—Press Releases, “Kodak And LightSurf Collaborate On Kodak Picture Center Online,” LifeSurf Technologies Inc., Jun. 14, 2002, pp. 1-3.Applicant
- Louwerse et al., “Data Protection Aspects in an Integrated Hospital Information System,” North-Holland Computers & Security 3, 1984, pp. 286-294.Applicant
- McEnaney, “Point-and-Click Memory Sharing; Launches PhotoNet online digital photography and imaging services,” Photographic Trade News, Sec. p. 23, Jan. 1997.Applicant
- Miller, “Web posting as a photo processing option,” USA Today, Section: Life, p. 17D, Dec. 13, 1996.Applicant
- Morris et al., “Andrew: A Distributed Personal Computing Environment,” Communications of the ACM, vol. 29, No. 3, Mar. 1986, pp. 184-201.Applicant
- O'Mahony, “Security Considerations in a Network Management Environment,” IEEE Network, May/Jun. 1994, pp. 12-17.Applicant
- 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.Applicant
- Petersen, “New But Not Improved,” Direct Magazine, Nov. 1995.Applicant
- Press Release, “Sun Goes Live With The Kodak Picture Network,” Sun Microsystems, Inc., Jun. 14, 2002, pp. 1-2.Applicant
- Proceedings of the Eighth Symposium on Operating Systems Principles, Dec. 14-16, 1981, ACM, Special Interest Group on Operating Systems, Association for Computing Machinery, vol. 15, No. 5, Dec. 1981, ACM Order No. 534810.Applicant
- 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.Applicant
- Pu, “Replication and Nested Transaction in the Eden Distributed System,” Doctoral Dissertation, University of Washington, Aug. 6, 1986, pp. 1-179 (1 page Vita).Applicant
- Raeder, “Is there a Prodigy in your future?,” Database Searcher, vol. 5, No. 6, p. 18.Applicant
- 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.Applicant
- Satyanarayanan, “Integrating Security in a Large Distributed System,” ACM Transactions on Computer Systems, vol. 7, No. 3, Aug. 1989, pp. 247-280.Applicant
- 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.Applicant
- Senn, “Capitalizing on Electronic Commerce: The Role of the Internet in Electronic Markets,” Information Systems Management, Summer 1996, pp. 15-24.Applicant
- Steinke, “Design Aspects of Access Control in a Knowledge Base System,” Computers & Security, 10, 1991, pp. 612-625.Applicant
- Stern, “Industry Net,” Link-Up, Mar./Apr. 1995, p. 10.Applicant
- Tanenbaum et al., “Distributed Operating Systems,” Computing Surveys, vol. 17, No. 4, Dec. 1985, pp. 419-470.Applicant
- The Wall Street Journal, “Barclays Is Opening An ‘Electronic Mall’ For Internet Shopping,” Tech. & Health Section at B2, Jun. 1, 1995.Applicant
- The Wall Street Journal, “Prodigy Plans to Announce Internet ‘Electronic Mail’,” Tech. Section at B5, Nov. 27, 1995.Applicant
- Trehan et al., “Toolkit for Shared Hypermedia on a Distributed Object Oriented Architecture,” 1993, pp. 1-8.Applicant
- Trommer, “Thomas Unveils Online Purchasing Network—Eases Product Sourcing And Ordering Through EDI,” Electronic Buyers' News at 60, Dec. 11, 1995.Applicant
- Van Den Berg et al., “Advanced Topics of a Computer Center Audit,” North-Holland Computers & Security 3, 1984, pp. 171-185.Applicant
- Van Der Lans, “Data Security in a Relational Database Environment,” North-Holland Computers & Security 5, 1986, pp. 128-134.Applicant
- Welz, “New Deals: A ripening Internet market, secure systems and digital currency are reshaping global commerce,” Internet World, Jun. 1995, pp. 36-41.Applicant
- Wobber et al., “Authentication in the Taos Operating System,” ACM, 1993, pp. 256-269.Applicant
- Wyatt, “Netscape Enterprise Server,” Prima Publishing, 1996.Applicant