期刊文献+

输入缓冲交换开关的多步调度策略 被引量:1

Multi-Step Scheduling Strategy in Input-Queued Switches
在线阅读 下载PDF
导出
摘要 输入缓冲交换开关已经在越来越多的 ATM交换机和高性能路由器中使用 .对于独立的信元到达 ,VOQ(virtual output queueing)技术与 LQF(longest queue first)和 OCF(oldest cell first)等加权调度算法的结合使用可以使利用交换开关的吞吐率达到 10 0 % .然而 L QF和 OCF等加权调度算法过于复杂 ,无法用硬件实现 .提出了多步调度策略 ,使得用硬件实现加权调度算法成为可能 .在该策略下 ,对于独立的信元到达 ,LQF算法仍可以达到 10 0 %的利用开关吞吐率 。 Input-queued switches are increasingly used in ATM switches and high performance routers. It is proved that combining VOQ (virtual output queueing) technology and some weighted scheduling algorithms, such as LQF (longest queue first) and OCF (oldest cell first), the switch throughput can reach 100% for all cell arrivals with independent distributions. But the algorithms of LQF and OCF are so complicated that they cannot be easily implemented in hardware. A multi-step scheduling strategy proposed in this paper makes it possible to implement the weighted scheduling algorithms in hardware. It is also proved that the switches based on the LQF by introducing the multi-step scheduling strategy can still get 100% throughput and the better delay property for all cell arrivals with independent distributions.
出处 《软件学报》 EI CSCD 北大核心 2001年第8期1170-1176,共7页 Journal of Software
基金 国家自然科学基金资助项目 (6 99330 30 )&&
关键词 输入缓冲交换开关 多步高度策略 计算机网络 Algorithms Asynchronous transfer mode Computer hardware Mathematical models Routers Scheduling
  • 相关文献

参考文献2

  • 1Xie Zheng,网络算法与复杂性理论,1995年
  • 2谢政,网络算法与复杂性理论,1995年

同被引文献9

  • 1Stiliadis D, Varma A. Efficient Fair Queueing Algorithms for Packet-switched Networks[J].IEEE/ACM Trans. on Networking, 1998,6(2):175-185.
  • 2Stiliadis D, Varma A. Rate-Proportional Servers: A Design Methodology for Fair Queueing Algorithms[J]. IEEE/ACM Trans. on Networking, 1998,6(2):164-174.
  • 3Nilsson S,Karlsson G. Fast Address Lookup for Internet Routers[A]. In P. K¨uhn and R. Ulrich, editors, Broadband Communications: The Future of Telecommunications[C],1998:11-22.
  • 4McKeown N. iSLIP: A Scheduling Algorithm for Input-queued Switches[J]. IEEE Transactions on Networking, 1999, 7(3):188-201.
  • 5Floyd S. Random Early Detection Gataways or Congetion Avoidance[J]. IEEE/ACM Transaction,on Networking,August 1993,1(4):397-413.
  • 6Katevenis M, Passas G,et al. Variable Packet Size Buffered Crossbar (CICQ) Switches[R]. Institute of Computer Science, Foundation for Research and Technology-Hellas (FORTH) ICS-FORTH, Vassilika Vouton, Heraklion, Crete, GR-711-10 Greece, http://archvlsi.ics.forth.gr/bufxbar/.
  • 7Passas G.Performance Evaluation of Variable Packet Size Buffered,Crossbar Switches, Technical Report FORTH-ICS/TR-328[R]. Inst. of Computer Science, FORTH, Heraklion, Crete, Greece; B.Sc. Thesis, Univ. of Crete; November 2003; http://archvlsi.ics.forth.gr/bufxbar.
  • 8McKeown N,et al. A Starvation-free Algorithm for Achieving 100% Throughput in an Input-queued Switch[A]. Proceedings of ICCCN'96[C], 1996.
  • 9程光,龚俭,丁伟.基于统计分析的高速网络分布式抽样测量模型[J].计算机学报,2003,26(10):1266-1273. 被引量:24

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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