netdev - Improving performance of bonding driver (eql) using round robin alogrithm

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [day] [month] [year] [list]

Message-Id: <1200045898.29856.57.camel@vglwks010.vgl2.office.vaioni.com>
Date:	Fri, 11 Jan 2008 10:04:58 +0000
From:	Jeba Anandhan <jeba.anandhan@...oni.com>
To:	netdev@...r.kernel.org
Subject: Improving performance of bonding driver (eql) using round robin
	alogrithm

Hi All,
The existing algorithm works in eql bonding driver works based on
priority of each slaves. The priority has been assigned as speed of the
particular line. The current problem is, all the slaves didn't get the
chance as best slave for the transmission.

Will the round robin algorithm for selecting best slave to transmit the
data, improves the performance?.

Thanks
Jeba
--
To unsubscribe from this list: send the line "unsubscribe netdev" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html