http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : ( Yuze Su ) (검색결과 3 건)
- 무료
- 기관 내 무료
- 유료
-
Cognitive Virtual Network Embedding Algorithm Based on Weighted Relative Entropy
( Yuze Su ),( Xiangru Meng ),( Zhiyuan Zhao ),( Zhentao Li ) 한국인터넷정보학회 2019 KSII Transactions on Internet and Information Syst Vol.13 No.4
Current Internet is designed by lots of service providers with different objects and policies which make the direct deployment of radically new architecture and protocols on Internet nearly impossible without reaching a consensus among almost all of them. Network virtualization is proposed to fend off this ossification of Internet architecture and add diversity to the future Internet. As an important part of network virtualization, virtual network embedding (VNE) problem has received more and more attention. In order to solve the problems of large embedding cost, low acceptance ratio (AR) and environmental adaptability in VNE algorithms, cognitive method is introduced to improve the adaptability to the changing environment and a cognitive virtual network embedding algorithmbased on weighted relative entropy (WRE-CVNE) is proposed in this paper. At first, the weighted relative entropy (WRE) method is proposed to select the suitable substrate nodes and paths in VNE. In WRE method, the ranking indicators and their weighting coefficients are selected to calculate the node importance and path importance. It is the basic of the WRE-CVNE. In virtual node embedding stage, the WRE method and breadth first search (BFS) algorithm are both used, and the node proximity is introduced into substrate node ranking to achieve the joint topology awareness. Finally, in virtual link embedding stage, the CPU resource balance degree, bandwidth resource balance degree and path hop counts are taken into account. The path importance is calculated based on the WRE method and the suitable substrate path is selected to reduce the resource fragmentation. Simulation results show that the proposed algorithm can significantly improve AR and the long-term average revenue to cost ratio (LTAR/CR) by adjusting the weighting coefficients in VNE stage according to the network environment. We also analyze the impact of weighting coefficient on the performance of the WRE-CVNE. In addition, the adaptability of the WRE-CVNE is researched in three different scenarios and the effectiveness and efficiency of the WRE-CVNE are demonstrated.
-
Virtual Network Embedding based on Node Connectivity Awareness and Path Integration Evaluation
( Zhiyuan Zhao ),( Xiangru Meng ),( Yuze Su ),( Zhentao Li ) 한국인터넷정보학회 2017 KSII Transactions on Internet and Information Syst Vol.11 No.7
As a main challenge in network virtualization, virtual network embedding problem is increasingly important and heuristic algorithms are of great interest. Aiming at the problems of poor correlation in node embedding and link embedding, long distance between adjacent virtual nodes and imbalance resource consumption of network components during embedding, we herein propose a two-stage virtual network embedding algorithm NA-PVNM. In node embedding stage, resource requirement and breadth first search algorithm are introduced to sort virtual nodes, and a node fitness function is developed to find the best substrate node. In link embedding stage, a path fitness function is developed to find the best path in which available bandwidth, CPU and path length are considered. Simulation results showed that the proposed algorithm could shorten link embedding distance, increase the acceptance ratio and revenue to cost ratio compared to previously reported algorithms. We also analyzed the impact of position constraint and substrate network attribute on algorithm performance, as well as the utilization of the substrate network resources during embedding via simulation. The results showed that, under the constraint of substrate resource distribution and virtual network requests, the critical factor of improving success ratio is to reduce resource consumption during embedding.
-
Different QoS Constraint Virtual SDN Embedding under Multiple Controllers
( Zhiyuan Zhao ),( Xiangru Meng ),( Siyuan Lu ),( Yuze Su ) 한국인터넷정보학회 2018 KSII Transactions on Internet and Information Syst Vol.12 No.9
Software-defined networking (SDN) has emerged as a promising technology for network programmability and experiments. In this work, we focus on virtual network embedding in multiple controllers SDN network. In SDN virtualization environment, virtual SDN networks (vSDNs) operate on the shared substrate network and managed by their each controller, the placement and load of controllers affect vSDN embedding process. We consider controller placement, vSDN embedding, controller adjustment as a joint problem, together considering different quality of service (QoS) requirement for users, formulate the problem into mathematical models to minimize the average time delay of control paths, the load imbalance degree of controllers and embedding cost. We propose a heuristic method which places controllers and partitions control domains according to substrate SDN network, embeds different QoS constraint vSDN requests by corresponding algorithms, and migrates switches between control domains to realize load balance of controllers. The simulation results show that the proposed method can satisfy different QoS requirement of tenants, keep load balance between controllers, and work well in the acceptance ratio and revenue to cost ratio for vSDN embedding.
ScienceON
KISS연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
