Method and apparatus for establishing and sharing a virtual change notification list among a plurality of peer nodes
AssigneePluris, Inc.
InventorsErol Basturk, Vivek Menezes
Life of this patent
Estimating the term…
Loading patent…
AssigneePluris, Inc.
InventorsErol Basturk, Vivek Menezes
Estimating the term…
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.
A data structure comprising:
In a data router, a virtual output queue system for propagating route change notifications to individual ones of a finite set of peer routers, the system comprising:
A method for propagating event objects to a finite set of consumers, comprising the steps of:
A method for propagating route changes to a finite set of peer routers, comprising the steps of:
In a multiple-processor data router, a virtual output queue system for propagating route change notifications to individual ones of a finite set of processor-controlled nodes within the router, the system comprising:
A method for propagating route changes to a finite set of processor-controlled peer nodes in a multiple-processor router, comprising the steps of:
Dependencies are inferred from the claim text.