期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

分布式调度三级CLOS网络中交换机制的选择

Choice of Switching Scheme in Distributed Scheduling Three-stage Clos Networks
原文传递
导出
摘要 以分布式调度三级Clos网络为重点,对定长信元和变长分组两种交换方式性能和实现成本进行了对比分析;通过对网络第一级负载分配原则的理论分析,给出了变长分组交换方式下网络稳定性的条件,利用仿真分析对比了两种交换方式的时延特性。给出了分布式调度三级Clos网络中交换机制的选择原则。 The distributed scheduling three-stage Clos network was focused on. The performance and cost of varied length packet switching and fixed length cell switching were comparatively analyzed. Based on the theoretical analysis of the load distribution strategy of the first stage, the stability conditions of the varied length packet switching were obtained. The delay characteristics of these two switching schemes were contrasted by simulation analysis. The choice strategy of switching scheme in it was proposed by the theoretical and simulation analysis.
作者 杨君刚 刘增基 赵瑞琴 雒晓卓
机构地区 西安通信学院 西安电子科技大学综合业务网国家重点实验室
出处 《系统仿真学报》 CAS CSCD 北大核心 2009年第5期1289-1292,1296,共5页 Journal of System Simulation
基金 综合业务国家重点实验室开放课题资助(ISN8-03)
关键词 三级CLOS网络 分布式调度 分组交换 信元交换 Three-stage Clos Network Distributed Scheduling Packet Switching Cell Switching
分类号 TN915.05 [电子电信—通信与信息系统]
  • 相关文献

参考文献10

  • 1C Clos. A study of nonblocking switching fabric networks [J]. B.S.T.J (S0005-8580), 1953, 32(5): 406-424.
  • 2H 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.
  • 3E 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.
  • 4J 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.
  • 5彭来献.高速crossbar调度中的队列均衡及其仿真研究[J].系统仿真学报,2006,18(9):2642-2645. 被引量：1
  • 6杨君刚,邱智亮,刘增基,严敬,刘亚社.三级Clos网络中分布式调度算法研究[J].电子学报,2006,34(4):590-594. 被引量：8
  • 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.

二级参考文献30

  • 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.

共引文献7

系统仿真学报
2009年 第5期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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