期刊文献+

ATM交换机信元调度的设计与实现

Designment and Implementation of ATM Switching Cell Scheduling
在线阅读 下载PDF
导出
摘要 ATM交换机由于执行了严格的流量管理和拥塞控制,为用户提供良好的QoS保证,在骨干网和军事通信网中得到了广泛应用。但如何解决在复杂网络环境下多板卡、多接口、多用户之间数据的正常交换和时延控制,是ATM交换机设计面临的重要问题。该文对ATM交换机核心卡输入和输出两个流向的信元调度进行了分析和研究,从公平分片轮询和带优先级的逐信元轮询策略等方面,提出了一种具有一定通用性的多线卡多端口信元调度策略的设计和实现方案,在IP交换机和路由器中同样适用。 ATM Switching is used widely in the trunk network and military communication network because of whose strict traffic management and congestion control,which can offer good Quality of Service.But the serious problem of ATM switching designment is how to resolve the data switching and delay control between cards,interfaces and devices in the complicate network.On the base of analyzing and researching the cell scheduling on the stream in the ATM switching core card,a common designment and Implementation of cell scheduling between cards and interfaces from CRRS and CRRP.The solution is the same with IP switch and Router.
出处 《微处理机》 2010年第5期114-118,共5页 Microprocessors
  • 相关文献

参考文献9

  • 1刘玉静,黄伟,王玉艳.ATM交换控制电路设计验证技术[J].计算机工程,2008,34(14):237-239. 被引量:3
  • 2avidMeDysan.IP与ATM网络中的QoS和业务管理[M].北京:清华大学出版社,2004.
  • 3PMC-Sierra, Inc. PM7350 S/UNI - DUPLEX Data Sheet [ M ]. 2004 - 6. http ://www. PMC - Sierra. com.
  • 4PMC - Sierra, Inc. PM7326 S/UNI - APEX Data Sheet [ M ]. 2005 - 1. http ://www. PMC - Sierra. com.
  • 5赵明,赵海,高怡臣,罗桂兰,董洁.能够提供QoS保证的固定优先级调度[J].计算机工程与应用,2009,45(14):46-48. 被引量:3
  • 6鲍慧,赵生岗,黄霞.基于DiffServ模型的调度算法[J].计算机工程,2008,34(20):130-132. 被引量:7
  • 7张公忠.现代网络技术教程[M](2版).北京:电子工业大学出版社,2005.
  • 8ATM Forum. Universal Test & Operations PHY Interface for ATM (UTOPIA), Level2 [ S ]. Version 1.0, af - phy -0039. 000 ,June 1995.
  • 9ITU - T Recommendation I. 432. I. B - ISDN user - net- work interface [ S ]. Physical layerspecification: General characteristics, 08/96.

二级参考文献19

  • 1李晓花,李小军.IP网络QoS几种排队算法的对比分析[J].四川理工学院学报(自然科学版),2006,19(3):81-84. 被引量:3
  • 2Gendy M A E,Bose A,Shin K G.Evolution of the Intemet QoS and support for soft real-time applications[J].Proceeding of IEEE, 2003,91 (7) : 1086-1104.
  • 3Buttazzo G, Spud M, Sensini F.Value vs deadline scheduling in overload condictions[C]//Proceedings of 16th IEEE Real-Time Systems Symposium.Pisa: IEEE Computer Society Press, 1995 : 90-99.
  • 4Koren G,Shasha D.Skip-over:Algorithms and complexity for overloaded system that allows skips[C]//Proceedings of Real-Time Systems Symposium.Pisa: IEEE Computer Society Press, 1995:110-117.
  • 5Hamdaoui M,Ramanathan P.A dynamic prioirty assignment thechnique for streams with(m,k )-finn deadlines[J].IEEE Transactions on Computers, 1995,44(4) : 1443-1451.
  • 6Bernat G.Specification and analysis of weakly hard real-time systems[D].Spain:Universitat de les Illes Balears,1998.
  • 7Bernat G,Burns A,Liamosi A.Weakly hard real-time systems[J]. IEEE Transactions on Coumputers, 2001,50(4) : 308-321.
  • 8West R,Zhang Y T,Schwan K,et al.Dynamic window-constrained scheduling of real-time streams in media servers[J].IEEE Transactions on Coumputers, 2004,53 (6) : 744-759.
  • 9Ramanathan P.Overload management in real-time control applications using(m,k)-firm guarantee[J].IEEE Transaetion on Parallel and Distributed Systems (Special Issue on Dependable Real-time Systems ), 1999,10 ( 6 ) : 549-559.
  • 10Quan G,Hu X B.Ehnaneed fixed-priority seheduling with(m,k)-firm guarantee[C]//Proceedings of 21st IEEE Real-Time System Symposium.Florida: IEEE Computer Society Press, 2000: 79-88.

共引文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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