作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (8): 131-133. doi: 10.3969/j.issn.1000-3428.2009.08.044

• 网络与通信 • 上一篇    下一篇

基于并行存储机制的交换结构及其调度算法

郑德任1,汪斌强1,扈红超1,李 挥2   

  1. (1. 国家数字交换系统工程技术研究中心,郑州 450002;2. 北京大学深圳研究生院,深圳 518055)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-04-20 发布日期:2009-04-20

Switching Architecture Based on Parallel Storage Scheme and Its Scheduling Algorithm

ZHENG De-ren1, WANG Bin-qiang1, HU Hong-chao1, LI Hui2   

  1. (1. National Digital Switching System Engineering & Technological R & D Center, Zhengzhou 450002;2. Shenzhen Graduate School, Peking University, Shenzhen 518055)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-04-20 Published:2009-04-20

摘要: 针对目前多数交换机制可扩展性差、实现复杂度大的问题,基于并行存储机制构建高性能交换结构PSS,采用流模型证明在不加速的情况下PSS交换结构对满足大数定律的可容许到达业务能够实现100%的吞吐量,在该结构的基础上提出简单优先双轮询算法SPDRR。仿真结果表明,应用SPDRR算法的PSS交换结构能够获得很好的性能。

关键词: 交换结构, 调度算法, 双轮询, 优先级

Abstract: In order to improve the performance of the presented schemes with low scalability and great complexity, this paper builds a high- performance switching architecture based on parallel storages scheme named Parallel Storage Scheme(PSS). With the flow model techniques, it proves that PSS switch can achieve a throughput of 100% without speedup to the arbitrary admissible traffic that satisfies the Strong Law of Large Number(SLLN). Simple Priority Double Round Robin(SPSDRR) algorithm is presented based on PSS. Simulation results indicate that PSS switch with SPDRR algorithm can obtain high performance.

Key words: switching architecture, scheduling algorithm, double round robin, priority

中图分类号: