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

Improved Multicast Traffic Scheduling Scheme in the Packet-Switching Systems

Improved Multicast Traffic Scheduling Scheme in the Packet-Switching Systems
原文传递
导出
摘要 This paper proposes a new switching scheme of switch fabric, which is named Multicast-enabled Protocol Agnostic Forwarding Engine (M-PAFE). M-PAFE is a central scheduling crossbar-based switch fabric with embedded Combined Input and Output Queue from the queuing view. An extra switching path is dedicated for multicast cell processing in M-PAFE. And the simulation results are provided to evaluate the performance of M-PAFE in comparison with ESLIP, which is a well-known algorithm implemented in Cisco 12000 routers. This paper proposes a new switching scheme of switch fabric, which is named Multicast-enabled Protocol Agnostic Forwarding Engine (M-PAFE). M-PAFE is a central scheduling crossbar-based switch fabric with embedded Combined Input and Output Queue from the queuing view. An extra switching path is dedicated for multicast cell processing in M-PAFE. And the simulation results are provided to evaluate the performance of M-PAFE in comparison with ESLIP, which is a well-known algorithm implemented in Cisco 12000 routers.
作者 SONG Mei-na SONG Jun-de LI Hong-wen
机构地区 Beijing University of Posts and Telecommunications
出处 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2004年第z1期1-7,共7页 中国邮电高校学报（英文版）
关键词 combined input and output queue MULTICAST central scheduling ESLIP combined input and output queue multicast central scheduling ESLIP
分类号 TN915.05 [电子电信—通信与信息系统]
  • 相关文献

参考文献1

二级参考文献10

  • 1　SALAMA H F, REEVWS D S, VINIOTIS Y. Evaluation of multicastrouting algorithm for real-time communication on high-speed networks [J]. IEEE Journalon Selected Areas in Communication,1997,15(3):332-345.
  • 2　BERTSEKAS D, GALLAGER R G. Data networks (2nd ed) [M]. EnglewoodCliffs,NJ:Prentice-Hall,1992.
  • 3　HWANG F K,RICHARDS D S.Steiner tree problems [J].IEEENetworks,1992,22(1):55-89.
  • 4　GELENBE E, GHANWANI A, SRINIVASON V. Improved neural heuristics for multicastrouting [J].IEEE Journal on Selected Areas in Communication,1997,15(2):147-155.
  • 5　KOU L,MARKOWSKY G,BERMAN L. A fast algorithm for Steiner trees [J].ActaInformation,1981,15:141-145.
  • 6　ZHU Q,PARSA M,GACIA-LUNA-ACEVES J J. A source-based algorithm fordelay-constrained minimum-cost multicasting [A]. In: Proc IEEE INFOCOM [C].1995.377-385.
  • 7　KOMPELLA V P,PASQUALE J C,POLYZOS G C.Multicasting for multimedia applications[A]. In:Proc. IEEE INFOCOM[C].1992.2078-2085.
  • 8　ROUSKAS G N,BALDINE I. Multicast routing with end-to-end delay and delayvariation constraints [J].IEEE Journal on Selected Areas inCommunication,1997,15(3):346-356.
  • 9　DORIGO M,GAMBARDELLA L M. Ant colony system: a cooperative learning approach tothe traveling salesman problem [J].IEEE Trans EvolutionaryComputation,1997,1(1):53-65.
  • 10　STUTZLE T, HOOS H. Max-min ant system and local for the traveling salesmanproblem [A]. Proceeding of 1997 IEEE International Conference on EvolutionaryComputation(ICEC97) [C].1997.309-314. Received date:　2000-05-19

共引文献6

The Journal of China Universities of Posts and Telecommunications
2004年 第z1期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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