基于帧填补的MMM Clos网络按序分组交换算法  

Padded-frame Based in-sequence Dispatching Scheme for Memory-Memory-Memory(MMM) Clos-network

作　　者：高雅[1] 邱智亮[1] 张茂森[1] 黎军 

机构地区：[1]西安电子科技大学综合业务网理论及关键技术国家重点实验室,西安710071 [2]空间微波技术国家重点实验室,西安710100

出　　处：《电子与信息学报》2012年第11期2715-2720,共6页Journal of Electronics & Information Technology

基　　金：长江学者和创新团队发展计划(IRT0852);国家863计划项目(2008AA01A332;2009AA01A335);核高基项目(2009ZX01033-003-001)资助课题

摘　　要：与其它类型的Clos网络相比,各级带缓存的MMM(Memory-Memory-Memory)Clos网络使得交换网络的配置时间最小化,但是MMM交换中间级缓存的存在会引起输出端口的信元乱序。该文提出了一种满帧填补扩展算法(EPF),采用逐帧转发的方式来避免MMM Clos网络中的乱序问题。新算法在输入级和输出级采用固定周期轮转方式,中间级采用最早信元优先输出调度,具有复杂度低,可分布式控制,以及不需要缓存加速的特点。分析和仿真结果表明该算法是稳定的,即输入输出为可允许业务时,算法可达100%吞吐率。Compared with other types of Clos-netwok minimizes the time required to configure a Clos-network switch, the Memory-Memory-Memory （MMM） switch switch. However the use of buffers in the middle stage of an MMM switch can potentially cause the forwarding of cells to the outputs in out-of-sequence order. A novel scheduling algorithm, called Extended Padded Frame （EPF） scheme, is proposed, which provides in-sequence service for MMM Clos-network by adopting a frame-based approach. The new solution adopts a predetermined cyclic shift configuration at the first and third stages and the oldest-cell-first selection for arbitrations at the second stage. The algorithm is decentralized and requires no speedup. Analysis and simulation results show that the new algorithm is stable, that is to say, EPF can achieve 100% throughput under any admissible traffic patterns.

关 键 词：三级CLOS网络 分组交换 负载均衡 分组保序 

分 类 号：TN915[电子电信—通信与信息系统]