Constructing Power-Aware Multicast Virtual Networks

2011 ◽  
Vol 308-310 ◽  
pp. 1728-1731
Author(s):  
Ning Qi ◽  
Bin Qiang Wang ◽  
Bo Yuan ◽  
Bo Zhang
Keyword(s):  
Power Consumption ◽  
Greedy Algorithm ◽  
General Public ◽  
Research Community ◽  
Virtual Networks ◽  
Virtual Topology ◽  
Construction Problem ◽  
Construction Algorithm ◽  
Substrate Network

Power consumption of Internet is becoming more and more a sensible problem, which is of interest for both the research community and the general public. In this paper we have formally defined the power-aware multicast VN construction problem and setup an ILP model whose objective is to find a virtual topology on top of substrate network fulfilling all restrictions, while the power consumption of construction is minimized. In order to address the problem efficiently we develop a greedy algorithm: PMVNMH. The efficiency of the power-aware construction algorithm is evaluated by emulation experiment.

scholarly journals A Hybrid Reliable Heuristic Mapping Method Based on Survivable Virtual Networks for Network Virtualization

2015 ◽  
Vol 2015 ◽  
pp. 1-8
Author(s):  
Qiang Zhu ◽  
Hui-Qiang Wang ◽  
Guang-Sheng Feng ◽  
Hong-Wu Lv ◽  
Zhen-Dong Wang ◽  
...  
Keyword(s):  
Network Virtualization ◽  
Mapping Method ◽  
Virtual Network ◽  
Virtual Networks ◽  
Ant Colony Optimization Algorithm ◽  
Single Node ◽  
Routing Problem ◽  
Cut Set ◽  
Substrate Network ◽  
Pass Through

The reliable mapping of virtual networks is one of the hot issues in network virtualization researches. Unlike the traditional protection mechanisms based on redundancy and recovery mechanisms, we take the solution of the survivable virtual topology routing problem for reference to ensure that the rest of the mapped virtual networks keeps connected under a single node failure condition in the substrate network, which guarantees the completeness of the virtual network and continuity of services. In order to reduce the cost of the substrate network, a hybrid reliable heuristic mapping method based on survivable virtual networks (Hybrid-RHM-SVN) is proposed. In Hybrid-RHM-SVN, we formulate the reliable mapping problem as an integer linear program. Firstly, we calculate the primary-cut set of the virtual network subgraph where the failed node has been removed. Then, we use the ant colony optimization algorithm to achieve the approximate optimal mapping. The links in primary-cut set should select a substrate path that does not pass through the substrate node corresponding to the virtual node that has been removed first. The simulation results show that the acceptance rate of virtual networks, the average revenue of mapping, and the recovery rate of virtual networks are increased compared with the existing reliable mapping algorithms, respectively.

scholarly journals PaCoVNE: Power Consumption Aware Coordinated VNE with Delay Constraints

2017 ◽  
Author(s):  
Xavier Hesselbach ◽  
Khaled Hejja
Keyword(s):  
Power Consumption ◽  
Energy Aware ◽  
Delay Constraints ◽  
One Stage ◽  
End To End Delay ◽  
Major Constraint ◽  
Substrate Network ◽  
Simulation Results ◽  
End To End

This paper introduces a more efficient embedding approach, called power consumption aware and coordinated VNE heuristic, denoted as (PaCoVNE). It embeds both virtual nodes and edges, simultaneously, and within one stage, while satisfying: CPU, BW constraints, minimizes power consumption of whole substrate network, and considers end-to- end delay as a major constraint. Performance of the new heuristic was compared to the energy aware algorithm OCA/EA-RH, for off-line scenario using homogeneous configurations, with and without end-to-end delay. The paper also presents simulation results for the two configurations once without end-to-end delay, and also when it was included.

Survivable Mapping of Virtual Networks onto a Shared Substrate Network

2013 ◽  
pp. 325-343
Author(s):  
Vishal Anand
Keyword(s):  
Performance Metrics ◽  
Heuristic Algorithms ◽  
Network Virtualization ◽  
Future Internet ◽  
Mixed Integer ◽  
Virtual Networks ◽  
Future Internet Architecture ◽  
Computing Services ◽  
Underlying Network ◽  
Substrate Network

The virtualization of both servers and substrate networks will enable the future Internet architecture to support a variety of Cloud computing services and architectures, and prevent its ossification. Since multiple virtual networks (VN) or virtual infrastructure (VI) and services now share the resources of the same underlying network in a network virtualization environment, it is important that efficient techniques are developed for the mapping of the VNs onto the substrate network. Furthermore, due to the sharing of resources, the survivable design of VNs is also very important, since now even small failures in the substrate network will cause the disruption of a large number of VNs that may be mapped on to the substrate network. In this work, the author studies the problem of survivable virtual network mapping (SVNM) and first formulates the problem using mixed integer linear programming (MILP). The author then devises two kinds of algorithms for solving the SVNM problem efficiently: (1) Lagrangian relaxation-based algorithms including LR-SVNM-M and LR-SVNM-D and (2) Heuristic algorithms including H-SVNM-D and H-SVNM-M. The author then compares the performance of the algorithms with other VI mapping algorithms under various performance metrics using simulation. The simulation results and analysis show that the algorithms can be used to balance the tradeoff between time efficiency and mapping cost.

