[dpdk-dev] Load-balancing position field in DPDK load_balancer sample app vs. Hash table
knasim at sidebandnetworks.com
Thu Nov 13 19:29:32 CET 2014
So i've borrowed some code from the DPDK Load balancer sample application,
specifically the load balancing position(byte 29th) to determine which
worker lcore to forward the packet to.
The idea is that flow affinity should be maintained and all packets from
the same flow would have the same checksum/5-tuple value
worker_id = packet[load_balancing_field] % n_workers
Question is that how reliable is this load balancing position? I am tempted
to use Hash tables but I think this position based mechanism may be faster.
How have people's experience with this been in general?
More information about the dev