Flow-based packet-mode load-balancing for parallel packet switches
Flow-based packet-mode load-balancing for parallel packet switches
复制标题
DOI：
10.3233/jhs-2010-0335
复制
发表时间：
2010-04
期刊：
影响因子：
--
通讯作者：
Lei Shi;Wenjie Li;Bin Liu
中科院分区：
文献类型：
--
作者：
Lei Shi;Wenjie Li;Bin Liu
并行分组交换（PPS）技术同时解决了调度算法、存储带宽和串行传输技术等瓶颈问题，在大容量交换结构的设计中得到了广泛的应用。当前基于分组的PPS负载均衡算法在没有代价高昂的重排序机制的情况下不能保持流内分组顺序。本文研究了基于流的包模式负载均衡算法的可行性，该算法彻底避免了数据包乱序。通过基于实时跟踪流量模型的性能分析，我们表明，在适当的加速比下，所有三个基于流的算法都可以在允许的流量输入下提供吞吐量和延迟保证。跟踪驱动的模拟进行验证我们的结果。
Parallel Packet Switch (PPS) is broadly used in designing large-capacity switching fabrics, since it resolves the bottlenecks of scheduling algorithm, memory bandwidth, and serial transmission technology simultaneously. Current packet-based load-balancing algorithms for PPS cannot preserve intra-flow packet orders without costly reordering mechanisms. In this paper, we study the feasibility of flow-based packet-mode load-balancing algorithm, which thoroughly avoids packet out-of-order. Through performance analysis based on traffic model from real-trace, we show that given moderate speedups, all the three proposed flow-based algorithms can provide throughput and delay guarantees under admissible traffic input. Trace-driven simulations are carried out to verify our results.