Weighted load balancing using scaled parallel hashing

1. A method comprising:

receiving, at a data switch, a data packet, the data switch including a plurality of egress ports;

for a given received data packet:

for each of the egress ports:

generating, by the data switch, a hash value based on one or more fields of the given received data packet using a hash function assigned to the egress port, wherein the hash function assigned to each egress port is independent and different from the hash functions assigned to each of the other egress ports;

selecting, for the given received data packet, an egress port of the plurality of egress ports based on the respective hash values for each of the egress ports generated for the given received data packet; and

transmitting, by the data switch, the given received data packet using the selected egress port.

2. The method of claim 1 , wherein the one or more fields of the given received data packet include one or more fields of a header of the given received data packet, the one or more fields of the header of the given received data packet having fixed values for each received data packet of a data flow associated with the given received data packet.

3. The method of claim 1 , wherein generating a hash value includes generating a weighted hash value based on a plurality of respective traffic routing weights assigned to the plurality of egress ports.

4. The method of claim 3 , wherein generating a weighted hash value for a given egress port of the plurality of egress ports is based on a ratio of a probability of the given egress port being selected in a joint probability distribution for the plurality of egress ports with a probability of an egress port with a lowest routing weight of the respective traffic routing weights being selected in the joint probability distribution, the probability of the given egress port being selected in the joint probability distribution being proportional with a routing weight assigned to the given egress port.

5. The method of claim 3 , wherein the plurality of routing weights are normalized such that a smallest routing weight of the plurality of routing weights has a normalized value of 1.

6. The method of claim 3 , wherein generating, for the given received data packet, the hash value for each of egress ports includes normalizing a plurality of respective hash values for the plurality of egress ports to respective values in a range of 0 to 1.

7. The method of claim 1 , wherein selecting, for the given received data packet, the egress port of the plurality of egress ports includes selecting an egress port of the plurality of egress ports having a highest respective hash value.

8. A data switch including a plurality of egress ports, the data switch comprising:

at least one memory that is configured to store instructions; and

at least one processor that is operably coupled to the at least one memory and that is configured to process the instructions to cause the data switch to:

receive a data packet;

for a given received data packet:

for each of the egress ports:

generate a hash value based on one or more fields of the given received data packet using a hash function assigned to the egress port, wherein the hash function assigned to each egress port is independent and different from the hash functions assigned to each of the other egress ports;

select, for the given received data packet, an egress port of the plurality of egress ports based on the respective hash values for each of the egress ports generated for the given received data packet; and

transmit the given received data packet using the selected egress port.

9. The data switch of claim 8 , wherein the one or more fields of the given received data packet include one or more fields of a header of the given received data packet, the one or more fields of the header of the given received data packet having fixed values for each data packet of a data flow associated with the given received data packet.

10. The data switch of claim 8 , wherein the generated hash value includes a weighted hash value generated based on a plurality of respective traffic routing weights assigned to the plurality of egress ports.

11. The data switch of claim 10 , wherein a weighted hash value for a given egress port of the plurality of egress ports is based on a ratio of a probability of the given egress port being selected in a joint probability distribution for the plurality of egress ports with a probability of an egress port with a lowest routing weight of the respective traffic routing weights being selected in the joint probability distribution, the probability of the given egress port being selected in the joint probability distribution being proportional with a routing weight assigned to the given egress port.

12. The method of claim 10 , wherein the plurality of routing weights are normalized such that a smallest routing weight of the plurality of routing weights has a normalized value of 1.

13. The data switch of claim 10 , wherein generating, for the given received data packet, the hash value for each of egress ports includes normalizing a plurality of respective hash values for the plurality of egress ports to respective values in a range of 0 to 1.

14. The data switch of claim 8 , wherein selecting, for the given received data packet, the egress port of the plurality of egress ports includes selecting an egress port of the plurality of egress ports having a highest respective hash value.