Path protections have become increasingly important for current mesh optical networks because fast restorations in generalized multiprotocol label switching （GMPLS） networks are uncertain. However, setting up additi...Path protections have become increasingly important for current mesh optical networks because fast restorations in generalized multiprotocol label switching （GMPLS） networks are uncertain. However, setting up additional disjoint paths to protect connections leads to more path setup blocking and signaling collisions. We analyze signaling collisions, path blocking and blocking probability, as well as calculate node-to-node blocking probabilities. A signaling-based path-segment protection （PSP） is proposed, which integrates segment protections and path protections as well as enhances the performance of path protections and ring protections. The setup of PSP connections causes less blocking probability than the setup of path protection connections in the simulations.展开更多
Path computation elements （PCEs） are employed to compute end-to-end paths across multi-domain optical networks due to the advantages of powerful computation capability. However, PCEs＇ location selection is still an...Path computation elements （PCEs） are employed to compute end-to-end paths across multi-domain optical networks due to the advantages of powerful computation capability. However, PCEs＇ location selection is still an open problem which is closely related to the communication overhead. This paper mainly focuses on the problem of PCEs＇ location selection to minimize the overall communication overhead in the control plane. The problem is formulated as a quadratic integer programming （QIP） model, and an optimal decision rule is gained from the solution of the QIP model. Then based on the decision rule, a distributed heuristic algorithm is proposed for dynamic network scenario. Simulation results demonstrate the benefit and the effectiveness of our proposed approach by comparing it with random selection policy.展开更多
A novel prefigured-cycle(P-Cycle)algorithm was proposed to improve the protection success ratio for asymmetric traffic in mesh optical networks.The proposed algorithm was simulated in a Pan-European COST239 network en...A novel prefigured-cycle(P-Cycle)algorithm was proposed to improve the protection success ratio for asymmetric traffic in mesh optical networks.The proposed algorithm was simulated in a Pan-European COST239 network environment under an asymmetric dynamic traffic model.The experimental results show that the proposed algorithm has lower capacity redundancy and higher utilization rate of configured resources than traditional P-Cycle methods.Network performance can be improved when implementing this algorithm under single-link failure circumstances.The system behavior is analyzed under different traffic volumes and the configuration strategy is also investigated for the heavyload and light-load networks respectively.展开更多
Aiming at the problem of dynamic multicast service protection in multi-domain optical network, this paper proposes a dynamic multicast sharing protection algorithm based on fuzzy game in multi-domain optical network. ...Aiming at the problem of dynamic multicast service protection in multi-domain optical network, this paper proposes a dynamic multicast sharing protection algorithm based on fuzzy game in multi-domain optical network. The algorithm uses the minimum cost spanning tree strategy and fuzzy game theory. First, it virtualizes two planes to calculate the multicast tree and the multicast protection tree respectively. Then, it performs a fuzzy game to form a cooperative alliance to optimize the path composition of each multicast tree. Finally, it generates a pair of optimal multicast work tree and multicast protection tree for dynamic multicast services. The time complexity of the algorithm is O(k3 m2 n), where n represents the number of nodes in the networks, k represents the number of dynamic multicast requests, and m represents the number of destination nodes for each multicast request. The experimental results show that the proposed algorithm reduces significantly the blocking rate of dynamic multicast services, and improves the utilization of optical network resources within a certain number of dynamic multicast request ranges.展开更多
基金supported in part by the National "863" Program of China(No.2009AA01A345)the National "973" Program of China(No.2011CB302702)the National Natural Science Foundation of China (No.60932004)
文摘Path protections have become increasingly important for current mesh optical networks because fast restorations in generalized multiprotocol label switching （GMPLS） networks are uncertain. However, setting up additional disjoint paths to protect connections leads to more path setup blocking and signaling collisions. We analyze signaling collisions, path blocking and blocking probability, as well as calculate node-to-node blocking probabilities. A signaling-based path-segment protection （PSP） is proposed, which integrates segment protections and path protections as well as enhances the performance of path protections and ring protections. The setup of PSP connections causes less blocking probability than the setup of path protection connections in the simulations.
基金supported by the National Basic Research Program of China (2010CB328202, 2010CB328204, and 2012CB315604)the Hi-Tech Research and Development Program of China (2012AA011302)+3 种基金the Beijing Nova Program (2011065)the RFDP Project (20120005120019)the Fundamental Research Funds for the Central Universities (2013RC1201)the Fund of State Key Laboratory of Information Photonics and Optical Communications (BUPT)
文摘Path computation elements （PCEs） are employed to compute end-to-end paths across multi-domain optical networks due to the advantages of powerful computation capability. However, PCEs＇ location selection is still an open problem which is closely related to the communication overhead. This paper mainly focuses on the problem of PCEs＇ location selection to minimize the overall communication overhead in the control plane. The problem is formulated as a quadratic integer programming （QIP） model, and an optimal decision rule is gained from the solution of the QIP model. Then based on the decision rule, a distributed heuristic algorithm is proposed for dynamic network scenario. Simulation results demonstrate the benefit and the effectiveness of our proposed approach by comparing it with random selection policy.
基金supported by the Hi-Tech Research and Development Program of China (No.2006AA01Z246)the National Natural Science Foundation of China (Grant No.60602004).
文摘A novel prefigured-cycle(P-Cycle)algorithm was proposed to improve the protection success ratio for asymmetric traffic in mesh optical networks.The proposed algorithm was simulated in a Pan-European COST239 network environment under an asymmetric dynamic traffic model.The experimental results show that the proposed algorithm has lower capacity redundancy and higher utilization rate of configured resources than traditional P-Cycle methods.Network performance can be improved when implementing this algorithm under single-link failure circumstances.The system behavior is analyzed under different traffic volumes and the configuration strategy is also investigated for the heavyload and light-load networks respectively.
基金supported by the National Natural Science Foundation of China (No.61402529)the Natural Science Basic Research Plan in Shanxi Province of China (No.2020JM-361)+1 种基金the Young and Middle-aged Scientific Research Backbone Projects of Engineering University of PAP (No.KYGG201905)the Basic Researchof Engineering University of PAP (Nos.WJY201920 and WJY202019)。
文摘Aiming at the problem of dynamic multicast service protection in multi-domain optical network, this paper proposes a dynamic multicast sharing protection algorithm based on fuzzy game in multi-domain optical network. The algorithm uses the minimum cost spanning tree strategy and fuzzy game theory. First, it virtualizes two planes to calculate the multicast tree and the multicast protection tree respectively. Then, it performs a fuzzy game to form a cooperative alliance to optimize the path composition of each multicast tree. Finally, it generates a pair of optimal multicast work tree and multicast protection tree for dynamic multicast services. The time complexity of the algorithm is O(k3 m2 n), where n represents the number of nodes in the networks, k represents the number of dynamic multicast requests, and m represents the number of destination nodes for each multicast request. The experimental results show that the proposed algorithm reduces significantly the blocking rate of dynamic multicast services, and improves the utilization of optical network resources within a certain number of dynamic multicast request ranges.
