http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Enhanced Dynamic Segment Protection in WDM Optical Networks under Reliability Constraints
Lei Guo,Jin Cao,Hongfang Yu,Lemin Li 한국전자통신연구원 2006 ETRI Journal Vol.28 No.1
In this letter, we study the protection problem in wavelength division multiplexing (WDM) optical networks, and propose a novel dynamic heuristic algorithm called differentiated reliable segment protection (DRSP). Differing from previous work, DRSP can effectively avoid the trap problem and is able to find a feasible solution for each connection request. Therefore, DRSP outperforms the previous work. Simulation results have shown to be promising.
( Dan Liao ),( Gang Sun ),( Vishal Anand ),( Hongfang Yu ) 한국인터넷정보학회 2014 KSII Transactions on Internet and Information Syst Vol.8 No.7
Network virtualization technology plays a key role in cloud computing, which serves as an effective approach for provisioning a flexible and highly adaptable shared substrate network to satisfy the demands of various applications or services. Recently, the problem of mapping a virtual network (VN) onto a substrate network has been addressed by various algorithms. However, these algorithms are typically efficient for unicast service-oriented virtual networks, and generally not applicable to multicast service-oriented virtual networks (MVNs). Furthermore, the survivable MVN mapping (SMVNM) problem that considers the survivability of MVN has not been studied and is also the focus of this work. In this research, we discuss SMVNM problem under regional failures in the substrate network and propose an efficient algorithm for solving this problem. We first propose a framework and formulate the SMVNM problem with the objective of minimizing mapping cost by using mixed integer linear programming. Then we design an efficient heuristic to solve this problem and introduce several optimizations to achieve the better mapping solutions. We validate and evaluate our framework and algorithms by conducting extensive simulations on different realistic networks under various scenarios, and by comparing with existing approaches. Our simulation experiments and results show that our approach outperforms existing solutions.