检索结果-南通市图书馆

Dynamic recovery for survivable virtual network embedding

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2014年第3期21卷 77-84页

作者： LU Bo HUANG Tao SUN Xiao-chuan CHEN Jian-ya LIU Yun-jie Beijing Key Laboratory of network System Architecture and Convergence Beijing University of Posts and Telecommunications School of Information Engineering Hebei United University

network virtualization is a promising way to overcome the current ossification of the Intemet. It is essential challenge to find effective, efficient and robust embedding algorithms for recovering virtual network. The virtual network mapping algorithm based on integer programming which was proposed months ago. But it did consider the faults of physical network resources, which is so called survivable virtual network embedding （VNE） problem. Previous strategies for enabling survivability in network virtualization focused on providing protection for the physical network or enhancing the virtual networks by providing backup physical resources in advance, and treated all the physical failures as link failures. In the article, a dynamic recovery method is proposed to solve the survivable virtual network embedding problem based on the integer programming VNE algorithm. The dynamic recovery method doesn＇t need to backup physical resources and it makes more substrate resources which can be used in the embedding. The dynamic recovery process will be activated only when physical failures occur. Different algorithms are used to recovery node and link failures. Simulations show that the method helps to recover almost all of physical failures by finding the substitute nodes and paths, and its performance is very close to that of pure VNE method without considering physical failures.

关键词： network virtualization integer programming survivable virtual network embedding dynamic recovery

A virtual network mapping algorithm based on integer programming

在线全文

学校读者我要写书评

暂无评论

Journal of Zhejiang University-Science C(Computers and Electronics) 2013年第12期14卷 899-908页

作者： Bo LU Jian-ya CHEN Hong-yan CUI Tao HUANG Yun-jie LIU Beijing Key Laboratory of network System Architecture and Convergence Beijing University of Posts and Telecommunications

The virtual network(VN) embedding/mapping problem is recognized as an essential question of network virtualization. The VN embedding problem is a major challenge in this field. Its target is to efficiently map the virtual nodes and virtual links onto the substrate network resources. Previous research focused on designing heuristic-based algorithms or attempting two-stage solutions by solving node mapping in the first stage and link mapping in the second stage. In this study, we propose a new VN embedding algorithm based on integer programming. We build a model of an augmented substrate graph, and formulate the VN embedding problem as an integer program with an objective function and some constraints. A factor of topology-awareness is added to the objective function. The VN embedding problem is solved in one stage. Simulation results show that our algorithm greatly enhances the acceptance ratio, and increases the revenue/cost(R/C) ratio and the revenue while decreasing the cost of the VN embedding problem.

关键词： Virtual network embedding Integer programming Topology-awareness network virtualization

A Topology-Cognitive Algorithm Framework for Virtual network Embedding Problem

在线全文

学校读者我要写书评

暂无评论

China Communications 2014年第4期11卷 73-84页

作者： HUANG Tao LIU Jiang CHEN Jianya LIU Yunjie State Key Laboratory of networking and Switching Technology Beijing University of Post and Telecommunications Beijing 100876 China Beijing Key Laboratory of network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing 100876 China

The virtual network embedding/mapping problem is an important issue in network virtualization in Software-Defined networking(SDN).It is mainly concerned with mapping virtual network requests,which could be a set of SDN flows,onto a shared substrate network automatically and *** researches mainly focus on developing heuristic algorithms for general topology virtual *** practice however,the virtual network is usually generated with specific topology for specific ***,it is a challenge to optimize the heuristic algorithms with these topology *** order to deal with this problem,we propose a topology-cognitive algorithm framework,which is composed of a guiding principle for topology algorithm developing and a compound *** compound algorithm is composed of several subalgorithms,which are optimized for specific *** develop star,tree,and ring topology algorithms as examples,other subalgorithms can be easily achieved following the same *** simulation results show that the topology-cognitive algorithm framework is effective in developing new topology algorithms,and the developed compound algorithm greatly enhances the performance of the Revenue/Cost(R/C) ratio and the Runtime than traditional heuristic algorithms for multi-topology virtual network embedding problem.

关键词： network virtualization software- defined networking virtual network embedding topology-cognitive

Adaptive scheme based on status feedback for virtual network mapping

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2011年第5期18卷 87-94页

作者： LU Bo HUANG Tao WANG Zhen-kai CHEN Jian-ya LIU Yun-jie LIU Jiang Key Laboratory of Universal Wireless Communications Ministry of Education Beijing University of Posts and Telecommunications Beijing 100876 China

network virtualization is considered as a powerful way to deploy different network architectures and protocols over a shared physical infrastructure. Virtual network （VN） embedding plays an important role in the network virtualization environment. Virtual network embedding is mainly about mapping virtual nodes and virtual links onto the physical network resources efficiently. However, load balancing of substrate network has not received much consideration. This paper proposes an adaptive virtual network mapping algorithm based on status feedback. The main contribution is to embed the virtual network requests according to the current load distribution of substrate network. This adaptive algorithm differentiates the residual bandwidth of substrate links and takes full advantage of the multi-path to improve the load balancing of the substrate network. Simulation experiments show that the proposed algorithm improves the load distribution of substrate network distinctly while reducing the average substrate link stress significantly.

