scholarly journals A Processor-Sharing Scheduling Strategy for NFV Nodes

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Giuseppe Faraci ◽  
Alfio Lombardo ◽  
Giovanni Schembra
Keyword(s):  
Resource Allocation ◽  
Future Internet ◽  
Round Robin ◽  
The State ◽  
Virtual Network ◽  
Network Interface ◽  
Processor Sharing ◽  
Extensive Simulation ◽  
Sharing Strategy ◽  
Network Functions

The introduction of the two paradigms SDN and NFV to “softwarize” the current Internet is making management and resource allocation two key challenges in the evolution towards the Future Internet. In this context, this paper proposes Network-Aware Round Robin (NARR), a processor-sharing strategy, to reduce delays in traversing SDN/NFV nodes. The application of NARR alleviates the job of the Orchestrator by automatically working at the intranode level, dynamically assigning the processor slices to the virtual network functions (VNFs) according to the state of the queues associated with the output links of the network interface cards (NICs). An extensive simulation set is presented to show the improvements achieved with respect to two more processor-sharing strategies chosen as reference.

scholarly journals Path Mapping Approach for Network Function Virtualization Resource Allocation with Network Function Decomposition Support

Symmetry ◽  
2019 ◽  
Vol 11 (9) ◽  
pp. 1173 ◽  
Author(s):  
Basheer Raddwan ◽  
Khalil AL-Wagih ◽  
Ibrahim A. Al-Baltah ◽  
Mohamed A. Alrshah ◽  
Mohammed A. Al-Maqri
Keyword(s):  
Resource Allocation ◽  
Execution Time ◽  
Service Providers ◽  
Virtual Network ◽  
Network Function Virtualization ◽  
Network Function ◽  
Function Decomposition ◽  
Mapping Approach ◽  
Network Functions ◽  
The Impact

Recently, Network Function Virtualization (NFV) and Software Defined Networking (SDN) have attracted many mobile operators. For the flexible deployment of Network Functions (NFs) in an NFV environment, NF decompositions and control/user plane separation have been introduced in the literature. That is to map traditional functions into their corresponding Virtual Network Functions (VNFs). This mapping requires the NFV Resource Allocation (NFV-RA) for multi-path service graphs with a high number of virtual nodes and links, which is a complex NP-hard problem that inherited its complexity from the Virtual Network Embedding (VNE). This paper proposes a new path mapping approach to solving the NFV-RA problem for decomposed Network Service Chains (NSCs). The proposed solution has symmetrically considered optimizing an average embedding cost with an enhancement on average execution time. The proposed approach has been compared to two other existing schemes using 6 and 16 scenarios of short and long simulation runs, respectively. The impact of the number of nodes, links and paths of the service requests on the proposed scheme has been studied by solving more than 122,000 service requests. The proposed Integer Linear Programming (ILP) and heuristic schemes have reduced the execution time up to 39.58% and 6.42% compared to existing ILP and heuristic schemes, respectively. Moreover, the proposed schemes have also reduced the average embedding cost and increased the profit for the service providers.

scholarly journals Model-based approach for semantic-driven deployment of containerized applications to support future internet services and architectures

2019 ◽  
Vol 16 (1) ◽  
pp. 21-44 ◽  
Author(s):  
Nenad Petrovic
Keyword(s):  
Future Internet ◽  
The Other ◽  
Virtual Network ◽  
Privacy And Security ◽  
Data Movement ◽  
Security Issues ◽  
Model Based ◽  
Enormous Amount ◽  
Network Functions ◽  
Iot Devices

Due to increasing number of connected Internet of Things (IoT) devices, enormous amount of data needs to be transmitted to the Cloud for processing, while the network is becoming Cloud computing?s bottleneck. On the other side, the privacy and security issues in more sensitive application domains could dramatically restrict the freedom of data movement, so it is not possible to offload all the data to the Cloud for processing. Furthermore, the manual operations related to tuning and deployment of these applications are time-consuming and require additional effort. In this paper, a model-based framework for automated, semantic-driven (re-)deployment of containerized applications is presented, leveraging the synergy of Virtual Network Functions (VNFs) and SDN, tackling the mentioned issues.

ANALYSIS OF MEASURES TO REDUCE ECOLOGICAL AND ECONOMIC DAMAGE FROM AUTOMOBILE TRANSPORT

2020 ◽  
Author(s):  
V.N. Kurdyukov ◽  
◽  
T.V. Lebedeva ◽  
Keyword(s):  
Resource Allocation ◽  
Negative Impact ◽  
The State ◽  
Point Of View ◽  
Motor Vehicles ◽  
Economic Damage ◽  
Agriculture Education

The article considers common classifications of measures to reduce environmentaleconomic damage from motor vehicles. Classification from the point of view of control impact is proposed, which allows to take into account relations between the state and citizens in the field of reduction of negative impact of motor vehicles on the environment. The analysis of the classification made it possible to identify areas of activity for improving the efficiency of management impacts, taking into account the incentives of citizens to comply with the requirements of the legislation and to create conditions for their exceeding. Increasing the efficiency of resource allocation in the Territory will allow the released funds to be allocated to the development of industry, agriculture, education and science.

scholarly journals Efficient Placement of Service Function Chains in Cloud Computing Environments

Electronics ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 323
Author(s):  
Marwa A. Abdelaal ◽  
Gamal A. Ebrahim ◽  
Wagdy R. Anis
Keyword(s):  
Energy Consumption ◽  
Load Balancing ◽  
Response Time ◽  
Optimization Problem ◽  
Service Providers ◽  
Virtual Network ◽  
Placement Problem ◽  
Service Function ◽  
Network Functions ◽  
Bandwidth Consumption

The widespread adoption of network function virtualization (NFV) leads to providing network services through a chain of virtual network functions (VNFs). This architecture is called service function chain (SFC), which can be hosted on top of commodity servers and switches located at the cloud. Meanwhile, software-defined networking (SDN) can be utilized to manage VNFs to handle traffic flows through SFC. One of the most critical issues that needs to be addressed in NFV is VNF placement that optimizes physical link bandwidth consumption. Moreover, deploying SFCs enables service providers to consider different goals, such as minimizing the overall cost and service response time. In this paper, a novel approach for the VNF placement problem for SFCs, called virtual network functions and their replica placement (VNFRP), is introduced. It tries to achieve load balancing over the core links while considering multiple resource constraints. Hence, the VNF placement problem is first formulated as an integer linear programming (ILP) optimization problem, aiming to minimize link bandwidth consumption, energy consumption, and SFC placement cost. Then, a heuristic algorithm is proposed to find a near-optimal solution for this optimization problem. Simulation studies are conducted to evaluate the performance of the proposed approach. The simulation results show that VNFRP can significantly improve load balancing by 80% when the number of replicas is increased. Additionally, VNFRP provides more than a 54% reduction in network energy consumption. Furthermore, it can efficiently reduce the SFC placement cost by more than 67%. Moreover, with the advantages of a fast response time and rapid convergence, VNFRP can be considered as a scalable solution for large networking environments.

Sign in / Sign up

Export Citation Format

Share Document