摘要
针对目前多数交换机制可扩展性差、实现复杂度大的问题,基于并行存储机制构建高性能交换结构PSS,采用流模型证明在不加速的情况下PSS交换结构对满足大数定律的可容许到达业务能够实现100%的吞吐量,在该结构的基础上提出简单优先双轮询算法SPDRR。仿真结果表明,应用SPDRR算法的PSS交换结构能够获得很好的性能。
In order to improve the performance of the presented schemes with low scalability and great complexity, this paper builds a highperformance 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.
出处
《计算机工程》
CAS
CSCD
北大核心
2009年第8期131-133,共3页
Computer Engineering
基金
国家自然科学基金资助项目(60572042)
国家“863”计划基金资助项目(2008AA01Z214)
关键词
交换结构
调度算法
双轮询
优先级
switching architecture
scheduling algorithm
double round robin
priority