检索结果-南通市图书馆

virtual network embedding for hybrid cloud rendering in optical and data center networks

Science China(Information Sciences) 2016年第2期59卷 139-152页

作者： Weigang HOU Lei GUO School of Computer Science and Engineering Northeastern University State Key Laboratory of networking and Switching Technology State Key Laboratory of Information Photonics and Optical Communications

Animation rendering consumes massive computation time, therefore cloud rendering is emerging as a solution. Cloud rendering runs over the Data Center network(DCN) and consolidates heterogeneous DC resources into a single cloud renderfarm, where plentiful computing resources can sufficiently accelerate any rendering process. And if one user wants to get a quick animation result, a high-speed optical interconnection is an urgent requirement, thus cloud rendering needs a convergence of Optical and DCN(ODCN) as the substrate network. In the ODCN supporting cloud rendering, each rendering task will be successfully handled only when we embed its virtual network into the cloud renderfarm. But because a virtual network includes virtual machines and virtual lightpaths, we must simultaneously perform the node-level mapping between virtual machine and server, as well as link-level mapping between virtual lightpath and fiber link(s). In addition, the joint implementation of the Photorealistic cloud Rendering(PR) and Non-Photorealistic cloud Rendering(NPR) should be considered to exhibit the unique animation effect with the low mapping cost. In this paper, considering the unique characteristic of hybrid cloud rendering, we flexibly select routing strategies according to the rendering task type. We then utilize server consolidation and traffic grooming to achieve node- and link-level mappings,respectively, thus building a mapping-cost-aware cloud renderfarm that includes multiple virtual networks. The mathematical formulation is also made with a bound analysis. Especially for the lower bound, we analyze the least number of servers and wavelengths(i.e., mapping cost) consumed by hybrid cloud rendering. In terms of heuristics, according to the processing order of rendering tasks, Smaller virtual Resource First(SVRF) and Manycast Routing First(MRF) algorithms are proposed by us. In SVRF, NPR tasks are first tackled and then PR tasks follow. MRF is a reverse process of SVRF. The simu

关键词： hybrid cloud rendering optical and data center network virtual network embedding mapping cost lower bound

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

virtual network embedding Algorithm for Load Balance with Various Requests

引用

Chinese Journal of Electronics 2014年第2期23卷 382-387页

作者： WANG Li QU Hua ZHAO Jihong School of Electronic and Information Engineering Xi'an Jiaotong University School of Communication and Information Engineering Xi'an University of Posts and Telecommunications

virtual network embedding(VNE) is a crucial technology for network virtualization to allocate network resource. virtual network request in which node and link resource have great disparity will lead to unbalanced resource distribution and lower acceptance ratio of virtual network requests. In this paper, we provide a virtual network embedding algorithm for load balance with various requests. It maps virtual nodes to substrate nodes of which node link residual resource ratio is closest to that of virtual nodes, and then maps the virtual link to physical path using shortest path first algorithm with the link node residual resource ratio constraint. Simulation shows that the provided algorithm can get higher acceptance ratio and network resource utilization for load balance.

关键词： virtual network embedding Load balance Heuristic algorithm Node mapping Link mapping

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Efficient Algorithm for Energy-Aware virtual network embedding

引用

Tsinghua Science and Technology 2016年第4期21卷 407-414页

作者： Shuxian Jia Guiyuan Jiang Peilan He Jigang Wu School of Computer Software Technology Zhejiang University Ningbo 315048 China School of Computer Science and Engineering Nanyang Technological University 639798 Singapore State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

network virtualization is a promising approach for resource management that allows customized virtual networks （VNs） to be multiplexed on a shared physical infrastructure. A key function that network virtualization can provide is virtual network embedding （VNE）, which maps virtual networks requested by users to a shared substrate network maintained by an Internet service provider. Existing research has worked on this, but has primarily focused on maximizing the revenue of the Internet service provider. In this paper, we consider energy-aware virtual network embedding, which aims at minimizing the energy consumption for embedding virtual networks in a substrate network. In our optimization model, we consider energy consumption of both links and nodes. We propose an efficient heuristic to assign virtual nodes to appropriate substrate nodes based on priority, where existing activated nodes have higher priority for hosting newly arrived virtual nodes. In addition, our proposed algorithm can take advantage of activated links for embedding virtual links so as to minimize total energy consumption. The simulation results show that, for all the cases considered, our algorithm can improve upon previous work by an average of 12.6% on acceptance rate, while the consumed energy can be reduced by 12.34% on average.

