round robin權重輪循算法php實作程式碼

先上程式碼，採用php腳本語言

<?php
 
/* 
 * Copyright (C) FatHong
 */
 
/* 数据初始化，weight: 权重 */
$hosts[&#39;a&#39;] = array(&#39;weight&#39; => 5, &#39;current_weight&#39; => 0, &#39;count&#39; => 0);
$hosts[&#39;b&#39;] = array(&#39;weight&#39; => 3, &#39;current_weight&#39; => 0, &#39;count&#39; => 0);
$hosts[&#39;c&#39;] = array(&#39;weight&#39; => 2, &#39;current_weight&#39; => 0, &#39;count&#39; => 0);
 
$result = array();
 
/* 模拟10次 */
for ($i = 0; $i < 10; $i++) {
  round_robin($hosts, $result);
}
 
/* 输出结果 */
print_r($result);
 
/* round robin 轮循 */
function round_robin(&$hosts, &$result)
{
  $total = 0;
  $best = null;
 
  foreach ($hosts as $key => $item) {
    $current = &$hosts[$key];
    $weight = $current[&#39;weight&#39;];
 
    $current[&#39;current_weight&#39;] += $weight;
    $total += $weight;
 
    if ( ($best == null) || ($hosts[$best][&#39;current_weight&#39;] < 
                $current[&#39;current_weight&#39;]) ) 
    {
      $best = $key;
    }
  }
 
  $hosts[$best][&#39;current_weight&#39;] -= $total;
  $hosts[$best][&#39;count&#39;]++;
 
  $result[] = $best;
}

輸出結果：

Array
(
[0] => a
[1] => b
[2] => c
[3] => a
[ 4] => a
[5] => b
[6] => a
[7] => c
[8] => b
[9] => a
)

負載平衡的伺服器中，其實作演算法有種是round-robin權重輪循，就是後端的伺服器清單中，給每個伺服器標上權重，代表它被採用的機率。

這段程式碼把最簡潔的流程剝離出來，沒考慮後端掛起等情況，可以知道它是怎麼實現的，僅供參考.

更多round robin權重輪循算法php實現代碼相關文章請關注PHP中文網！