scholarly journals Artificial Intelligence Research Community and Associations in Poland

2020 ◽  
Vol 45 (3) ◽  
pp. 159-177
Author(s):  
Grzegorz J. Nalepa ◽  
Jerzy Stefanowski
Keyword(s):  
Artificial Intelligence ◽  
General Public ◽  
Research Community ◽  
Short Paper ◽  
Artificial Intelligence Research ◽  
Tremendous Progress ◽  
Novel Methods ◽  
Scientific Associations ◽  
The Impact

AbstractIn last years Artificial Intelligence presented a tremendous progress by offering a variety of novel methods, tools and their spectacular applications. Besides showing scientific breakthroughs it attracted interest both of the general public and industry. It also opened heated debates on the impact of Artificial Intelligence on changing the economy and society. Having in mind this international landscape, in this short paper we discuss the Polish AI research community, some of its main achievements, opportunities and limitations. We put this discussion in the context of the current developments in the international AI community. Moreover, we refer to activities of Polish scientific associations and their initiative of founding Polish Alliance for the Development of Artificial Intelligence (PP-RAI). Finally two last editions of PP-RAI joint conferences are summarized.

scholarly journals Hierarchical Expertise Level Modeling for User Specific Contrastive Explanations

2018 ◽  
Author(s):  
Sarath Sreedharan ◽  
Siddharth Srivastava ◽  
Subbarao Kambhampati
Keyword(s):  
Greedy Algorithm ◽  
Autonomous Systems ◽  
Optimal Solution ◽  
Research Community ◽  
Domain Model ◽  
Human Model ◽  
Research Attention ◽  
Complete Problem ◽  
Expertise Level ◽  
Different Levels

There is a growing interest within the AI research community in developing autonomous systems capable of explaining their behavior to users. However, the problem of computing explanations for users of different levels of expertise has received little research attention. We propose an approach for addressing this problem by representing the user's understanding of the task as an abstraction of the domain model that the planner uses. We present algorithms for generating minimal explanations in cases where this abstract human model is not known. We reduce the problem of generating an explanation to a search over the space of abstract models and show that while the complete problem is NP-hard, a greedy algorithm can provide good approximations of the optimal solution. We also empirically show that our approach can efficiently compute explanations for a variety of problems.

Assignment of Virtual Networks to Substrate Network for Software Defined Networks

2018 ◽  
Vol 8 (4) ◽  
pp. 29-48
Author(s):  
Ali Akbar Nasiri ◽  
Farnaz Derakhshan
Keyword(s):  
Virtual Network ◽  
Management Service ◽  
Virtual Network Embedding ◽  
Virtual Networks ◽  
Network Embedding ◽  
Network Resources ◽  
Central Controller ◽  
Network Controller ◽  
Physical Resources ◽  
Substrate Network

Assigning multiple virtual network resources to physical network resources, called virtual network embedding (VNE), is known to be non-deterministic polynomial-time hard (NP-hard) problem. Currently software-defined networking (SDN) is gaining popularity in enterprise networks to improve the customizability and flexibility in network management service and reduced operational cost. A central controller in SDNs is an important factor that we need to take care of when we want to assign virtual networks to physical resources. In this work, we address virtual network embedding problems for SDNs. Indeed, our objective is to propose a method to assign virtual networks in the substrate network with minimum physical resources, and also minimizing delays between the virtual network controller and the switches in the virtual network. Our proposed algorithm considers the link and node constraints such as CPU and bandwidth constraints which is necessary to consider when we try to solve virtual network embedding problems.

scholarly journals Literature Studies on Security Warnings Development

2016 ◽  
Vol 2 (1) ◽  
Author(s):  
Zarul Fitri Zaaba ◽  
Steven M. Furnell ◽  
Paul S. Dowland
Keyword(s):  
General Public ◽  
Daily Basis ◽  
End Users ◽  
Research Community ◽  
Community Or

Security warnings are intended to alert users about the possibility of events that may compromise their protection. They encounter security warnings on daily basis in many situations when dealing with their computer. However, prior studies have shown that users often have difficulty in understanding the warnings, which can pose a particular risk in cases where they are required to make a decision. Well gathered information is needed to help the researchers and other people to further understand this area. This paper describes an overview of studies on security warnings. It covers problems that end users encounter with security warnings, possible solutions and approaches of security warnings and useful classification of security warnings studies. It is expected that this paper will benefit the academicians, research community or general public to understand the problems and possible solutions in improving security warnings.

Sign in / Sign up

Export Citation Format

Share Document