Patent US5951706A successfully refreshed from Google Patents.
US5951706A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of independent simultaneous queueing of message descriptors
Assignee: Google LLC
•
Filing: 1997-06-30
•
Granted: 1999-09-14
•
Expires: 2017-06-30
Abstract
Abstract Two independent pointers within a message descriptor are used to link the message descriptor to various queues during transmission of a message from a sender node to a receiver node within a computer environment. In particular, one pointer is used to link the message descriptor on either a pending send queue or a send queue, while the other pointer is used to link the message descriptor on either an unacknowledged queue or an acknowledged queue. For example, when a message is sent, it is removed from the send queue using one pointer and placed on the unacknowledged queue using the other pointer. Further, if the message is resent, it is linked back onto the send queue using the send queue pointer without disturbing the order of the message on the unacknowledged queue. Thus, ordering of message transmission is preserved, even when a message is sent multiple times.
Inventors
- 👤 Alan Frederic Benner
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 07:59
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/54; G06F9/546
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
76 words
A method of sending messages within a computer environment, said method comprising: sending a message from a sender of said computer environment to a receiver of said computer environment, said sending comprising: removing a descriptor of said message from a first data structure using a first pointer of said descriptor; and appending said descriptor to a second data structure using a second pointer of said descriptor, said first and second pointers being independent of one another.
Claim 2
Independent Claim
76 words
A method of sending messages within a computer environment, said method comprising: sending a message from a sender of said computer environment to a receiver of said computer environment, said sending comprising: removing a descriptor of said message from a first data structure using a first pointer of said descriptor; and appending said descriptor to a second data structure using a second pointer of said descriptor, said first and second pointers being independent of one another.
Claim 3
Dependent Claim
67 words
The method of claim 1, wherein said appending comprises: setting said second pointer of said descriptor to null indicating said descriptor is currently the last element of said second data structure; and updating said second pointer of a previous descriptor appended to said second data structure, if said previous descriptor exists, to reflect that said descriptor being appended is the next linked element to said previous descriptor.
Claim 4
Dependent Claim
45 words
The method of claim 1, further comprising receiving, by said sender, an acknowledgement from said receiver indicating receipt of said message, said receiving comprising removing said descriptor from said second data structure and appending said descriptor to a third data structure using said second pointer.
Claim 5
Dependent Claim
61 words
The method of claim 3, wherein said first data structure comprises one or more descriptors capable of being received by said receiver, said second data structure comprises one or more descriptors that has been sent to said receiver, but not acknowledged by said receiver, and said third data structure comprises one or more descriptors that has been acknowledged by said receiver.
Claim 6
Dependent Claim
32 words
The method of claim 3, wherein said removing, said appending said descriptor to said second data structure, and said receiving are performed by one or more hardware elements of said computer environment.
Claim 7
Dependent Claim
53 words
The method of claim 1, further comprising resending said message from said sender to said receiver, said resending comprising appending said descriptor to said first data structure using said first pointer, wherein said descriptor also remains on said second data structure and ordering of said descriptor on said second data structure is maintained.
Claim 8
Dependent Claim
74 words
The method of claim 6, wherein said appending said descriptor to said first data structure comprises: setting said first pointer of said descriptor to null indicating said descriptor is currently the last element of said first data structure; and updating said first pointer of a previous descriptor appended to said first data structure, if said previous descriptor exists, to reflect that said descriptor being appended is the next linked element to said previous descriptor.
Claim 9
Dependent Claim
20 words
The method of claim 6, further comprising removing said descriptor from said first data structure, after said message is resent.
Claim 10
Dependent Claim
25 words
The method of claim 6, further comprising removing said descriptor from said second data structure when receipt of said message is acknowledged by said receiver.
Claim 11
Dependent Claim
29 words
The method of claim 9, further comprising appending said descriptor to a third data structure using said second pointer, after said descriptor is removed from said second data structure.
Claim 12
Dependent Claim
34 words
The method of claim 1, further comprising appending said descriptor, using said first pointer, to a pending send data structure prior to sending said message, when said receiver is incapable of receiving said message.
Claim 13
Dependent Claim
38 words
The method of claim 11, further comprising removing said descriptor, using said first pointer, from said pending send data structure and appending said descriptor to said first data structure, when said receiver is capable of receiving said message.
Claim 14
Independent Claim
84 words
A method of queueing messages within a computer environment, said method comprising: using a first pointer of a message descriptor to link said message descriptor to a first data structure; and using a second pointer of said message descriptor to link said message descriptor to a second data structure, wherein said first and second pointers are independent of one another and wherein said message descriptor is appended to both said first data structure and said second data structure for a certain amount of time.
Claim 15
Independent Claim
84 words
A method of queueing messages within a computer environment, said method comprising: using a first pointer of a message descriptor to link said message descriptor to a first data structure; and using a second pointer of said message descriptor to link said message descriptor to a second data structure, wherein said first and second pointers are independent of one another and wherein said message descriptor is appended to both said first data structure and said second data structure for a certain amount of time.
Claim 16
Dependent Claim
49 words
The method of claim 13, wherein appending of said message descriptor to said second data structure indicates receipt of a message corresponding to said message descriptor is to be acknowledged, and wherein appending of said message descriptor to said first data structure indicates retransmission of said message is required.
Claim 17
Dependent Claim
41 words
The method of claim 14, further comprising removing said message descriptor from said first data structure after retransmission of said message and removing said message descriptor from said second data structure after receipt of said message by said receiver is acknowledged.
References Cited (Backward Citations)
US5027316A
Cited
US4829425A
Cited
US5212778A
Cited
US5347632A
Cited
US5170480A
Cited
US5218680A
Cited
US5511166A
Cited
US5513320A
Cited
US5260933A
Cited
EP0578013A1
Cited
US5392396A
Cited
US5511165A
Cited
US5729710A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-09-13 | 2003-03-15 | 2003-09-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-09-13 | 2007-03-15 | 2007-09-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-09-13 | 2011-03-15 | 2011-09-14 | $7700.00 | Window Closed / Lapsed |