期刊文献+

ASON路由算法在电力系统中的研究 被引量:1

Research of ASON routing algorithm in electric system
在线阅读 下载PDF
导出
摘要 电力通信系统中的电力特种业务,特别是继电保护业务,对于通信信道的时延有着较高的要求,传统的SDH网络已经越来越不能满足其需求。本文针对业务特点,在分析了其通道延时、双向通道延时差的相关特性后,设计了一种新的ASON路由算法。仿真实验表明,该路由算法较好地实现了双向路由的寻找,并且找到的路径的时延小,算法时间复杂度低。算法很好地满足业务需求,实现了其承载。 The special electric service in the electric communication system,especially the relay protection,have a high demand about the time delay,the traditional SDH networks have been increasingly unable to meet their needs.This paper aims the demand of the special elctric service,analyses the delay of the service path、duplex channel delay jitter,and designs a new ASON routing algorithm.The result of the simulation shows that the algorithm can successfully find the duplex route, the route’s delay is small,and the time complexity is low.So it satisfy the demand and achieve the load.
作者 胡朝平 易颖
机构地区 南京邮电大学
出处 《电子测试》 2011年第3期67-70,共4页 Electronic Test
关键词 路由算法 电力特种业务 时延 ASON routing algorithm special elctric service time delay ASON
  • 相关文献

参考文献6

  • 1王明中,谢剑英,陈应麟.一种新的Kth最短路径搜索算法[J].计算机工程与应用,2004,40(30):49-50. 被引量:11
  • 2傅俊伟,李兴明,陈捷.基于背离路径的Kth最短路径实用搜索算法[J].计算机技术与发展,2009,19(2):120-122. 被引量:11
  • 3Ricardo Mart f nez, Ramon Casellas, Ra fi 1 Mufioz, Takehiro Tsuritani.Experimental Translucent- Oriented Routing for Dynamic Lightpath Provisioning in GMPLS-Enabled Wavelength Switched Optical Networks[J].LIGHTWAVE TECHNOLOGY,2010,28(8).
  • 4Pei Luo, Shanguo Huang, Weihua Lian, Bin Li, Wanyi Gu.Novel Routing Algorithms for Hierarchical Architecture in ASON[C].2009 WASE International Conference on Information Engineering,2009.
  • 5G Maier, F Mizzotti, A Pattavina.Multi-domain routing techniques in ASON networks[C].Proc of ECOC, 33rd European Conference and Exhibition of Optical Communication,2007.
  • 6Seyed Reza Ehsani, Valiallah Ghorbani, Sadegh Abbasi Shahkooh.Hierarchical routing in optical networks[C].2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications,2008.

二级参考文献9

  • 1王明中,谢剑英,陈应麟.一种新的Kth最短路径搜索算法[J].计算机工程与应用,2004,40(30):49-50. 被引量:11
  • 2Mokhtar A, Azizogou M. Adaptive wavelength routing in all -optical networks [J]. IEEE/ACM Trans. on Networking, 1998,6(2) : 197 - 206.
  • 3Alanyali M, Ayanoglu E. Provisioning algorithms for WDM optical networks [J]. IEEE/ACM Trans. on Networking, 1999,7(5) :767 - 778.
  • 4W Hoffman,R Pavley.A Method for the solution of the Nth Bext Path Problem[J].ACM, 1959;6:506~514
  • 5Moore,Edward F.The shortest path through a maze. Paper presented at the International Symposium on the Theory of Switching at Harvard University, 1957
  • 6R Bellman, R Kalaba. On Kth Best Policies[J].SIAM, 1960; 8: 582~588
  • 7David Eppstein. Finding the k shortest paths[J].SIAM Journal on Computing, 1998; 28: 652~673
  • 8柴登峰,张登荣.前N条最短路径问题的算法及应用[J].浙江大学学报(工学版),2002,36(5):531-534. 被引量:89
  • 9李乐民.WDM光传送网的选路和波长分配算法[J].中兴通讯技术,2001,7(6):4-7. 被引量:12

共引文献19

同被引文献14

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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