Broadcast tree determination in load balancing switch protocols
First Claim
1. A method operable within a network switch for managing a broadcast tree, said method comprising the steps of:
- constructing a pruned broadcast tree by propagation of dynamic cost information packets from edge switches, wherein a dynamic cost information packet is sent by an edge switch and a receiving switch sends back a first acknowledgement packet to the edge switch in response to a first dynamic cost information packet, and wherein the first acknowledgement packet will have a set broadcast learn flag to inform the edge switch that broadcast packets will be transmitted from a particular port of the edge switch, where the particular port has received the first acknowledgement packet with the set broadcast learn flag, where the first acknowledgment packet is used to establish a broadcast path from the edge switch to the receiving switch;
wherein the first acknowledgement packet is used to establish the broadcast path in order to select the lowest latency path for the broadcast path and any subsequent acknowledgement packets are not used to establish the broadcast path;
wherein each dynamic cost information packet includes a cost information determined by a ratio of a port latency value and an available throughput of a port in the edge switch, where the port latency value is equal to a queue depth of data stored in at least one queue associated with the port divided by a data transfer speed associated with the port of the network switch; and
forwarding received broadcast messages to other network devices in accordance with said pruned broadcast tree.
3 Assignments
0 Petitions
Accused Products
Abstract
A method for generating and maintaining a pruned broadcast tree for a network of switches operating multiple simultaneously active paths between devices with a load balancing family of protocols. The pruned broadcast tree is preferably generated as a by product of cost propagation aspects of the load balancing protocols exchanged among cooperating network switches. The load balance protocols operable within the network switches in association with the present invention permit multiple simultaneously active paths to be utilized among the network devices. The pruned broadcast tree is therefore used to reduce the latency of broadcast messages propagated within the network switches to reach all devices in the network. The broadcast tree defines a minimized set of devices to which a broadcast message need be forward to assure transmission to all network devices. The pruned broadcast tree, once established, is updated only in response to failure of a link and recovery of a failed link. A separate protocol of the present invention enables such pruned broadcast tree modifications and restoration.
-
Citations
19 Claims
-
1. A method operable within a network switch for managing a broadcast tree, said method comprising the steps of:
-
constructing a pruned broadcast tree by propagation of dynamic cost information packets from edge switches, wherein a dynamic cost information packet is sent by an edge switch and a receiving switch sends back a first acknowledgement packet to the edge switch in response to a first dynamic cost information packet, and wherein the first acknowledgement packet will have a set broadcast learn flag to inform the edge switch that broadcast packets will be transmitted from a particular port of the edge switch, where the particular port has received the first acknowledgement packet with the set broadcast learn flag, where the first acknowledgment packet is used to establish a broadcast path from the edge switch to the receiving switch;
wherein the first acknowledgement packet is used to establish the broadcast path in order to select the lowest latency path for the broadcast path and any subsequent acknowledgement packets are not used to establish the broadcast path;
wherein each dynamic cost information packet includes a cost information determined by a ratio of a port latency value and an available throughput of a port in the edge switch, where the port latency value is equal to a queue depth of data stored in at least one queue associated with the port divided by a data transfer speed associated with the port of the network switch; and
forwarding received broadcast messages to other network devices in accordance with said pruned broadcast tree. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14)
-
-
15. A method operable within a network switch for managing a broadcast tree, said method comprising the steps of:
-
constructing a pruned broadcast tree by propagation of dynamic cost information packets from edge switches, wherein a dynamic cost information packet is sent by an edge switch and a receiving switch sends back a first acknowledgement packet to the edge switch in response to a first dynamic cost information packet, and wherein the first acknowledgement packet will have a set broadcast learn flag to inform the edge switch that broadcast packets will be transmitted from a particular port of the edge switch, where the particular port has received the first acknowledgement packet with the set broadcast learn flag, where the first acknowledgment packet is used to establish a broadcast path from the edge switch to the receiving switch; and
wherein each dynamic cost information packet includes a cost information determined by a ratio of a port latency value and an available throughput of a port in the edge switch, where the port latency value is equal to a queue depth of data stored in at least one queue associated with the port divided by a data transfer speed associated with the port of the network switch. - View Dependent Claims (16, 17, 18, 19)
-
Specification