基于CICQ结构的变长分组交换调度算法研究  

Research on Scheduling Algorithm of Supporting Variable-Length Packets Switch in CICQ Architecture

作　　者：王晓亮[1] 杨君刚[1] 邱智亮[1] 李然[2] 

机构地区：[1]西安电子科技大学综合业务网理论与关键技术国家重点实验室,西安710071 [2]西安通信学院一系,西安710106

出　　处：《吉林大学学报（信息科学版）》2006年第4期358-363,共6页Journal of Jilin University（Information Science Edition）

基　　金：国家"863"基金资助项目(2003AA103520);国防科技重点实验室基金资助项目(51473070204DZ0103)

摘　　要：在Crossbar交换单元的交叉节点加少量缓存的C ICQ(Comb ined Input-Crosspoint-Queued)交换结构是一种调度简单并能够支持变长分组的交换结构。但是,简单的权重轮询调度算法会造成输入队列服务不公平性。为此,提出了一种改进的权重调度算法———最小配额优先算法(MQF:M in imum Quotient F irst)。通过选择恰当的分组队列调度配额,充分发挥了C ICQ结构先天性支持变长分组交换的优势。通过仿真证明,该算法在均匀和非均匀业务到达下,可以获得近100%的吞吐率和较低的平均分组时延。CICQ （Combined Input-Crosspoint-Queued） switch architecture is becoming attractive because of the simplicity of scheduling and is suitable for switching variable-length packets directly. However, a simple Weighted Round-Robin scheduling may cause throughput unbalance among input queues. An improved weighted sched- uling algorithm which called MQF （Minimum Quotient First） scheme is proposed. By choosing proper quotient, MQF scheme is efficient to take advantage of the property that buffered crossbar natively supports variable-length packets. Simulation results show that the algorithm achieves nearly 100% throughput and low packets delay under uniform and unbalance traffic.

关 键 词：组合输入交叉节点排队 变长分组交换 调度算法 

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