本文實例為大家分享了C#實現Nginx平滑加權輪詢算法的具體代碼，供大家參考，具體內容如下
代碼很簡單，算法很經典！
1. 定義實體類
public struct ServerConfig { //初始權重 public int Weight {get;set;} //當前權重 public int Current {get;set;} //服務名稱 public string Name {get;set;} }2. 算法
public static int NextServerIndex(ServerConfig[] serverConfigArray) { int index = -1; int total = 0; int size = serverConfigArray.Count(); for(int i = 0; i< size; i++) { serverConfigArray[i].Current += serverConfigArray[i].Weight; total += serverConfigArray[i].Weight; if (index == -1 || serverConfigArray[index].Current < serverConfigArray[i].Current) { index = i; } } serverConfigArray[index].Current -= total; return index; }3.調用
static void Main(string[] args) { var sv = new ServerConfig[] { new ServerConfig{Name="A", Weight = 4}, new ServerConfig{Name="B", Weight = 2}, new ServerConfig{Name="C", Weight = 1} }; int index = 0; int sum = sv.Sum(m => m.Weight); for(int i=0; i<sum; i++) { index = NextServerIndex(sv); Console.WriteLine("{0}{1}", sv[index].Name, sv[index].Weight); } Console.Read(); }以上就是本文的全部內容，希望對大家的學習有所幫助，也希望大家多多支持VEVB武林網。
新聞熱點
疑難解答
