分组交换机的极大匹配调度算法仿真与比较  

Simulation and Comparison of Maximal Matching Scheduling Algorithms for Packet Switcher

作　　者：张怡[1] 周诠[1] 

机构地区：[1]西安空间无线电技术研究所空间微波技术国家级重点实验室,陕西西安710100

出　　处：《现代电子技术》2007年第2期145-148,151,共5页Modern Electronics Technique

基　　金："十一五"民用航天预研项目资助

摘　　要：对于输入缓存类型的分组交换系统,调度算法是交换系统的关键技术之一,其性能直接影响着交换单元的性能。研究了几种典型的极大匹配调度算法:PIM,iSLIP,FIRM和输出串行调度算法。通过OPNET构造了一种调度算法模型,以8×8 crossbar交换结构为例,基于该模型对这几种极大匹配调度算法进行了仿真。根据仿真结果从平均调度时延等性能指标及实现复杂度方面进行了分析和比较,指出了现有算法的优缺点,并提出了进一步改进的方向,对卫星ATM/IP交换系统的研究与设计具有指导作用。Scheduling algorithm is a key technology in packet switching system with input- buffer. Several representative maximal matching algorithms such as PIM,iSLIP,FIRM and Outpu＇t Serial Polling are studied in this paper. With 8 ×8 crossbar switching fabric,above algorithms are simulated based on the proposed model which is constructed by OPNET. Analysis and comparison are conducted to show advantages and disadvantages of these algorithms by results of simulation in average scheduling delay and complexity of realization. Finally,some improved directions are proposed, which have the guidance function for the study and design of satellite ATM/IP switching system.

关 键 词：调度算法 输入缓存 极大匹配 分组交换 

分 类 号：TP916.428[自动化与计算机技术]