Link state network having weighted control message processing
AssigneeAT&T Corp.
InventorsGagan Lal Choudhury, Anurag S. Maunder
Life of this patent
Estimating the term…
Abstract
A node in a network running a link-state routing protocol identifies certain routing control messages and stores the identified messages in separate queues. The queues are weighted such that each message type is allotted a predetermined amount of processing overhead to optimize the message processing by a node. In one embodiment, the node processor processes the queued messages in accordance with the entries in a weighted round robin polling table. An upper limit of processing time can be specified for each visit to a particular message queue.
Claims19
A method for processing link state routing control messages by a network node, comprising:
- identifying control messages that need to be processed by said node by type, from a set of predetermined types;
- storing each of the type-identified control messages, by type, in a respective one of a plurality of message queues;
- assigning a weight to each of the respective message queues based on urgency considerations for processing said control message;
- developing a sequence of said queues based on said weights;
- and
- accessing said queues in accord with said sequence, and processing the control messages queued in the accessed queue for at most a processing time of T seconds, where T is preselected and unchanged as different queues are accessed.
A method for processing link state routing control messages by a node in a network, comprising:
- identifying predetermined routing control message types based upon a value in a header of routing control messages received by the node;
- identifying predetermined routing control messages generated by the node;
- storing each type of identified routing control message in a corresponding one of a plurality of message queues;
- assigning a weight to each of the message queues;
- generating a round robin polling table having a number of entries corresponding to the sum of the weights assigned to the message type queues;
- and
- processing the entries in the round robin polling table such that the same-amount of processing power is allotted to each and all of the message queues.
A link state network, comprising:
- a plurality of nodes each including a node processor that identifies predetermined types of link state routing control messages, stores each type of identified message in a respective weighted queue, and processes said routing control messages by accessing said queues, one at a time, in a predetermined sequence based on said weighting of said queues, where said processor is limited to provide not more than a predetermined amount A of processing power with each access of each and all of said queues.
A node including a node processor, characterized by:
- said node processor identifies predetermined types of link state routing control messages, stores each type of identified message in a respective weighted queue, and processes said routing control messages by accessing said queues, one at a time, in a predetermined sequence based on said weighting of said queues, where said processor is limited to provide not more than a predetermined amount of processing power with each access of each and all of said queues.
A method for processing link state routing control messages received by a network node, comprising the steps of:
- storing each received message based on the type of said each received message in a queue of a plurality of queues that respectively store different message types;
- and
- dealing with the messages stored in said queues in succession in the course of a processing cycle by
- accessing a queue in said succession,
- processing messages stored in the accessed queue, but only to the extent that such processing does not expend more than a preselected amount of processing power that is independent of the accessed queue, and
- returning to said step of accessing to access a next queue in said succession;
- where the queues in said succession are arranged to allot, in said course of a cycle, a processing power to each queue that depends on a weight factor that is pre-assigned to each queue in said plurality of queues.
Dependencies are inferred from the claim text.