Patent ID: 7571241
Filing Date: 2009-08-04
Classification: H04L

Abstract:
1. A method for updating peer entities in a communication network comprising: among a first quantity of update messages, formatting one or more of the update messages to establish a first quantity of formatted update messages for a first peer entity, wherein said first peer entity is one of a peer group and a peer, wherein the first quantity of the formatted update messages is less than or equal to the first quantity of update messages; and among the formatted update messages, enqueueing to a queue, one or more formatted update messages, to establish a quantity of enqueued formatted update messages, wherein the quantity of enqueued formatted update messages is less or equal to the quantity of formatted update messages, and wherein at least one of the quantity of formatted update messages and the quantity of the enqueued formatted update messages is a programmable quantity; after all of the first quantity of update messages are formatted in said step of formatting messages for said first peer entity, formatting a second quantity of update messages for a second peer entity wherein the quantity of update messages is a first quantity of 1 to m update messages, wherein said step of formatting the quantity of update messages to be formatted comprises formatting 1 to n update messages among the quantity of update messages to establish a first quantity of formatted update messages, wherein n is less than m, wherein the steps of the method are performed in respect of each peer entity and all of the first quantity of formatted update messages are enqueued and advertised to their respective peer entities; maintaining a point of reference to a data structure in which one of the nth update message and the n+1 update message is stored; after all of the 1 to n update messages have been formatted and advertised to each peer entity, formatting one or more update messages comprising the n+1 update message to establish a second quantity of formatted update messages, wherein the data structure is identified with said point of reference.