From mboxrd@z Thu Jan 1 00:00:00 1970 From: Kamraan Nasim Subject: Load-balancing position field in DPDK load_balancer sample app vs. Hash table Date: Thu, 13 Nov 2014 13:29:32 -0500 Message-ID: Mime-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Cc: Yuanzhang Hu To: dev-VfR2kkLFssw@public.gmane.org Return-path: List-Id: patches and discussions about DPDK List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Errors-To: dev-bounces-VfR2kkLFssw@public.gmane.org Sender: "dev" Hello, 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? --Kam