期刊文献+

基于约束的智能光网络路由算法的实现 被引量:1

Implement on Constraint-Based Routing Algorithm in Intelligent Optical Networks
下载PDF
导出
摘要 对智能光网络规划方法进行了较为全面的分析和阐述,提出了一种新的用于智能光网络仿真、规划的约束最短路径优先算法,能够有效均衡网络负载,提高网络资源利用率,降低链路失效时的风险.在此算法的基础上实现了智能光网络仿真规划软件,为运营商实际引入智能光网络后的研究设计和运行维护提供了有利工具. This paper has a whole analysis on programming of ASON, present a new algorithm to solve the problem of programming in ASON. And the algorithm is the constraint based shortest path first algorithm with more than one constraint. It can balance the load of the links, improve the utility of network resources and also can reduce the risks while links invaliding. Based on the algorithm, we develop a emulating and programming software in ASON, provide an advantaged tool for designing and maintaining after importing ASON.
出处 《微电子学与计算机》 CSCD 北大核心 2008年第4期98-101,共4页 Microelectronics & Computer
  • 相关文献

参考文献6

二级参考文献21

  • 1[1]Bononi A, Castanon G O,Tonguz K. Analysis of Hot-potato Optical Networks with Wavelength Conversion[J]. IEEE J Lightwave Technol,1999,17(4):525-534.
  • 2[2]Barry R A,Humblet P A. Models of Blocking Probability in All-Optical Networks with and without Wave-length Changers [J]. IEEE J Select Areas Communi-cations,1996,14(5):858-867.
  • 3[3]Castanon G A, Tonguz O K, Bononi A. On the Benefits of Wavelength Translation in Datagram All-Optical Networks[J]. IEEE Electron Letters, 1997,33(18):1567-1568.
  • 4[4]Listanti M, Eramo V, Sabella R. Architecture and Technological Issues for Future Optical Internet Networks[J]. IEEE Communications Magazine,2000,38(9): 82-92.
  • 5[5]Eiji Oki, Nobuaki Matsuura, Naoaki Yamanaka.A Disjoint Path Selection Scheme with Shared Risk Link Groups in GMPLS Networks[J]. IEEE Communication Letters,2002,6(9):406-408.
  • 6[7]Hassin R. Approximation Scheme for the Restricted Shortest Path Problem[J]. Mathematics of Operations Research,1992,17(1):36-42.
  • 7[8]Chen S, Nahrstedt K. On Finding Multi-Constrained Paths[J]. Proceedings of the IEEE International Conference on Conference Record, 1998,2:874-879.
  • 8[9]Orda A, Sprintson A. QoS Routing: the Precomputation Perspective [J]. IEEE INFOCOM, 2000,1:128-136.
  • 9[10]Floyd S, Paxson V. Difficulties in Simulating the Internet[J]. IEEE/ACM Trans Networking,2001,9(4):392-403.
  • 10Manni E. Generalized multi-protocol label switching (GMPLS) architecture[EB/OL]. Draft-ietf-ccamp-gmplsarchitecture-02.txt, 2003 -07-10.?A

共引文献14

同被引文献4

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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