基于Crossbar的可重构网络输入排队分域调度研究  

Research on input-queued slicing domain scheduling based on Crossbar in the reconfigurable network

作　　者：张博[1] 汪斌强[1] 王珊珊[1] 卫红权[1] 李挥[2] 

机构地区：[1]国家数字交换系统工程技术研究中心,河南郑州450002 [2]北京大学深圳研究生院深圳市云计算关键技术和应用重点实验室,广东深圳518055

出　　处：《通信学报》2012年第9期105-115,共11页Journal on Communications

基　　金：国家重点基础研究发展计划("973"计划)基金资助项目(2012CB315901;2012CB315905);国家自然科学基金资助项目(NSFC61179028)~~

摘　　要：为解决传统网络技术体系中交换结构无法满足大量差异化业务规模化应用的问题,本文基于可重构网络技术体系,采用选择关闭部分Crossbar交叉节点的分域模型,提出了分域调度的思想,分析并推导了承载组内的SDRR调度算法和域内最长队列优先调度算法。最后采用交换性能仿真平台对该调度算法进行了复杂度和时延的仿真比较,结果表明:分域调度的最长队列优先算法比一般最长队列优先算法相对复杂度低,且随着调度域个数增加,相对复杂度降低。在相同业务源输入条件下,Crossbar三分域调度算法的时延小于非分域调度算法的时延,接近公平输出排队调度算法的时延。In order to solve the problem which was switching fabric could not meeting scale application of abundant differ-ent business in traditional technology system.The slicing domain scheduling viewpoint based on reconfigurable network technology system was proposed.It used selecting and closing part Crossbar switching points slicing model.It analyzed and deduced smoothed deficit round-robin（SDRR） scheduling algorithm in carrying group and longest queue first（LQF） sched-uling algorithm in scheduling domain.Then it contrasted complexity and time delay in switching performance evaluation system（SPES）.The results show that the complexity of slicing domain LQF is less than traditional LQF.The more number of domains is,the less complexity of slicing domain LQF is.The time delay of slicing domain scheduling with three slices is less than others without slicing domain,and is close to time delay of fair output-queued scheduling algorithm.

关 键 词：可重构网络 服务承载网 分域调度 最长队列优先 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]