The present invention relates to the field of software architecture. In particular, the present invention discloses a method for dynamically matching a server and a client over a secure connection and providing information asynchronously between the client and the server, while utilizing a flow control of the information.
Large data centers that are used to transmit customer information, credit card information or the like inherently have many problems. For most of the data centers, the biggest issues are lack of security, decreased quality of performance, scalability issues, and version flexibility to support application sharing among customers (multi-tenancy).
As the number of customers of a data center increases or if a data center has multiple locations serving multiple customers, security may decrease. Security issues are of great importance for these data centers that serve multiple clients (i.e., banking and financial institutions), as they may have competitors who are generally “hostile” toward one another. It is therefore necessary to provide a secure connection that allows client information to be sent through these data centers without compromising the security of the information.
With data centers being spread over multiple locations, dramatic decreases in guaranteed performance may also occur. It is necessary for a system in which shared use of a data center in multiple locations does not diminish performance.
A further issue with respect to the larger data centers is the problem of adaptability. In an application-sharing model, small customers share the same application. As customer use grows, the data centers must then be able to adapt to this increased growth. Unless adaptation can take place, the economies of scale will not allow for decreased costs. However, if the data centers are able to expand easily, the sharing of the applications becomes much more cost effective.
Version flexibility may also become a large problem because various customers may have different software version requirements, thus requiring multiple versions to be in use simultaneously. The architecture must be able to adapt to a variety of customer versions or the sharing of applications cannot work well. Additionally, the upgrade policy within the data centers must be flexible enough to allow client software to remain intact while server software is upgraded because it is unreasonable to demand a synchronous upgrade of all client software in the ASP setting.
Various software applications, including CORBA® (a registered trademark of Object Management Group, Inc), Microsoft COM/DCOM, ENTERPRISE JAVABEANS® (a registered trademark of Sun Microsystems, Inc), and others, have attempted to address these problems. But none of these applications have been able to satisfactorily address all problems.
Thus a need exists for a new software architecture that avoids those shortcomings, and allows information to be transmitted securely between a client and a server.
In accordance with the teachings of the present invention, a method for dynamically matching a first and a second process, the first and second processes being matched using a library, the first and second processes utilizing a secure flow control of information and being connected asynchronously, is disclosed.
Other objects, features, and advantages of the present invention will be apparent from the accompanying drawings and from the detailed description that follows below.
The present invention will be described by way of exemplary embodiments, but not limitations, illustrated in the accompanying drawings in which like references denote similar elements, and in which:
In the following description, various aspects of the present invention will be described. However, it will be apparent to those skilled in the art that the present invention may be practiced with only some or all aspects of the present invention. For purposes of explanation, specific configurations are set forth in order to provide a thorough understanding of the present invention. However, it will also be apparent to one skilled in the art that the present invention may be practiced without the specific details. In other instances, well-known features are omitted or simplified in order not to obscure the present invention.
Referring now to
The structure 100 is a message passing software architecture that allows information to be passed between a client (a first process) and a server (a second process). The transport layer 108 provides the connection between the client and the server so information may be passed.
Appendix A contains a complete description of the Exigen Object Library (EOL); and Appendix B describes the Exigen Object Definition Language (EODL), a novel definition language that defines elements of the EOL. An advantage of the EOL is that objects created by the EOL are always stateful. This is greatly beneficial because there is no known way to consistently implement a security mechanism with stateless objects. These shall be deemed examples of an implementation for illustration, and not as the only way to implement the invention.
As is typical in a computing environment,
As an example, most object interface changes add new methods or fields. The object types that differ structurally may still be compatible, allowing the client 201 to safely continue to interact with the newer server 200. However, an object may change behavior in ways that break compatibility between the client 201 and the server 200. To ensure compatibility, type structures are compared. When client 201 and server 200 have object types with the same name and same behavior version numbers, they are considered to be of the same type and compatibility is acknowledged. Due to dynamic matching, no mandatory upgrade of the client side 201 is required or necessary, so therefore it is easier for one software instance to operate on different data sets, and vice versa. Also, scripts can be handed over dynamically, which allows execution of a script on a client 201 pushed 211 by a server 200. If the object types are matched from the server 200 to the client 201 and found compatible, then information may be pushed 211 or pulled 210 between them.
Another very important and distinctive aspect of the novel art of this disclosure is that instead of using a fixed connection, a flow control is relied upon from the transport layer 108. When information is pushed 211 or pulled 210 from the client 201 to the server 200, the flow control provides a buffer at the origin of the flow so that there is no overflow of information to the recipient of the flow. For example, if a client 201 is sending information to a server 200, the flow control makes sure that the information does not overflow the server 200. The flow control chokes the stream going into the server 200, and the information provided by the client 201 is backed up on the client side 201, rather than the server side 200. This novel functionality allows data centers to be spread out over multiple locations, providing services to multiple users, while not overloading a server 200 with information from one specific client 201. Hence, such novel functionality adds an additional safety valve against clogging of multisite processing.
As described in detail in Appendix B, sections 3–10.5, the EODL has descriptions for the following items: basic types, scripts, data streams (meaning open channels), dynamic state structure, security, cookies, and object reference.
The lifecycle of the server object is decided by the server 200 itself—the client 201 does not manage the lifecycle.
If access permission is authorized, the object references may be stored or passed between different client 201 processes. The security model also includes a version compatibility check, so that a client 201 can only reach those versions for which it has been cleared.
Appendix C further describes the cooperation between server 200 and client 201 objects; and Appendix D describes the nameserver system, which is rather novel.
Subdirectories 512a and 512b manage objects 513a–n. One of the directories 512b in nameserver-1510 then forms the root for nameserver-2520. Nameserver-2520 has its own internal root 521, and an additional layer of subdirectories 522a–n that manage objects 523a–n. Therefore, in essence, additional nameservers, directories, functional compatibility management servers, etc., are just additional clients to the root directory server. Each object 513a–n, 523a–n has a given name. The directory and nameserver managing that object then know the rights and locking capabilities of that object.
An application (i.e., activation manager application) is first run which uses the EOL to access a service such as computer authentication. A reference is then returned to the server's operational namespace 500 that contains the activation manager's configuration for the server and the references for the namespaces of individual server processes. The server process obtains its configuration from its namespace 500, as delegated by the activation manager, and performs initialization. Then using references to the user root nameserver from the configuration objects, the server process registers its service objects with these root nameservers, thus exposing the resources to users.
A further inventive aspect of this disclosure is that EOL programming provides a consistent way for asynchronous single-thread server implementations. The method invocation of an object, using EOL, is asynchronous (nonblocking)—while the server waits for the results, it can go on with other events in order to be as efficient as possible.
The above embodiments can also be stored on a device or machine-readable and be read by a machine to perform instructions. The machine-readable medium includes any mechanism that provides (i.e., stores and/or transmits) information in a form readable by a machine (e.g., a computer). For example, a machine-readable medium includes read only memory (ROM); random access memory (RAM); magnetic disk storage media; optical storage media; flash memory devices; etc.). The device or machine-readable medium may include a solid state memory device and/or a rotating magnetic or optical disk. The device or machine-readable medium may be distributed when partitions of instructions have been separated into different machines, such as across an interconnection of computers.
While certain exemplary embodiments have been described and shown in the accompanying drawings, it is to be understood that such embodiments are merely illustrative of and not restrictive on the broad invention, and that this invention not be limited to the specific constructions and arrangements shown and described, since various other modifications may occur to those ordinarily skilled in the art.
The present application claims priority to the provisional filed application entitled Novel Dynamic Object Library Software Architecture, filed on May 21, 2001, Ser. No. 60/292,834, which is also incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
4156798 | Doelz | May 1979 | A |
5295188 | Wilson et al. | Mar 1994 | A |
5351293 | Michener et al. | Sep 1994 | A |
5421012 | Khoyi et al. | May 1995 | A |
5826265 | Van Huben et al. | Oct 1998 | A |
5828840 | Cowan et al. | Oct 1998 | A |
5848354 | Kamalski | Dec 1998 | A |
5878408 | Van Huben et al. | Mar 1999 | A |
5933599 | Nolan | Aug 1999 | A |
6016393 | White et al. | Jan 2000 | A |
6058393 | Meier et al. | May 2000 | A |
6105063 | Hayes, Jr. | Aug 2000 | A |
6119130 | Nguyen et al. | Sep 2000 | A |
6119157 | Traversat et al. | Sep 2000 | A |
6131121 | Mattaway et al. | Oct 2000 | A |
6141759 | Braddy | Oct 2000 | A |
6185184 | Mattaway et al. | Feb 2001 | B1 |
6185680 | Shimbo et al. | Feb 2001 | B1 |
6189101 | Dusenbury, Jr. | Feb 2001 | B1 |
6195680 | Goldszmidt et al. | Feb 2001 | B1 |
6212633 | Levy et al. | Apr 2001 | B1 |
6226678 | Mattaway et al. | May 2001 | B1 |
6360266 | Pettus | Mar 2002 | B1 |
6374308 | Kempf et al. | Apr 2002 | B1 |
6381742 | Forbes et al. | Apr 2002 | B1 |
6405317 | Flenley et al. | Jun 2002 | B1 |
6499137 | Hunt | Dec 2002 | B1 |
6532591 | Arai et al. | Mar 2003 | B1 |
6654805 | Aldred et al. | Nov 2003 | B1 |
6664982 | Bi | Dec 2003 | B1 |
6697340 | Christie et al. | Feb 2004 | B1 |
Number | Date | Country | |
---|---|---|---|
20040015926 A1 | Jan 2004 | US |
Number | Date | Country | |
---|---|---|---|
60292834 | May 2001 | US |