Creating a spanning tree of a network including clusters
AssigneeAvaya Communication Israel Ltd.
InventorsLior Shabtay, Benny Rodrig
Life of this patent
Estimating the term…
Abstract
A method of implementing a distributed algorithm which is based on sending Bridge Protocol Data Units (BPDUs) only between neighboring bridging-devices in a network. The method includes sending BPDUs from a first bridging-device of the network to at least one non-neighboring second bridging-device, and determining a characteristic of the network responsive to the BPDUs.
Claims41
A method of implementing a distributed algorithm which is based on sending Bridge Protocol Data Units (BPDUs) only between neighboring bridging-devices in a network, comprising:
- sending BPDUs from a first bridging-device of the network to at least one second bridging-device;
- determining, in the second bridging-device, information relating to a topology characteristic of the network responsive to the BPDUs;
- and
- forwarding the “BDPUs” from the second bridging-device to at least one third bridging-device;
- wherein the network comprises at least one cluster having cluster member bridging-devices, the cluster member bridging-devices comprising, at least one of the first bridging-device, second bridging-devices and third bridging-device,” and wherein sending the BPDUs comprises sending the BPDUs from a cluster member bridging-device to substantially all the bridging-devices in the cluster;
- and
- wherein sending the BPDUs comprises sending the BPDUs via an emulated port leading to an emulated link which is connected to substantially all the bridging-devices in the cluster.
A method of activating links which form a spanning tree in a network formed of bridging-devices and links, the network including at least one cluster of cluster-member bridging-devices, external bridging-devices not included in the cluster and external links which directly connect to at least one external bridging-device, comprising:
- sending messages between bridging-devices of the network;
- determining a link suitable for being part of the spanning tree which may be activated without forming a path of activated external links between two cluster-member bridging-devices of the at least one cluster;
- and
- activating the determined link.
A method of activating links of a network, comprising:
- determining a plurality of links which form a spanning tree of the network;
- and
- activating at least one link irrespective of the determined plurality of links, wherein activating the at least one link irrespective of the determined plurality of links comprises activating a link which connects two different clusters and further wherein activating the link which connects two different clusters comprises activating the link although it forms a loop in the network.
A method of activating links which form a spanning tree in a network formed of bridging-devices and links, the network including a cluster of cluster-member bridging-devices, external bridging-devices not included in the cluster and external links which directly connect to at least one external bridging-device, comprising:
- sending messages between bridging-devices of the network;
- waiting in each bridging-device a hold-time between sending successive messages from the bridging-device;
- and
- activating a plurality of links forming the spanning tree, wherein the total time until the spanning tree is formed is substantially equal to the time required if the cluster were replaced by a single bridging-device.
A method according to claim 24, wherein generating the message comprises generating a BPDU message.
A method of implementing a distributed spanning tree algorithm in a first bridging-device, comprising:
- receiving a spanning-tree-algorithm message from a second bridging-device;
- generating at least one message, including a message to a third bridging-device, responsive to the received message;
- determining a hold-time to wait before sending the generated message to the third bridging-device, from a plurality of available hold-times;
- and
- sending the message after the hold-time, wherein determining the hold-time comprises determining the hold-time responsive to the identity of at least one of the second bridging-device and the third bridging-device.
A method of implementing a distributed spanning tree algorithm in a first bridging-device, comprising:
- receiving a spanning-tree-algorithm message from a second bridging-device;
- generating at least one message, including a message to a third bridging-device, responsive to the received message;
- determining a hold-time to wait before sending the generated message to the third bridging-device, from a plurality of available hold-times;
- and
- sending the message after the hold-time, wherein determining the hold-time comprises determining a standard hold-time if both the second and third bridging-devices do not belong to a common cluster with the first bridging-device.
A cluster-member switch, comprising:
- a forwarding circuit;
- and
- a processor which runs a spanning tree algorithm code which generates and receives Bridge Protocol Data Units (BPDUs) in order to configure the forwarding circuit, and an intermediate software which alters at least some of the generated or received BPDUs, wherein the processor further determines a link suitable for being part of the spanning tree which may be activated without forming a path of activated external links between the cluster-member switch and at least one other cluster-member switch.
Dependencies are inferred from the claim text.