Packet network providing fast distribution of node related information and a method therefor
View Patent ↗A reliable packet network is constructed with nodes and links where the nodes use a method for fast distribution of link state information. This permits a rapid update of the routing information at all nodes in case of a link failure, minimizing the number of lost packets.
1. A packet network having a plurality of nodes and links between the nodes, comprising:
a computing means for control of the nodes;
each node having a data plane means for forwarding packets between the nodes, the data plane means being responsive to control signals from the computing means; and
the data plane means comprising a means for fast propagation of node related information between the data plane means in each node and forwarding the information to the computing means in the network, wherein the means for fast propagation of node related information comprises means for fast propagation of link state information.
2. A packet network as described in claim 1 , wherein the means for fast propagation of link state information comprises a means for fast propagation of link failure information.
3. A packet network as described in claim 1 , wherein the means for fast propagation of node related information comprises a switching fabric and a link interface.
4. A packet network as described in claim 3 , wherein the link interface comprises a Fast Link State Processor (FLSP) and a link failure database.
5. A packet network as described in claim 4 , wherein the FLSP includes:
means for receiving a link failure signal of the associated link;
means for generating and sending a link failure message to other FLSP processors in the network;
means for receiving link failure messages from other FLSP processors in the network; and
means for sending the link failure messages to associated computing means.
6. A packet network as described in claim 5 , wherein the means for receiving link failure messages from other FLSP processors in the network comprises means for receiving link failure messages from the same node and means for receiving link failure message from other nodes.
7. A packet network as described in claim 5 , wherein the means for generating and sending a link failure message to other FLSP processors in the network comprises means for broadcasting a single message simultaneously through a switching fabric to all link interfaces in the same node; and means for forwarding the broadcast messages to FLSP processors in the neighbouring nodes.
8. A packet network as described in claim 5 , wherein the FLSP further comprises means for storing link failure messages and recognising previously received link failure messages.
9. A node for a packet network, comprising:
a computing means for controlling the node;
data plane means for forwarding packets to other nodes in the network, the data plane means being responsive to control signals from the computing means; and
the data, plane means comprising means for fast propagation of node related information to and from the data plane means in other nodes in the network and forwarding the information to the computing means, wherein the means for fast propagation of node related information comprises means for fast propagation of link state information.
10. A node as described in claim 9 , wherein the means for fast propagation of link state information comprises a means for fast propagation of link failure information.
11. A node as described in claim 9 , wherein the means for fast propagation of node related information comprises a switching fabric and a link interface.
12. A node as described in claim 1 , wherein the link interface comprises a Fast Link State processor (FLSP) and a link failure database.
13. A node as described in claim 12 , wherein the FLSP includes:
means for receiving a link failure signal of the associated link;
means for generating and sending a link failure message to other FLSP processors in the network;
means for receiving link failure messages from other FLSP processors in the network; and
means for sending the link failure messages to associated computing means.
14. A node as described in claim 13 , wherein the means for receiving link failure messages from other FLSP processors in the network comprises means for receiving link failure messages from the same node and means for receiving link failure message from other nodes.
15. A node as described in claim 13 , wherein the means for generating and sending a link failure message to other FLSP processors in the network comprises means for broadcasting a single message simultaneously through a switching fabric to all link interfaces in the same node; and means for forwarding the broadcast messages to FLSP processors in the neighbouring nodes.
16. A node as described in claim 13 , wherein the FLSP further comprises means for storing link failure messages and recognising previously received link failure messages.
17. In a packet network comprising a node and having a computing means for controlling the node, the node having a data plane means for forwarding packets to other nodes in the network and being responsive to control signals from the computing means, a link interface for the data plane means, comprising means for fast propagation of node related information to and from the data plane means in other nodes in the network and forwarding the information to the computing means at the node, wherein the means for fast propagation of node related information comprises a means for fast propagation of link state information.
18. In a packet network having a plurality of nodes and links between the nodes and computing means for controlling the nodes, wherein each node has a data plane means for forwarding packets between the nodes including a link interface and a switching fabric, a method of fast propagation of node related messages between the nodes, comprising the steps of:
(a) at each link interface of a node, generating a node related message;
(b) broadcasting the message to all link interfaces within the same node through the switching fabric;
(c) sending the message from each link interface to the data plane means of the corresponding neighbouring node in the network;
(d) receiving a node related message from the data plane means in another node in the network; and
(e) if the message is not already stored in the database, broadcast the message to all link interfaces within the same node using the switching fabric.
19. A method of fast propagation of node related messages as described in claim 18 , wherein the step (b) further comprises storing the message in a database of the link interface.
20. A method of fast propagation of node related messages as described in claim 18 , wherein the step (e) further comprises storing the message in a database of the link interface.
21. A method of fast propagation of node related messages as described in claim 18 , further comprising the step of signalling to the computing means about the message.
22. A method as described in claim 18 , wherein the step of generating a node related message comprises generating a link state message.
23. A method as described in claim 18 , wherein the step of generating a link state message comprises generating a link failure message.