Electrical computers and digital processing systems: multicomput – Computer network managing – Computer network access regulating
Reexamination Certificate
1999-12-09
2002-12-31
Barot, Bharat (Department: 2154)
Electrical computers and digital processing systems: multicomput
Computer network managing
Computer network access regulating
C709S200000, C709S202000, C709S203000, C709S217000, C707S793000, C707S793000, C707S793000
Reexamination Certificate
active
06502134
ABSTRACT:
FIELD OF THE INVENTION
The present invention is generally related to computer networking. More specifically, the present invention includes a mechanism that provides application-layer information persistence and exchange. This mechanism is scalable, generically applicable, transparently-distributed and based on the tuple-space model.
BACKGROUND OF THE INVENTION
Most modern computer systems are designed to use a layered approach to interprocess communication and networking. The layered approach subdivides the tasks associated with interprocess communication and networking into levels of abstraction. This has been found to be an effective method for reducing the complexity and increasing the reliability of programs and systems that use interprocess communication.
The International Organization for Standardization (ISO) has promulgated a commonly used standard that embodies a layered approach of this type. This standard, know as the ISO Network Reference Model, is based on seven different levels of abstraction. The seven layers are known as the application, presentation, session, transport, network, data link and physical layers.
The communications protocols used in the lower levels of the ISO Network Reference Model (i.e., the transport, network, data link and physical layers) are relatively well defined. As a result, these protocols tend to be used, for almost all applications that perform interprocess communication.
Unfortunately, this type of homogeneity does not really exist at higher levels of the ISO Network Reference Model. Entities at these levels (i.e., the application, presentation and session layers) tend to interact with their peers using special-purpose protocols. Not surprisingly, this type of one off use does little to further the overall effectiveness of the ISO Network Reference Model. Instead, there is a tendency towards increased complexity and lost opportunities for software reuse.
The ISO Network Reference Model is, unfortunately, not the only networking environment that exhibits this lack of homogeneity. In fact, these symptoms are generally present (to a greater or lesser extent) in all layered interprocess communication and networking systems.
For these and other reasons, a need exits for more generic methods that provide interprocess communication at higher levels of layered interprocess communication and networking systems. Methods of this type would preferable provide uniform interprocess communication protocols at the application level of the ISO Network Reference Model. These methods would also preferably be scalable to work in networks of all sizes without significant performance degradation.
SUMMARY OF THE INVENTION
The present invention includes a method and apparatus for providing application-layer information persistence and exchange. For an exemplary embodiment, an information space is constructed to span a group of one or more server systems. The information space is based on the tuple-space paradigm first introduced for the Linda coordination model. A coordination entity manages storage of tuples within the information space. The coordination entity determines where in the information space tuples are stored. The coordination entity makes this determination both at initial tuple storage and as tuples are moved to achieve load balancing and other goals.
Applications access stored tuples by requesting the tuple from their local servers. If the local server knows where the tuple is stored, the local server forwards the request directly to the storing server. In the alternative, (i.e., where the local server does not know where a tuple is stored), the local server queries the coordination entity for the tuple's location. The local server then uses the query result to request the tuple from the storing server. In this case the local server also records the location of the tuple for future reference. This allows the local server to directly request the tuple on subsequent accesses.
In some cases, a tuple will have moved after a local server has noted its previous location. If that local server requests the moved tuple, the previously storing server will receive the request. In this case, the previously storing server generates a re-route exception. The re-route exception causes the local server to query the coordination entity to determine the tuple's new location. This new location is then noted by the local server for future requests.
The use of tuples and tuple matching allows applications to use a common, flexible, lightweight format for information persistence and interchange. The applications may be local or remote and of heterogeneous types.
Advantages of the invention will be set forth, in part, in the description that follows and, in part, will be understood by those skilled in the art from the description herein. The advantages of the invention will be realized and attained by means of the elements and combinations particularly pointed out in the appended claims and equivalents.
REFERENCES:
patent: 5774660 (1998-06-01), Brendel et al.
patent: 5860010 (1999-01-01), Attal
patent: 5881315 (1999-03-01), Cohen
patent: 5963642 (1999-10-01), Goldstein
patent: 5963947 (1999-10-01), Ford et al.
patent: 5964841 (1999-10-01), Rekhter
patent: 5974420 (1999-10-01), Lehman et al.
patent: 6029160 (2000-02-01), Cabrera et al.
patent: 6094673 (2000-07-01), Dilip et al.
patent: 6112242 (2000-08-01), Jois et al.
patent: 6115715 (2000-09-01), Traversat et al.
patent: 6119157 (2000-09-01), Traversat et al.
patent: 6151624 (2000-11-01), Teare et al.
patent: 6195652 (2001-02-01), Fish
patent: 6301584 (2001-10-01), Ranger
patent: 404287121 (1992-10-01), None
Sun, J. et al., “Searching the World-Wide Web Using Signature Files,” Computer Science and EE Dept., University of Maryland Baltimore County, MD, no date, 4 pp.
Linda User's Guide & Reference Manual, Version 0.3, Scientific Computing Associates, Jan., 1995.
Bray et al., eds., “Extensible Markup Language (XML) 1.0,” w3.org/TR/REC-xml, Apr. 3, 1999, pp. 1-37.
A. I. T. Rowstron et al., “BONITA: A set of tuple space primitives for distributed coordination,” IEEE System Sciences Proceedings 1997, pp. 379-388.
Widergren et al., “XML for Data Exchange,” Power Engineering Society Meeting, Jul. 1999, IEEE pp. 840-842.
Downs Heather L.
Fitzwilson Robert C.
Makarios Selene K.
Barot Bharat
NextPage, Inc.
Skjerven Morrill LLP
LandOfFree
Tuple-based information space for data exchange between... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Tuple-based information space for data exchange between..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tuple-based information space for data exchange between... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2998243