round robin权重轮循算法php实现代码，roundrobin_PHP教程

round robin权重轮循算法php实现代码，roundrobin

先上代码，采用php脚本语言

 5, 'current_weight' => 0, 'count' => 0);
$hosts['b'] = array('weight' => 3, 'current_weight' => 0, 'count' => 0);
$hosts['c'] = array('weight' => 2, 'current_weight' => 0, 'count' => 0);

$result = array();

/* 模拟10次 */
for ($i = 0; $i  $item) {
    $current = &$hosts[$key];
    $weight = $current['weight'];

    $current['current_weight'] += $weight;
    $total += $weight;

    if ( ($best == null) || ($hosts[$best]['current_weight'] 

输出结果：
Array

(

[0] => a

[1] => b

[2] => c

[3] => a

[4] => a

[5] => b

[6] => a

[7] => c

[8] => b

[9] => a

)
负载均衡的服务器中，其实现算法有种是round-robin权重轮循，就是后端的服务器列表中，给每个服务器标上权重，代表它被采用的机率。
这段代码把最简洁的流程剥离出来，没考虑后端挂起等情况，可以知道它是怎么实现的，仅供参考.

http://www.bkjia.com/PHPjc/1133053.htmlwww.bkjia.comtruehttp://www.bkjia.com/PHPjc/1133053.htmlTechArticleround robin权重轮循算法php实现代码，roundrobin 先上代码，采用php脚本语言 php/* * Copyright (C) FatHong *//* 数据初始化，weight: 权重 */$hosts['a'] = a...