Patent US6938095B2 successfully refreshed from Google Patents.
US6938095B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for establishing and sharing a virtual change notification list among a plurality of peer nodes
Assignee: Parity Networks LLC
•
Filing: 2002-03-21
•
Granted: 2005-08-30
•
Expires: 2022-03-21
Abstract
Abstract A data structure has a list of event objects, one or more producers creating the event objects for the list, and a finite set of consumers accessing the object list. The structure is characterized in that the event objects are each associated with a first reference number indicating the number of consumers currently accessing the event object, and in that, as each consumer completes access the reference number is decremented, and when the reference number for an event object is zero, and the event object is at the head of the list, indicating that all consumers have accessed the object, that event object is removed from the list. A use of the structure for propagating route changes to nodes in a multiple-processor router, and to peer routers in a network is also taught.
Inventors
- 👤 Erol Basturk
- 👤 Vivek Menezes
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 20:11
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/58; G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/54; G06F9/542; G06F9/546; H04L12/00; H04L12/02; H04L12/16; H04L12/18; H04L12/1854; H04L45/02; H04L45/028; H04L45/54; H04L45/56
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
110 words
A data routing software structure on a computer comprising: a list of event objects; one or more producers creating the event objects for the list; and a finite set of consumers accessing the object list; characterized in that the event objects are each associated with a reference number indicating a number of the consumers currently accessing the event object, and in that, as each consumer completes access the reference number is decremented, and when the reference number for an event object is zero, and the event object is at the head of the list, indicating that all consumers have accessed the object, that event object is removed from the list.
Claim 2
Dependent Claim
110 words
A data routing software structure on a computer comprising: a list of event objects; one or more producers creating the event objects for the list; and a finite set of consumers accessing the object list; characterized in that the event objects are each associated with a reference number indicating a number of the consumers currently accessing the event object, and in that, as each consumer completes access the reference number is decremented, and when the reference number for an event object is zero, and the event object is at the head of the list, indicating that all consumers have accessed the object, that event object is removed from the list.
Claim 3
Dependent Claim
34 words
The data routing software structure on the computer of claim 1 wherein the event objects created represent changes in a data base, and the information associated with each is a statement of the change.
Claim 4
Dependent Claim
40 words
The data routing software structure on the computer of claim 2 wherein the data base is a routing information base for a portion of a data packet network, and the information associated with each event object is a route change.
Claim 5
Dependent Claim
26 words
The data routing software structure on the computer of claim 1 wherein each event object comprises a reference to the next event object in the list.
Claim 6
Dependent Claim
33 words
The data routing software structure on the computer of claim 1 wherein each event object comprises a reference to the next event to be processed by a consumer processing a current event object.
Claim 7
Dependent Claim
42 words
The data routing software structure on the computer of claim 1 having a second reference number associated with each event object, initially indicating the number of consumers to access the event object, the number decremented as each consumer accesses the event object.
Claim 8
Independent Claim
118 words
A method for propagating event objects to a finite set of consumers, comprising the steps of: (a) placing the event objects one-at-a-time in a first-in-first-out queue; (b) associating a number with each specific event object in the list, the number indicating the number of consumers in the set currently accessing the specific event object; and (c) decrementing the number associated in step (b) with each event object by one each time a consumer finishes access to that event object, such that, when the number is zero for an event object, and the event object is at the head of the queue, that object has been accessed for all consumers requiring access, and may be removed from the queue.
Claim 9
Independent Claim
118 words
A method for propagating event objects to a finite set of consumers, comprising the steps of: (a) placing the event objects one-at-a-time in a first-in-first-out queue; (b) associating a number with each specific event object in the list, the number indicating the number of consumers in the set currently accessing the specific event object; and (c) decrementing the number associated in step (b) with each event object by one each time a consumer finishes access to that event object, such that, when the number is zero for an event object, and the event object is at the head of the queue, that object has been accessed for all consumers requiring access, and may be removed from the queue.
Claim 10
Dependent Claim
28 words
The method of claim 7 wherein the event objects created represent changes in a data base, and the information associated with each is a statement of the change.
Claim 11
Dependent Claim
34 words
The method of claim 8 wherein the data base is a routing information base for a portion of a data packet network, and the information associated with each event object is a route change.
Claim 12
Dependent Claim
20 words
The method of claim 7 wherein each event object comprises a reference to the next event object in the queue.
Claim 13
Dependent Claim
27 words
The method of claim 7 wherein each event object comprises a reference to the next event to be processed by a consumer processing a current event object.
Claim 14
Dependent Claim
36 words
The method of claim 7 having a second reference number associated with each event object, initially indicating the number of consumers to access the event object, the number decremented as each consumer accesses the event object.
Claim 15
Independent Claim
122 words
A method for propagating route changes to a finite set of peer routers, comprising the steps of: (a) placing the route changes as event objects one-at-a-time in a first-in-first-out queue; (b) associating a number with each specific event object in the queue, the number indicating the number of peers in the set currently accessing the specific event object; and (c) decrementing the number associated in step (b) with each event object by one each time a peer finishes access to that event object, such that, when the number is zero for an event object, and the event object is at the head of the queue, that object has been accessed for all peers requiring access, and may be removed from the queue.
Claim 16
Independent Claim
122 words
A method for propagating route changes to a finite set of peer routers, comprising the steps of: (a) placing the route changes as event objects one-at-a-time in a first-in-first-out queue; (b) associating a number with each specific event object in the queue, the number indicating the number of peers in the set currently accessing the specific event object; and (c) decrementing the number associated in step (b) with each event object by one each time a peer finishes access to that event object, such that, when the number is zero for an event object, and the event object is at the head of the queue, that object has been accessed for all peers requiring access, and may be removed from the queue.
Claim 17
Dependent Claim
20 words
The method of claim 13 wherein each event object comprises a reference to the next event object in the queue.
Claim 18
Dependent Claim
27 words
The method of claim 13 wherein each event object comprises a reference to the next event to be processed by a peer processing a current event object.
Claim 19
Dependent Claim
36 words
The method of claim 13 having a second reference number associated with each event object, initially indicating the number of peers to access the event object, the number decremented as each peer accesses the event object.
Claim 20
Independent Claim
127 words
A method for propagating route changes to a finite set of processor-controlled peer nodes in a multiple-processor router, comprising the steps of: (a) placing the route changes as event objects one-at-a-time in a first-in-first-out queue; (b) associating a number with each specific event object in the queue, the number indicating the number of nodes in the set currently accessing the specific event object; and (c) decrementing the number associated in step (b) with each event object by one each time a node finishes access to that event object, such that, when the number is zero for an event object, and the event object is at the head of the queue, that object has been accessed for all nodes requiring access, and may be removed from the queue.
Claim 21
Independent Claim
127 words
A method for propagating route changes to a finite set of processor-controlled peer nodes in a multiple-processor router, comprising the steps of: (a) placing the route changes as event objects one-at-a-time in a first-in-first-out queue; (b) associating a number with each specific event object in the queue, the number indicating the number of nodes in the set currently accessing the specific event object; and (c) decrementing the number associated in step (b) with each event object by one each time a node finishes access to that event object, such that, when the number is zero for an event object, and the event object is at the head of the queue, that object has been accessed for all nodes requiring access, and may be removed from the queue.
Claim 22
Dependent Claim
20 words
The method of claim 17 wherein each event object comprises a reference to the next event object in the queue.
Claim 23
Dependent Claim
27 words
The method of claim 17 wherein each event object comprises a reference to the next event to be processed by a node processing a current event object.
Claim 24
Dependent Claim
36 words
The method of claim 17 having a second reference number associated with each event object, initially indicating the number of nodes to access the event object, the number decremented as each node accesses the event object.
References Cited (Backward Citations)
US6345288B1
Cited
US5951649A
Cited
US6185613B1
Cited
US6144987A
Cited
US6490273B1
Cited
US6560655B1
Cited
US6643706B1
Cited
US6728779B1
Cited
US6760777B1
Cited
US20020116248A1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2008-08-29 | 2009-02-28 | 2009-08-30 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2012-08-29 | 2013-02-28 | 2013-08-30 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2016-08-29 | 2017-02-28 | 2017-08-30 | $7700.00 | Window Closed / Lapsed |