期刊文献+

三级Clos网络中分布式调度算法研究 被引量:8

Study on Distributed Scheduling Algorithm in Three-Stage Clos Networks
下载PDF
导出
摘要 调度算法用于解决交换网络输出端口竞争问题.鉴于现有三级C los网络调度算法存在实现复杂、性能无法保证的缺点,本文提出了一种利于分布式调度的三级C los网络结构和相应的负载均衡调度思想,并给出了一种简单负载均衡调度算法.采用这种新结构和相应的调度思想不仅可以简化三级C los网络的调度,而且可以充分利用现有单Crossbar网络调度的研究成果,保证算法性能.文中通过理论和仿真分析证明基于这种思想的调度算法比现有算法具有很大的优越性. The scheduling scheme in a switching fabric is used to avoid competition for one output port. The scheduling schemes used in current three-stage Clos networks are of high complexity and can' t guarantee the networks performance. A distributed three-stage Clos network architecture and the load-balanced scheduling method for it are proposed and a simple load-balanced scheduling algorithm based on this method is given in this paper. This new architec- ture and scheduling method simplify the scheduling scheme and take full advantage of the research achievements of scheduling algorithm in Crossbar switches. The great advantages of this architecture and scheduling method over those available are shown by the theoretical and simulation analysis.
出处 《电子学报》 EI CAS CSCD 北大核心 2006年第4期590-594,共5页 Acta Electronica Sinica
基金 国家863高技术研究发展计划(No.2002AA103062) 综合业务国家重点实验室开放课题资助(ISN7-03) 国家863高技术研究发展计划(No.2003AA103520) 国防科技重点实验室基金(No.51473070204DZ0103)
关键词 三级CLOS网络 分布式实现 负载均衡 调度算法 three-stage Clos network distributed implementation load-balanced scheduling algorithm
  • 相关文献

参考文献15

  • 1C Clos. A study of nonblocking switching fabric networks [ J ]. BSTJ, 1953,32 ( 5 ) :406 - 424.
  • 2H Jonathan Chao, Zhigang Jing, Soung Y Liew. Matching algorithms for three-stagebufferless Clos network switches [ J ]. IEEE Communication Magazine, 2003,41(10) :46 -54.
  • 3H J Chao, K-L Deng, Z Jing. A petabit photonic packet switch (P3S) [ A ]. Proc Infocom'03[C]. San Francisco, USA: IEEE Computer and Communications Societies,2003. 775 - 785.
  • 4H J Chao. PetaStar: a petabit photonic packet switch[J]. IEEE JSAC,2003,21(7) :1096 -1112.
  • 5E Oki, Z Jing, R Rojas-Cessa, H J Chao. Concurrent round-robin dispatching scheme in a Clos-network switch [ A ]. IEEE ICC [ C ]. Helsinki : IEEE, 2001. 107-111.
  • 6E Oki, Z Jing, R Rojas-Cessa, H J Chao. Concurrent round-robin-based dispatching schemes for Clos-network switches [ J ].IEEE/ACM Trans on Networking,2002,10 (6) :830 - 844.
  • 7K Pun, M Hamdi. Distro:a distributed static round-robin scheduling algorithm for bufferless Clos-network switches[A]. Proc IEEE Globecom [C]. Piscataway, NJ,USA: IEEE,2002. 2298 - 2302.
  • 8S Iyer, A Awadallah, N McKeown. Analysis of a packet switch with memories running slower than the line rate[A]. Proc Infocom'00 [C]. Tel Aviv, Israel: IEEE Computer and Communications Societies, 2000. 529 -537.
  • 9Isaac Keslassy, Shang-Tse Chuang, et al. Scaling Internet touters using optics [ J ]. Computer Communication Review,2003,33 ( 4 ) : 189 - 200.
  • 10J G Dai, B prabhakar. The throughput of data switches with and without speedup [ A ]. Proc. lnfocom'00 [ C ].Tel Aviv, Israel. IEEE Computer and Communication Societies ,2000.556 - 564.

同被引文献56

  • 1兰巨龙,董雨果,陈越,温建华.并行交换中支持包保序的缓存结构及调度算法[J].电子学报,2004,32(F12):35-38. 被引量:3
  • 2彭来献.高速crossbar调度中的队列均衡及其仿真研究[J].系统仿真学报,2006,18(9):2642-2645. 被引量:1
  • 3C Clos. A study of nonblocking switching fabric networks [J]. B.S.T.J (S0005-8580), 1953, 32(5): 406-424.
  • 4H Jonathan Chao, Zhigang Jing, Soung Y. Liew. Matching Algorithms for Three-Stage Bufferless Clos Network Switches [J]. IEEE Communication Magazine (S0163-6804), 2003, 41(10): 46-54.
  • 5E Oki, Z Jing, R Rojas-Cessa, H J Chao. Concurrent Round-Robin-Based Dispatching Schemes for Clos-Network Switches [J]. IEEE/ ACM Trans. Networking (S1063-6692), 2002, 10(6): 830-844.
  • 6J G Dai, B Prabhakar. The throughput of data switches with and without speedup [C]// INFOCOM 2000. Tel Aviv. Israel: IEEE Computer and Communications Societies, 2000: 556-564.
  • 7Yashar Ganjali, Keshavarzian A, Shah D. Input Queued Switches: Cell Switching vs. Packet Switching [C]//INFOCOM 2003. San Francisco, USA: IEEE Computer and Communications Societies, 2003:1651-1658.
  • 8Goudreau M W, Kolliopoulos SG, Rao SB. Scheduling Algorithms for Input-Queued Switches: Randomized Techniques and Experimental Evaluation [C]// INFOCOM 2000. Tel Aviv, Israel: IEEE Computer and Communications Societies, 2000:1624-1643.
  • 9Keslassy I, Chuang S T, Yu k, et al .Scaling lnternet routers using optics [J]. Computer Communication Review (S0146-4833), 2003, 33(4): 189-200.
  • 10N McKeown. iSLIP: a scheduling algorithm for input-queued switches [J]. IEEE Transaction on Networking (S1063-6692), 1999, 7(2): 188-201.

引证文献8

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部