关键词： network virtualization virtual network embedding load balancing

A Virtual network Mapping Algorithm Based on Time

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2014年第1期23卷 31-36页

作者： JIANG Ming ZHAO Zhiyang ZHANG Min TANG Jingfan WU Chunming MIN Xiao Institute of Software and Intelligent Technology Hangzhou Dianzi University College of Computer Science and Technology Zhejiang University Mathematics and Information Engineering College of Jiaxing University

As one of the challenges for network virtualization, virtual network embedding which maps Virtual network(VN) to the substrate network and allocates resources according to the requirements of VN in an efficient way has gained great attention. Existing algorithms generally make their decision according to the present available substrate network resource, especially bandwidth. This paper proposes a time-based VN embedding algorithm. A probability model is formulated to obtain the maximum probability that the available resources of substrate network can be used by succeeding VN requests. The probability is set as the weight of the node and the greedy algorithm is employed to embed the virtual node. The reciprocal of the probability is set as the weight of the link and the shortest path algorithm is employed to embed the virtual link. Simulation experiments show that the proposed algorithm increases the acceptance rate and the revenue compared to the existing algorithms.

关键词： network virtualization Time Probability Virtual network embedding

An Exact Virtual network Embedding Algorithm Based on Integer Linear Programming for Virtual network Request with Location Constraint

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

China Communications 2016年第8期13卷 177-183页

作者： Zeheng Yang Yongan Guo School of Computer Science and Engineering University of Electronic Science and Technology of China(UESTC) College of Telecommunications and Information Engineering Nanjing University of Posts and Telecommunications

network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the *** exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link *** on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate *** topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.

关键词： network virtualization virtual network embedding exact VNE algorithm integer linear Programming location constraint VNR acceptance ratio

Virtual network mapping algorithm for large-scale network environment

在线全文

学校读者我要写书评

暂无评论

Journal of Harbin Institute of Technology(New Series) 2012年第4期19卷 55-63页

作者：张顺利邱雪松孟洛明 State Key Laboratory of networking and Switching Technology Beijing University of Posts and Telecommunications

A major challenge of network virtualization is the virtual network resource allocation problem that deals with efficient mapping of virtual nodes and virtual links onto the substrate network resources. However, the existing algorithms are almost concentrated on the randomly small-scale network topology, which is not suitable for practical large-scale network environments, because more time is spent on traversing SN and VN, resulting in VN requests congestion. To address this problem, virtual network mapping algorithm is proposed for large-scale network based on small-world characteristic of complex network and network coordinate system. Compared our algorithm with algorithm D-ViNE, experimental results show that our algorithm improves the overall performance.

关键词： network virtualization virtual network mapping complex network network coordinate system simulated annealing algorithm

Virtual network Mapping Through Locality-aware Topological Potential and Influence Node Ranking

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2014年第1期23卷 61-64页

作者： ZHANG Dong GAO Long College of Mathematics and Computer Science Fuzhou University

Efficiently mapping multiple independent Virtual networks(VNs) over a common infrastructure substrate is a challenging problem on cloud computing platforms and large-scale future Internet testbeds. Inspired by the idea of data fields, we apply a topological potential function to node ranking and propose an algorithm called Locality-aware node topological potential ranking(LNTPR), which can precisely and efficiently reflect the relative importance of nodes. Using LNTPR and the concept of locality awareness, we develop the Locality-aware influence choosing node(LICN) algorithm based on a node influence model that considers the mutual influence between a mapped node and its candidate mapping *** and LICN improve the integration of node and link mapping. Simulation results demonstrate that the proposed algorithms exhibit good performance in determining revenue, acceptance ratio, and revenue/cost ratio.

关键词： network virtualization Virtual network Topological potential Influence model Locality-aware

Green networking Based Energy Efficient Communications

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

China Communications 2012年第2期9卷 22-30页

作者： Wang Wennai Mi Zhengkun Wang Bin Key Lab of Broadband Wireless Communication and Sensor network Technology(Nanjing University of Posts andTelecommunications) Nanjing 210003P.R.China

The mainstream approaches to green networking are discussed first from the view of engineering,including resource consolidation,server virtualization,selective connectedness,and proportional computing.A brief introduction to network virtualization techniques is given then and a virtual node embedding approach is ***,three kinds of enhanced green networking schemes by network virtualization are proposed,that is enhancement to sever virtualization,resource consolidation and Adaptive Link Rate(ALR).Examples are included to show the virtue of network virtualization to green networking in terms of energy efficient communications.

关键词： energy efficient communications greennetworking network virtualization green of Infor-mation and Communications Technology (ICT)