基于ASON的电路优化配置
|
摘要
目前,我国电网已逐渐进入全国互联的时代,各子网之间的联系越来越紧密。而且随着全国电网互联的到来,各系统之间的通信日益繁多。电力通信网支撑着全国电力通信网络的互联,承载着各子网之间的信息交互,因此,电力系统通信的可靠性变得十分重要。传统的电力通信平台主要以SDH为主,SDH采用环状网络,具有可靠性较差、不易扩容、保护方式单一等缺点。而ASON以网状结构组网,可以根据不同业务定制不同恢复方式,有明显的优点。故近年来在电力通信系统引入ASON技术,ASON必将作为未来通信网络的主要平台。但目前考虑电力通信ASON实际使用中网络生存性的多约束路由技术还有待研究。
本文基于网络自身的传输质量约束和用户业务服务质量的要求提出了多约束条件的路由算法EPCN-based MCRA(Multi-Constraints Routing Algorithm in ASON Electric Power Network)。算法结合电力通信业务的多样性及差异性特点,将实际生产因素――光纤衰耗以及电路带宽、延时、丢包率等通信需求建模为电路配置问题中的多约束要求,通过截断最短链路的思想和继承性的方式求解多条源-目的间最短路径,并保证电路配置的无环性。多备选路径可有效确保业务传输的高可靠性,并有效提高网络的带宽使用率。
并且本文针对实际电力生产需求,基于上述算法实现了电路配置仿真系统,该系统可以实现电路信息的管理,并基于这些信息实现任意两个设备之间的电路配置功能,以表格的形式直观地列出满足可配置的路由方案,并以带宽使用率为准则提供了主用路由和备用路由。该系统为电力调度人员实际生产开通方式提供了便利,解决了不同工作人员开通方式的随意性,同时理论上提高了网络的健壮性和稳定性。
The traditional electric power communication platform mainly uses SDH, which is ring network with poor reliability, not easy expansion and a simple protection way. The network of ASON mesh structure can offer different recovery mode according to different traffic. With the advantages, in recent years ASON technology is adopted into the electric power communication network. But in consideration of actual use multi-constraints of EPCN, routing technology with network survivability remains to be researched.
This paper proposes the EPCN-based Multi-Constraints Routing Algorithm considering the network itself transmission quality constraints and users business service quality requirements. The algorithm adopts the idea of truncating the shortest link and inheritance to ensure the routing without rings. And combining with the actual production factors of the fiber attenuation, circuit bandwidth, delay and packet loss rate it puts forward the constraint requirements. Only circuit meets reasonable attenuation, bandwidth, delay and packet loss rate constraints, circuit can reliably communicate. The algorithm proposes different constraint requirements combining with the characteristics of the electric power communication business diversity and difference so as to ensure the reliability of the business and improve the bandwidth utilization rate of the network.
Satisfying the actual power production needs, this paper realizes the circuit configuration simulation system based on the above-mentioned algorithm. The system can manage circuits’information and optimally configure circuit of any two equipments based on the information. And the satisfied routing configuration scheme can be listed directly in the form of tables. The main route path and backup route path can be provided with the bandwidth utilization rate criteria. In the whole, the system can provide a convenient way in actually opening running mode for electric power dispatching engineers, which avoid the arbitrary configuration in traditional manual operation. At the same time it improves the network’s robustness and stability in theory.
本文基于网络自身的传输质量约束和用户业务服务质量的要求提出了多约束条件的路由算法EPCN-based MCRA(Multi-Constraints Routing Algorithm in ASON Electric Power Network)。算法结合电力通信业务的多样性及差异性特点,将实际生产因素――光纤衰耗以及电路带宽、延时、丢包率等通信需求建模为电路配置问题中的多约束要求,通过截断最短链路的思想和继承性的方式求解多条源-目的间最短路径,并保证电路配置的无环性。多备选路径可有效确保业务传输的高可靠性,并有效提高网络的带宽使用率。
并且本文针对实际电力生产需求,基于上述算法实现了电路配置仿真系统,该系统可以实现电路信息的管理,并基于这些信息实现任意两个设备之间的电路配置功能,以表格的形式直观地列出满足可配置的路由方案,并以带宽使用率为准则提供了主用路由和备用路由。该系统为电力调度人员实际生产开通方式提供了便利,解决了不同工作人员开通方式的随意性,同时理论上提高了网络的健壮性和稳定性。
The traditional electric power communication platform mainly uses SDH, which is ring network with poor reliability, not easy expansion and a simple protection way. The network of ASON mesh structure can offer different recovery mode according to different traffic. With the advantages, in recent years ASON technology is adopted into the electric power communication network. But in consideration of actual use multi-constraints of EPCN, routing technology with network survivability remains to be researched.
This paper proposes the EPCN-based Multi-Constraints Routing Algorithm considering the network itself transmission quality constraints and users business service quality requirements. The algorithm adopts the idea of truncating the shortest link and inheritance to ensure the routing without rings. And combining with the actual production factors of the fiber attenuation, circuit bandwidth, delay and packet loss rate it puts forward the constraint requirements. Only circuit meets reasonable attenuation, bandwidth, delay and packet loss rate constraints, circuit can reliably communicate. The algorithm proposes different constraint requirements combining with the characteristics of the electric power communication business diversity and difference so as to ensure the reliability of the business and improve the bandwidth utilization rate of the network.
Satisfying the actual power production needs, this paper realizes the circuit configuration simulation system based on the above-mentioned algorithm. The system can manage circuits’information and optimally configure circuit of any two equipments based on the information. And the satisfied routing configuration scheme can be listed directly in the form of tables. The main route path and backup route path can be provided with the bandwidth utilization rate criteria. In the whole, the system can provide a convenient way in actually opening running mode for electric power dispatching engineers, which avoid the arbitrary configuration in traditional manual operation. At the same time it improves the network’s robustness and stability in theory.
引文
[1]邓月.四川电力综合数据网IP承载网方式研究[D].电子科技大学,2007.
[2]秦立军,马其燕.智能配电网及其关键技术[M].北京:中国电力出版社, 2010.
[3]何维.电力通信系统ASON网络技术演进探讨[J].电力系统通信,Vol31,No.213,Jul 10,2010.
[4]黄湧．ASON在电力系统通信网的应用研究[J].电力系统通信,Vol27,No.170,Dec 10,2006.
[5]范俊成.ASON在电力系统的应用分析[J].中国新通信,2010年10月,P5-7.
[6]张杰.自动交换光网络ASON[M].北京:人民邮电出版社,2004.
[7]吴中平.IP网络的QoS路由算法研究[D].天津大学,2007.
[8] Da-chuan Wei.Implementation of Route Selection Function Based on Improved Floyd Algorithm[A].Information Engineering (ICIE),2010 WASE International Conference,2010,Aug 14-15,Vol2,P223–227.
[9]谢金星,刑文训,王振波.网络优化[M].北京:清华大学出版社,2009.
[10] Xin Yuan.On the extended Bellman-Ford algorithm to solve two-constrained quality of service routing problems[A] . Computer Communications and Networks, 1999 Oct,P304-310.
[11]王桂平,王衍,任嘉辰.图论算法理论实现及应用[M].北京大学出版社,2011.
[12] Wang Shu-xi , Zhao Xing-qiu . The improved Dijkstra's shortest path algorithm[A]Natural Computation(ICNC) , 2011 Seventh International Conference.26-28 July 2011,Vol4, P2313–2316.
[13]李元臣,刘维群.基于Dijkstra算法的网络最短路径分析[J].微计算机应用,2004年5月第25卷第3期.
[14] DongKai Fan,Ping Shi . Improvement of Dijkstra's algorithm and its application in route planning[A]. Fuzzy Systems and Knowledge Discovery (FSKD), 2010 Seventh International Conference.2010, Aug10-12 ,Vol4,P1901–1904.
[15]赵海雁,陈立潮.多约束条件下最短路径QoS路由算法[J].华北工学院学报.2004,25(1):49-51.
[16] T Korkmaz,M Krunz.A randomized algorithm for finding a path subject to multiple qos requirements[J].Computer Networks,2001:251-268.
[17] Yuan X,Liu X.Heuristic Algorithms for Multi-Constrained Quality of Service Routing[A].Proceedings of the IEEE INFOCOM2001[C].IEEE Communication Society,2001:844-853.
[18] Chen S,Nahrstedt K.On Finding Multi-Constrained Paths[A].Proceedings of the IEEE International Conference on Communications(ICC’98)[C] . IEEE Communication Society ,2001:874-879.
[19] Juttner A,Szviatiovski Mecs B.Lagrange relaxation based method for the QoS routing problem[A] . Proceedings of the IEEE INFOCOM2001[C] . IEEE Communication Society,2001:859-868.
[20]张龙.电力行业大型IP广域网的服务质量保证[J].电力信息化,2008年08期.
[21]徐磊,徐茹枝.电力数据网络中的QoS体系研究[J].华北电力大学学报, Vol33,No.2,Mar 2006.
[22]黄盛.智能配电网通信业务需求分析及技术方案[J].电力系统通信, Vol31,No.212,Jun.10,2010.
[23]张淑娥,孔英会,高强.电力系统通信技术[M].中国电力出版社,2005.
[24]王学军.OPPC在中低压输电线路中的应用[J].机电信息,2010年第24期.
[25]林培勇.光缆生产和施工过程中光纤附加衰减的成因及避免方法浅析[J].中国高新技术企业,2008年第7期.
[26]王巧梅.酸溶法大截面光纤传像束制备工艺及性能研究[D].长春理工大学,2007.
[27] YD/T 5XXX-2005,长途通信干线光缆传输系统线路工程验收规范[S].
[28]陈春风.光网状网中的路径保护技术研究[D].上海交通大学,2007.
[29]徐俊,常会友,许昌,衣杨.ASON中考虑双链路失效的共享链路保护方法[J].小型微型计算机系统.2010年7月第7期.
[30] Ben Ali N, Belghith A, Moulierac J, Molnar M.QoS multicast aggregation under multiple additive constraints[J].Computer Communications,September 25, 2008,Vol31,P3564-3578.
[31] LIU G,RAMAKRISHNAN K G.A*Prune:An Algorithm for Finding k-Shortest Paths Subject to Multiple Constraints[C] . Proceedings of the INFOCOM 2001 Conference,IEEE,Anchorage,Alaska,2001:743-749.
[32]柴登峰,张登荣.前N条最短路径问题的算法及应用[J].杭州:浙江大学学报(工学版).2002,36(5)531-534.
[33] Yang Yun, Xu Jia,Li Qian-mu,Liu Feng-yu.Multi-object QoS routing algorithm based on Dijkstra strategy[J].Mini-Micro Systems,Vol25,No.9,Sept 2004.
[34]孙雨耕,胡华东,杨挺.一种应用于路由规划的实用无环K路算法[J].计算机工程,Vol29,No.22,December 2003.
[35]白轶多,胡鹏,夏兰芳,郭峰林.关于k次短路径问题的分析与求解[J].武汉大学学报(信息科学版) ,2009 Apr, Vol34,No. 4.
[36] R.Leela,S.Selvakumar.Genetic algorithm approach to dynamic multi constraint multi path QoS routing algorithm for IP networks[A].1st International Conference on Communication Systems and Networks and Workshops , COMSNETS 2009.January 5,January 10, 2009.
[37] Shigeo Shioda,Kenichi Mase.Performance Comparison between IntServ-Based and DiffServ-Based Networks[A].Global Telecommunications Conference,GLOBECOM'05.2005 Dec, Vol1,p534.
[38]李敏,陆芸婷.多约束QoS路由算法综述[J].深圳信息职业技术学院学报,Vol6,No.2,Jun 2008.
[39] Yang Yun , Xu Jia , Li Qianmu , Liu Feng-yu . Mini Micro Systems[J].Multi—Object QoS Routing Algorithm Based on Dijkstra Strategy,Vol25 ,No.9,Sep 2004.
[40] Zhou Xian-shu . Shortest Path Problem and its Solution Methods Study[J].Computer Knowledge and Technology,Vo16,No.6,p1403—1405,14l2,February 2010.
[41] Jiang Weixing . Reserch of Multi-constrained QoS--based Routing Technology[J] .Computer Knowledge and Technology,Vol5,No.33,P9164-9165,9170,November 2009.
[42]高昆仑,江鸥.电力系统IP宽带综合业务网络平台技术的探讨[A].中国电机工程协会电力通信专业委员会第四届学术会议论文集[C].2009.9,P119-123.
[43] Hu Zhong-hai , Zhou Li-chao , Gui Zhi-bo , Delay-bandwidth constrained QoS unicast routing algorithms considering uncertain information.2005 IEEE International Conference,2005,May16-20, Vol1,p229-232.
[44] Aissa, M,Ben Mnaouer, A, Youssef, H, Belghith, A.A New MulticastRouting Algorithm with Cost，Delay and Delay-Variation Constraints．2010，Oct8-10，p1-8．
[45] Shi Jian，Dong Tian lin，Zou Ling，Du Ting．Multicast routing algorithm with delay and bandwidth constrained[J]．JOURNAL OF CHINA INSTITUTE OF COMMUNICATIONS，Vol 22，No．7，July 2001．
[46] Li Tao-shen，Chen Song-qiao，Chen Jiao-er，Feng Ling-ling．An Anycast QoS Routing Algorithm with Bandwidth and Delay Constraints[J]．Microellectronics & Computer，Vol23，No．10，2006．
[47] Su Wen?li，Xu Qian，Li Bingzhi．Implement on Constraint ?Based Routing Algorithm in Intelligent Optical Networks[J]．MICROELECTRONICS & COMPUTER，Vol25，No．4，April 2008．
[48] Yang Huajiang，Chen Yan，Shen Lincheng．Approach for Multiple Constrained QoS Routing Problem Based on Improved Ant Colony Algorithm[J]．Computer Applications and Software，Vol25，No．5，May 2008．
[49] Wu Min，Su Houqin，Wang Mingzhong．Research and Implemation for The Algorithm of kTH Apporoching Shortest Path[J]．Computer Applications and S oftware，Vol21，No．8，Aug 2004．
[50] Lu Sheng li，Li Jing bo．Practical Application of the Shortest Path Algorithm to Production Optimization[J]．Control Engineering of China，2006 Sep，Vo113，No．5．
[51] Zhang Zhi-jie．Research of QoS Mechanism on Optical Network[J]．Coal Technology，Vol29，No．11，November 2010．
[52]王勇，利韶聪，陈宝仁．电力通信业务应用及发展分析[J]．电力系统通信，Vol31，No．217，Nov 10，2010．
[53] Xu Jun，Chang Hui you，Xu Chang，Yi Yang．Shared link Protection Algorithm with Correlated L ink Failure Probability in ASON[J]．Journal of Chinese Computer Systems，Vol31，No．7，2010．
[54] Tang Yin，Qin Kai-yu，Wang Guo-yi，Li Ning．A Protection Routing Algorithm for Optical Communication Networks Quality Assurance[J]．Electronics Quality，2010，Vol6．
[55]成功，杨佃福．VB中几种数据库访问技术的比较与选择[J]．计算机应用研究，2002，19(2):82-84．
[56]苏文莉，徐前，李秉智．智能光网络中的CSPF仿真设计[J]．微计算机信息(测控自动化)，2008年第24卷第3-1期．
[2]秦立军,马其燕.智能配电网及其关键技术[M].北京:中国电力出版社, 2010.
[3]何维.电力通信系统ASON网络技术演进探讨[J].电力系统通信,Vol31,No.213,Jul 10,2010.
[4]黄湧．ASON在电力系统通信网的应用研究[J].电力系统通信,Vol27,No.170,Dec 10,2006.
[5]范俊成.ASON在电力系统的应用分析[J].中国新通信,2010年10月,P5-7.
[6]张杰.自动交换光网络ASON[M].北京:人民邮电出版社,2004.
[7]吴中平.IP网络的QoS路由算法研究[D].天津大学,2007.
[8] Da-chuan Wei.Implementation of Route Selection Function Based on Improved Floyd Algorithm[A].Information Engineering (ICIE),2010 WASE International Conference,2010,Aug 14-15,Vol2,P223–227.
[9]谢金星,刑文训,王振波.网络优化[M].北京:清华大学出版社,2009.
[10] Xin Yuan.On the extended Bellman-Ford algorithm to solve two-constrained quality of service routing problems[A] . Computer Communications and Networks, 1999 Oct,P304-310.
[11]王桂平,王衍,任嘉辰.图论算法理论实现及应用[M].北京大学出版社,2011.
[12] Wang Shu-xi , Zhao Xing-qiu . The improved Dijkstra's shortest path algorithm[A]Natural Computation(ICNC) , 2011 Seventh International Conference.26-28 July 2011,Vol4, P2313–2316.
[13]李元臣,刘维群.基于Dijkstra算法的网络最短路径分析[J].微计算机应用,2004年5月第25卷第3期.
[14] DongKai Fan,Ping Shi . Improvement of Dijkstra's algorithm and its application in route planning[A]. Fuzzy Systems and Knowledge Discovery (FSKD), 2010 Seventh International Conference.2010, Aug10-12 ,Vol4,P1901–1904.
[15]赵海雁,陈立潮.多约束条件下最短路径QoS路由算法[J].华北工学院学报.2004,25(1):49-51.
[16] T Korkmaz,M Krunz.A randomized algorithm for finding a path subject to multiple qos requirements[J].Computer Networks,2001:251-268.
[17] Yuan X,Liu X.Heuristic Algorithms for Multi-Constrained Quality of Service Routing[A].Proceedings of the IEEE INFOCOM2001[C].IEEE Communication Society,2001:844-853.
[18] Chen S,Nahrstedt K.On Finding Multi-Constrained Paths[A].Proceedings of the IEEE International Conference on Communications(ICC’98)[C] . IEEE Communication Society ,2001:874-879.
[19] Juttner A,Szviatiovski Mecs B.Lagrange relaxation based method for the QoS routing problem[A] . Proceedings of the IEEE INFOCOM2001[C] . IEEE Communication Society,2001:859-868.
[20]张龙.电力行业大型IP广域网的服务质量保证[J].电力信息化,2008年08期.
[21]徐磊,徐茹枝.电力数据网络中的QoS体系研究[J].华北电力大学学报, Vol33,No.2,Mar 2006.
[22]黄盛.智能配电网通信业务需求分析及技术方案[J].电力系统通信, Vol31,No.212,Jun.10,2010.
[23]张淑娥,孔英会,高强.电力系统通信技术[M].中国电力出版社,2005.
[24]王学军.OPPC在中低压输电线路中的应用[J].机电信息,2010年第24期.
[25]林培勇.光缆生产和施工过程中光纤附加衰减的成因及避免方法浅析[J].中国高新技术企业,2008年第7期.
[26]王巧梅.酸溶法大截面光纤传像束制备工艺及性能研究[D].长春理工大学,2007.
[27] YD/T 5XXX-2005,长途通信干线光缆传输系统线路工程验收规范[S].
[28]陈春风.光网状网中的路径保护技术研究[D].上海交通大学,2007.
[29]徐俊,常会友,许昌,衣杨.ASON中考虑双链路失效的共享链路保护方法[J].小型微型计算机系统.2010年7月第7期.
[30] Ben Ali N, Belghith A, Moulierac J, Molnar M.QoS multicast aggregation under multiple additive constraints[J].Computer Communications,September 25, 2008,Vol31,P3564-3578.
[31] LIU G,RAMAKRISHNAN K G.A*Prune:An Algorithm for Finding k-Shortest Paths Subject to Multiple Constraints[C] . Proceedings of the INFOCOM 2001 Conference,IEEE,Anchorage,Alaska,2001:743-749.
[32]柴登峰,张登荣.前N条最短路径问题的算法及应用[J].杭州:浙江大学学报(工学版).2002,36(5)531-534.
[33] Yang Yun, Xu Jia,Li Qian-mu,Liu Feng-yu.Multi-object QoS routing algorithm based on Dijkstra strategy[J].Mini-Micro Systems,Vol25,No.9,Sept 2004.
[34]孙雨耕,胡华东,杨挺.一种应用于路由规划的实用无环K路算法[J].计算机工程,Vol29,No.22,December 2003.
[35]白轶多,胡鹏,夏兰芳,郭峰林.关于k次短路径问题的分析与求解[J].武汉大学学报(信息科学版) ,2009 Apr, Vol34,No. 4.
[36] R.Leela,S.Selvakumar.Genetic algorithm approach to dynamic multi constraint multi path QoS routing algorithm for IP networks[A].1st International Conference on Communication Systems and Networks and Workshops , COMSNETS 2009.January 5,January 10, 2009.
[37] Shigeo Shioda,Kenichi Mase.Performance Comparison between IntServ-Based and DiffServ-Based Networks[A].Global Telecommunications Conference,GLOBECOM'05.2005 Dec, Vol1,p534.
[38]李敏,陆芸婷.多约束QoS路由算法综述[J].深圳信息职业技术学院学报,Vol6,No.2,Jun 2008.
[39] Yang Yun , Xu Jia , Li Qianmu , Liu Feng-yu . Mini Micro Systems[J].Multi—Object QoS Routing Algorithm Based on Dijkstra Strategy,Vol25 ,No.9,Sep 2004.
[40] Zhou Xian-shu . Shortest Path Problem and its Solution Methods Study[J].Computer Knowledge and Technology,Vo16,No.6,p1403—1405,14l2,February 2010.
[41] Jiang Weixing . Reserch of Multi-constrained QoS--based Routing Technology[J] .Computer Knowledge and Technology,Vol5,No.33,P9164-9165,9170,November 2009.
[42]高昆仑,江鸥.电力系统IP宽带综合业务网络平台技术的探讨[A].中国电机工程协会电力通信专业委员会第四届学术会议论文集[C].2009.9,P119-123.
[43] Hu Zhong-hai , Zhou Li-chao , Gui Zhi-bo , Delay-bandwidth constrained QoS unicast routing algorithms considering uncertain information.2005 IEEE International Conference,2005,May16-20, Vol1,p229-232.
[44] Aissa, M,Ben Mnaouer, A, Youssef, H, Belghith, A.A New MulticastRouting Algorithm with Cost，Delay and Delay-Variation Constraints．2010，Oct8-10，p1-8．
[45] Shi Jian，Dong Tian lin，Zou Ling，Du Ting．Multicast routing algorithm with delay and bandwidth constrained[J]．JOURNAL OF CHINA INSTITUTE OF COMMUNICATIONS，Vol 22，No．7，July 2001．
[46] Li Tao-shen，Chen Song-qiao，Chen Jiao-er，Feng Ling-ling．An Anycast QoS Routing Algorithm with Bandwidth and Delay Constraints[J]．Microellectronics & Computer，Vol23，No．10，2006．
[47] Su Wen?li，Xu Qian，Li Bingzhi．Implement on Constraint ?Based Routing Algorithm in Intelligent Optical Networks[J]．MICROELECTRONICS & COMPUTER，Vol25，No．4，April 2008．
[48] Yang Huajiang，Chen Yan，Shen Lincheng．Approach for Multiple Constrained QoS Routing Problem Based on Improved Ant Colony Algorithm[J]．Computer Applications and Software，Vol25，No．5，May 2008．
[49] Wu Min，Su Houqin，Wang Mingzhong．Research and Implemation for The Algorithm of kTH Apporoching Shortest Path[J]．Computer Applications and S oftware，Vol21，No．8，Aug 2004．
[50] Lu Sheng li，Li Jing bo．Practical Application of the Shortest Path Algorithm to Production Optimization[J]．Control Engineering of China，2006 Sep，Vo113，No．5．
[51] Zhang Zhi-jie．Research of QoS Mechanism on Optical Network[J]．Coal Technology，Vol29，No．11，November 2010．
[52]王勇，利韶聪，陈宝仁．电力通信业务应用及发展分析[J]．电力系统通信，Vol31，No．217，Nov 10，2010．
[53] Xu Jun，Chang Hui you，Xu Chang，Yi Yang．Shared link Protection Algorithm with Correlated L ink Failure Probability in ASON[J]．Journal of Chinese Computer Systems，Vol31，No．7，2010．
[54] Tang Yin，Qin Kai-yu，Wang Guo-yi，Li Ning．A Protection Routing Algorithm for Optical Communication Networks Quality Assurance[J]．Electronics Quality，2010，Vol6．
[55]成功，杨佃福．VB中几种数据库访问技术的比较与选择[J]．计算机应用研究，2002，19(2):82-84．
[56]苏文莉，徐前，李秉智．智能光网络中的CSPF仿真设计[J]．微计算机信息(测控自动化)，2008年第24卷第3-1期．