论文标题
吞吐量和延迟的最佳D功率选择不均载荷平衡系统中的最优性
Throughput and Delay Optimality of Power-of-d Choices in Inhomogeneous Load Balancing Systems
论文作者
论文摘要
众所周知，D功率选择路由算法最大化吞吐量，并且在使用均匀服务器的负载平衡系统中是繁重的最佳人流。但是，如果服务器是异质的，则吞吐量最优性通常不具有。当服务器是异质的时，我们发现了D-D-Dosices的吞吐量最优性的必要条件，并且我们证明几乎相同的条件足以显示出繁重的交通优化性。此外，我们将足够的吞吐量最佳条件概括为较大类别的路由策略。
It is well-known that the power-of-d choices routing algorithm maximizes throughput and is heavy-traffic optimal in load balancing systems with homogeneous servers. However, if the servers are heterogeneous, throughput optimality does not hold in general. We find necessary and sufficient conditions for throughput optimality of power-of-d choices when the servers are heterogeneous, and we prove that almost the same conditions are sufficient to show heavy-traffic optimality. Additionally, we generalize the sufficient condition for throughput optimality to a larger class of routing policies.
