US6003085A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for context sensitive pathsend
Assignee: Hewlett Packard Development Co LP
•
Filing: 1998-09-25
•
Granted: 1999-12-14
•
Expires: 2018-09-25
Abstract
Abstract An improved method and apparatus for creating a context-sensitive pathsend in a asynchronous data packet network of the kind used typically in on-line transaction processing where a particular receiving server in a server pool must communicate with a particular originating client. By piggybacking messages and employing run-time binding to create a logical connection between the server and client, the present invention achieves a dramatic improvement in processing data packets and minimizing system resources. In a preferred embodiment the invention is backwardly compatible with existing context-free applications.
Inventors
- 👤 Mitchell Ratner
- 👤 Michael R. Blevins
- 👤 David J. Schorow
- 👤 Rodney T. Limprecht
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 04:52
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/40
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
143 words
A method of creating a context-sensitive pathsend in a server-client node network to minimize the costs of maintaining a dialogue between server and client comprising: sending client messages from a plurality of client nodes, each client message having specific client requests, to a particular server node; piggy-backing data onto said client messages from said plurality of client nodes, said piggy-backed data including both data related to said specific client requests and data relating to the state of the client-server relationship; responding to said piggy-backed data by sending a plurality of server messages to said plurality of clients; and piggy-backing data onto said server messages, said piggy-backed data including both data related to said specific client requests and data relating to the state of said client-server relationship, whereby said piggy-backed data can decrease the costs of maintaining a dialogue between client and server nodes.
Claim 2
Independent Claim
143 words
A method of creating a context-sensitive pathsend in a server-client node network to minimize the costs of maintaining a dialogue between server and client comprising: sending client messages from a plurality of client nodes, each client message having specific client requests, to a particular server node; piggy-backing data onto said client messages from said plurality of client nodes, said piggy-backed data including both data related to said specific client requests and data relating to the state of the client-server relationship; responding to said piggy-backed data by sending a plurality of server messages to said plurality of clients; and piggy-backing data onto said server messages, said piggy-backed data including both data related to said specific client requests and data relating to the state of said client-server relationship, whereby said piggy-backed data can decrease the costs of maintaining a dialogue between client and server nodes.
Claim 3
Dependent Claim
161 words
The method of claim 1, wherein a temporary dedicated communication is created between at least one of the plurality of client nodes and the server node, said dedicated communication defined by and creating a plurality of states between the client node and the server node, said states monitored by an operating system process application common to both the client node and the server node, said operating system process application residing in an operating system node having a primary memory, the method further comprising the steps of: creating a plurality of object-oriented data structures in said operating system process node primary memory; and linking said plurality of data structures in a predetermined manner according to which of said states are present between the client node and the server node, whereby by traversing the links of said plurality of data structures, the state of said dedicated communication can be ascertained and the particular client and server nodes can be ascertained as a consequence.
Claim 4
Dependent Claim
19 words
The method of claim 1, wherein the step of piggy-backing data includes the step of establishing a dialog ID.
Claim 5
Dependent Claim
19 words
The method of claim 1, wherein the step of piggy-backing data includes the step of establishing a dialog status.
Claim 6
Dependent Claim
35 words
The method of claim 4, wherein the dialog status has one of the following values: FeOK, which indicates that the dialog should be ended, and FeContinue, which indicates that the client should send another request.
Claim 7
Dependent Claim
21 words
The method of claim 1, further comprising the step of sending, by the client, an abort message that ends the dialog.
Claim 8
Dependent Claim
21 words
The method of claim 1, further comprising the step of sending, by the server, an abort message that ends the dialog.
Claim 9
Dependent Claim
22 words
The method of claim 1, further comprising the step of sending, by the operating system, an abort message that ends the dialog.
Claim 10
Dependent Claim
26 words
The method of claim 1, wherein the step of piggy-backing data includes the step of setting up a dialog control block that includes a dialog ID.
References Cited (Backward Citations)
US4646300A
Cited
US5606719A
Cited
US5249293A
Cited
US5619697A
Cited
US5386412A
Cited
US5617570A
Cited
US5546583A
Cited
US5577172A
Cited
US5590266A
Cited
US5634127A
Cited
US5638374A
Cited
US5889957A
Cited
US5649103A
Cited
US5617540A
Cited
US5751708A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-12-13 | 2003-06-14 | 2003-12-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-12-13 | 2007-06-14 | 2007-12-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-12-13 | 2011-06-14 | 2011-12-14 | $7700.00 | Window Closed / Lapsed |