关键词： virtualization technology virtual network embedding energy efficient optimization algorithm

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Topology-aware virtual network embedding based on closeness centrality

引用

Frontiers of Computer Science 2013年第3期7卷 446-457页

作者： Zihou WANG Yanni HAN Tao LIN Yuemei XU Song CI Hui TANG High Performance network Laboratory Institute of Acoustics Chinese Academy of Sciences Beijing 100190 China Department of Computer and Electronics Engineering University of Nebraska-Lincoln NE 68182 USA

network virtualization aims to provide a way to overcome ossification of the Internet. However, making efficient use of substrate resources requires effective techniques for embedding virtual networks： mapping virtual nodes and virtual edges onto substrate networks. Previous research has presented several heuristic algorithms, which fail to consider that the attributes of the substrate topology and virtual net- works affect the embedding process. In this paper, for the first time, we introduce complex network centrality analysis into the virtual network embedding, and propose virtual network embedding algorithms based on closeness centrality. Due to considering of the attributes of nodes and edges in the topology, our studies are more reasonable than existing work. In addition, with the guidance of topology quantitative evalua- tion, the proposed network embedding approach largely improves the network utilization efficiency and decreases the embedding complexity. We also investigate our algorithms on real network topologies （e.g., AT＆T, DFN） and random network topologies. Experimental results demonstrate the usability and capability of the proposed approach.

关键词： network virtualization virtual network embedding complex networks closeness centrality

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

A model for virtual network embedding across multiple infrastructure providers using genetic algorithm

引用

Science China(Information Sciences) 2017年第4期60卷 101-112页

作者： Isha PATHAK Deo Prakash VIDYARTHI School of Computer and Systems Sciences Jawaharlal Nehru University

network virtualization is an important aspect in cloud computing, where network is assumed to be consisting of infinite amount of nodes and links. The substrate network(physical network), has limited capacity and so virtual network embedding on the substrate network becomes a problem. virtual network embedding is a computationally hard problem, considering various constraints on nodes and links. The proposed work applies Genetic Algorithm for the virtual network embedding problem for mapping multiple virtual network requests on infrastructure providers managing multiple substrate networks. Performance evaluation, through simulations,indicates that the proposed model preforms better for the performance metrics such as infrastructure provider revenue, acceptance ratio and node and link utilization in comparison to few other contemporary mapping models.

关键词： network virtualization virtual network embedding substrate network NP-hard genetic algorithm

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

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

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Node Ranking Strategy in virtual network embedding: An Overview

引用

China Communications 2021年第6期18卷 114-136页

作者： Shengchen Wu Hao Yin Haotong Cao Longxiang Yang Hongbo Zhu College of Communication and Information Engineering Nanjing University of Posts and TelecommunicationsJiangsuNanjing 210003China Institute of Electronic System Engineering Beijing 10039China The Hong Kong Polytechnic University 26680 KowloonHongkongHong KongChina

network virtualization(NV)is a highprofile way to solve the ossification problem of the nowadays Internet,and be able to support the diversified network *** NV,virtual network embedding(VNE)problem has been widely considered as a crucial issue,which is aimed to embed virtual networks(VNs)onto the shared substrate networks(SNs)***,some VNE approaches have developed Node Ranking strategies to drive and enhance the embedding *** Ranking Strategy rank/sort the nodes according to the attributes of the node,including both residual local attributes(CPU,Bandwidth,storage,Etc.)and the global topology attributes(Number of neighborhood Nodes,Delay to other nodes,Etc.).This paper presents an overview of Node Ranking Strategies in virtual network embedding,and possible directions of VNE Node Ranking Strategy.

