FLOW DISTRIBUTION ALGORITHM FOR AGGREGATED LINKS IN AN ETHERNET SWITCH
First Claim
Patent Images
1. A method for forwarding a data frame through a distributed network switch, the method comprising:
- generating a hash value based on routing information of a data frame;
dividing the hash value into a plurality of chunks, wherein values of the plurality of chunks correspond to a plurality of links associated with a link aggregation group;
determining a selected link having an up state from the plurality of links based on a hierarchical order of the plurality of chunks; and
forwarding the data frame to the selected link.
1 Assignment
0 Petitions
Accused Products
Abstract
Link aggregation is a practice that uses multiple Ethernet links between two end points in order to obtain higher bandwidth and resiliency than possible with a single link. A flow distribution technique is provided to distribute traffic between the two end points equally across all links in the group and achieve greater efficiency. The flow distribution technique generates and sub-divides a hash value based on received packet flow. The divided portions of the hash value are used in a hierarchical fashion to select a link to use for this packet.
-
Citations
8 Claims
-
1. A method for forwarding a data frame through a distributed network switch, the method comprising:
-
generating a hash value based on routing information of a data frame; dividing the hash value into a plurality of chunks, wherein values of the plurality of chunks correspond to a plurality of links associated with a link aggregation group; determining a selected link having an up state from the plurality of links based on a hierarchical order of the plurality of chunks; and forwarding the data frame to the selected link. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
Specification