In this paper, we study the quality of service requirement and guaranteed-rate scheduling problem for combined-input-crosspoint-queued (CICQ) switches. Using crosspoint buffers between input queues and output ports, t...In this paper, we study the quality of service requirement and guaranteed-rate scheduling problem for combined-input-crosspoint-queued (CICQ) switches. Using crosspoint buffers between input queues and output ports, the input and output scheduling can be decoupled in CICQ switches. Here we propose a new guaranteed-rate scheduling algorithm which is divided seperately into input and output scheduling. Simulation results show that our algorithm can perform better than existing scheduling schemes in both packet loss and jitter control.展开更多
基金Funded by The National High Technology Research and Development Program of China(863 Program)under Grant No.2005AA121410
文摘In this paper, we study the quality of service requirement and guaranteed-rate scheduling problem for combined-input-crosspoint-queued (CICQ) switches. Using crosspoint buffers between input queues and output ports, the input and output scheduling can be decoupled in CICQ switches. Here we propose a new guaranteed-rate scheduling algorithm which is divided seperately into input and output scheduling. Simulation results show that our algorithm can perform better than existing scheduling schemes in both packet loss and jitter control.
文摘在Crossbar交换单元的交叉节点加少量缓存的C ICQ(Comb ined Input-Crosspoint-Queued)交换结构是一种调度简单并能够支持变长分组的交换结构。但是,简单的权重轮询调度算法会造成输入队列服务不公平性。为此,提出了一种改进的权重调度算法———最小配额优先算法(MQF:M in imum Quotient F irst)。通过选择恰当的分组队列调度配额,充分发挥了C ICQ结构先天性支持变长分组交换的优势。通过仿真证明,该算法在均匀和非均匀业务到达下,可以获得近100%的吞吐率和较低的平均分组时延。
