发明名称 |
Flow distribution algorithm for aggregated links in an ethernet switch |
摘要 |
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. |
申请公布号 |
US9231781(B2) |
申请公布日期 |
2016.01.05 |
申请号 |
US201313739962 |
申请日期 |
2013.01.11 |
申请人 |
International Business Machines Corporation |
发明人 |
Basso Claude;Vaidhyanathan Natarajan;Verrilli Colin B.;Walk Bruce M.;Wind Daniel |
分类号 |
H04L12/54;G06F17/30;H04L12/743;H04L12/709 |
主分类号 |
H04L12/54 |
代理机构 |
Patterson + Sheridan, LLP |
代理人 |
Patterson + Sheridan, LLP |
主权项 |
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 and wherein the dividing the hash value into a plurality of chunks further comprises modifying each of the plurality of chunks by reducing a most significant bit of each chunk based on a number of plurality of links; 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. |
地址 |
Armonk NY US |