关键词： network virtualization virtual network embedding global topology attribute node ranking

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A new algorithm based on the proximity principle for the virtual network embedding problem

引用

Journal of Zhejiang University-Science C(Computers and Electronics) 2011年第11期12卷 910-918页

作者： Jiang LIU Tao HUANG Jian-ya CHEN Yun-jie LIU Key Laboratory of Universal Wireless Communications of Ministry of Education Beijing University of Post and Telecommunications Beijing 100876 China

The virtual network embedding/mapping problem is a core issue of network virtualization. It is concerned mainly with how to map virtual network requests to the substrate network efficiently. There are two steps in this problem: node mapping and link mapping. Current studies mainly focus on developing heuristic algorithms, since both steps are computationally intractable. In this paper, we propose a new algorithm based on the proximity principle, which considers the distance factor besides the capacity factor in the node mapping step. Thus, the two steps of the embedding problem can be better integrated and the substrate network resource can be used more efficiently. Simulation results show that the new algorithm greatly enhances the performance of the revenue/cost (R/C) ratio, acceptance ratio, and runtime of the embedding problem.

关键词： virtual network embedding Proximity Revenue/cost (R/C) ratio Acceptance ratio Runtime

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A Survey of embedding Algorithm for virtual network embedding

引用

China Communications 2019年第12期16卷 1-33页

作者： Haotong Cao Shengchen Wu Yue Hu Yun Liu Longxiang Yang Jiangsu Key Laboratory of Wireless Communications Nanjing University of Posts and TelecommunicationsNanjing 210003China Department of Key Accounts China Mobile Group Jiangsu Co.Ltd.Nanjing 210029China School of Biomedical Engineering and Information Nanjing Medical UniversityNanjing 211166China

network virtualization(NV) is pushed forward by its proponents as a crucial attribute of next generation network, aiming at overcoming the gradual ossification of current networks, particularly to the worldwide Internet. Through virtualization, multiple customized virtual networks(VNs), requested by users, are allowed to coexist on the underlying substrate networks(SNs). In addition, the virtualization scheme contributes to sharing underlying physical resources simultaneously and seamlessly. However, multiple technical issues still stand in the way of NV successful implementation. One key technical issue is virtual network embedding(VNE), known as the resource allocation problem for NV. This paper conducts a survey of embedding algorithms for VNE problem. At first, the NV business model for VNE problem is presented. Then, the latest VNE problem description is presented. Main performance metrics for evaluating embedding algorithms are also involved. Afterwards, existing VNE algorithms are detailed, according to the novel proposed category approach. Next, key future research aspects of embedding algorithms are listed out. Finally, the paper is briefly concluded.

关键词： network virtualization virtual network embedding embedding algorithms key future research aspects

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Topology Based Reliable virtual network embedding from a QoE Perspective

引用

China Communications 2018年第10期15卷 38-50页

作者： Peiying Zhang Sheng Wu Miao Wang Haipeng Yao Yunjie Liu College of Computer & Communication Engineering China University of Petroleum (East China) State Key Laboratory of networking and Switching Technology Beijing University of Posts and Telecommunications DFH Satellite Co. Ltd.

In the network virtualization environments, one of the most challenges is how to map the virtual networks(VNs) onto a shared substrate network managed by an infrastructure provider(In P), which is termed as virtual network embedding problem. Prior studies on this issue only emphasize on maximizing the revenue or minimizing the energy consumption while ignoring the reliability requirements of end-users. In our work, we incorporate the reliability probability into the virtual network embedding process with an aim to improve the Qo S/Qo E of end users from a new perspective. We devised two novel reliable virtual network embedding algorithms called RRW-Max Match and RDCC-VNE based on RW-Max Match and DCC-VNE, respectively. Extensive simulations demonstrated that the efficiency of our proposed algorithms is better than those of two primitive algorithms in terms of the reliability demands, the acceptance ratio of virtual networks and the long-term average revenue.

关键词： virtual network embedding reliability probability node mapping procedure link mapping procedure node ranking metric

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：