Optimization of Internet of Things Remote Desktop Protocol for Low-Bandwidth Environments Using Convolutional Neural Networks.

This paper discusses optimizing desktop image quality and bandwidth consumption in remote IoT GUI desktop scenarios. Remote desktop tools, which are crucial for work efficiency, typically employ image compression techniques to manage bandwidth. Although JPEG is widely used for its efficiency in eliminating redundancy, it can introduce quality loss with increased compression. Recently, deep learning-based compression techniques have emerged, challenging traditional methods like JPEG. This study introduces an optimized RFB (Remote Frame Buffer) protocol based on a convolutional neural network (CNN) image compression algorithm, focusing on human visual perception in desktop image processing. The improved RFB protocol proposed in this paper, compared to the unoptimized RFB protocol, can save 30-80% of bandwidth consumption and enhances remote desktop image quality, as evidenced by improved PSNR and MS-SSIM values between the remote desktop image and the original image, thus providing superior desktop image transmission quality.

A Comprehensive Overview of Network Slicing for Improving the Energy Efficiency of Fifth-Generation Networks.

The introduction of fifth-generation (5G) mobile networks leads to an increase in energy consumption and higher operational costs for mobile network operators (MNOs). Consequently, the optimization of 5G networks' energy efficiency is crucial, both in terms of reducing MNO costs and in terms of the negative environmental impact. However, many aspects of the 5G mobile network technology itself have been standardized, including the 5G network slicing concept. This enables the creation of multiple independent logical 5G networks within the same physical infrastructure. Since the only necessary resources in 5G networks need to be used for the realization of a specific 5G network slice, the question of whether the implementation of 5G network slicing can contribute to the improvement of 5G and future sixth-generation networks' energy efficiency arises. To tackle this question, this review paper analyzes 5G network slicing and the energy demand of different network slicing use cases and mobile virtual network operator realizations based on network slicing. The paper also overviews standardized key performance indicators for the assessment of 5G network slices' energy efficiency and discusses energy efficiency in 5G network slicing lifecycle management. In particular, to show how efficient network slicing can optimize the energy consumption of 5G networks, versatile 5G network slicing use case scenarios, approaches, and resource allocation concepts in the space, time, and frequency domains have been discussed, including artificial intelligence-based implementations of network slicing. The results of the comprehensive discussion indicate that the different implementations and approaches to network slicing pave the way for possible further reductions in 5G MNO energy costs and carbon dioxide emissions in the future.

An E2E Network Slicing Framework for Slice Creation and Deployment Using Machine Learning.

Network slicing shows promise as a means to endow 5G networks with flexible and dynamic features. Network function virtualization (NFV) and software-defined networking (SDN) are the key methods for deploying network slicing, which will enable end-to-end (E2E) isolation services permitting each slice to be customized depending on service requirements. The goal of this investigation is to construct network slices through a machine learning algorithm and allocate resources for the newly created slices using dynamic programming in an efficient manner. A substrate network is constructed with a list of key performance indicators (KPIs) like CPU capacity, bandwidth, delay, link capacity, and security level. After that, network slices are produced by employing multi-layer perceptron (MLP) using the adaptive moment estimation (ADAM) optimization algorithm. For each requested service, the network slices are categorized as massive machine-type communications (mMTC), enhanced mobile broadband (eMBB), and ultra-reliable low-latency communications (uRLLC). After network slicing, resources are provided to the services that have been requested. In order to maximize the total user access rate and resource efficiency, Dijkstra's algorithm is adopted for resource allocation that determines the shortest path between nodes in the substrate network. The simulation output shows that the present model allocates optimum slices to the requested services with high resource efficiency and reduced total bandwidth utilization.

Optimal Resource Allocation for 5G Network Slice Requests Based on Combined PROMETHEE-II and SLE Strategy.

The network slicing of physical infrastructure is required for fifth-generation mobile networks to make significant changes in how service providers deliver and defend services in the face of evolving end-user performance requirements. To perform this, a fast and secure slicing technique is employed for node allocation and connection establishment, which necessitates the usage of a large number of domain applications across the network. PROMETHEE-II and SLE algorithms were used in this study's approach to network design for node allocation and link construction, respectively. The PROMETHEE-II approach takes into account a variety of node characteristics while constructing a node importance rank array (NIRA), including the node capacity, bandwidth of neighboring connections, degree of the node, and proximity centrality among others. The SLE method is proposed to record all possible link configurations for the network slice request (NSR) nodes to guarantee that the shortest path array (SPA) of the NSR has a high acceptance rate. Performance metrics such as the service revenue and acceptance ratio were considered to evaluate the effectiveness of the suggested approach. The effectiveness of network slicing has been further examined under different infrastructure models to determine whether a small-world network structure is beneficial to 5G network. For each scenario, simulations were carried out and the results were compared to previously published findings from other sources.

PALANTIR: An NFV-Based Security-as-a-Service Approach for Automating Threat Mitigation.

Small and medium enterprises are significantly hampered by cyber-threats as they have inherently limited skills and financial capacities to anticipate, prevent, and handle security incidents. The EU-funded PALANTIR project aims at facilitating the outsourcing of the security supervision to external providers to relieve SMEs/MEs from this burden. However, good practices for the operation of SME/ME assets involve avoiding their exposure to external parties, which requires a tightly defined and timely enforced security policy when resources span across the cloud continuum and need interactions. This paper proposes an innovative architecture extending Network Function Virtualisation to externalise and automate threat mitigation and remediation in cloud, edge, and on-premises environments. Our contributions include an ontology for the decision-making process, a Fault-and-Breach-Management-based remediation policy model, a framework conducting remediation actions, and a set of deployment models adapted to the constraints of cloud, edge, and on-premises environment(s). Finally, we also detail an implementation prototype of the framework serving as evaluation material.

Maximizing Resource Efficiency in Wireless Networks through Virtualization and Opportunistic Channel Allocation.

Wireless cellular networks have become increasingly important in providing data access to cellular users via a grid of cells. Many applications are considered to read data from smart meters for potable water, gas, or electricity. This paper proposes a novel algorithm to assign paired channels for intelligent metering through wireless connectivity, which is particularly relevant due to the commercial advantages that a virtual operator currently provides. The algorithm considers the behavior of secondary spectrum channels assigned to smart metering in a cellular network. It explores spectrum reuse in a virtual mobile operator to optimize dynamic channel assignment. The proposed algorithm exploits the white holes in the cognitive radio spectrum and considers the coexistence of different uplink channels, resulting in improved efficiency and reliability for smart metering. The work also defines the average user transmission throughput and total smart meter cell throughput as metrics to measure performance, providing insights into the effects of the chosen values on the overall performance of the proposed algorithm.

Efficient Internet-of-Things Cyberattack Depletion Using Blockchain-Enabled Software-Defined Networking and 6G Network Technology.

Low-speed internet can negatively impact incident response by causing delayed detection, ineffective response, poor collaboration, inaccurate analysis, and increased risk. Slow internet speeds can delay the receipt and analysis of data, making it difficult for security teams to access the relevant information and take action, leading to a fragmented and inadequate response. All of these factors can increase the risk of data breaches and other security incidents and their impact on IoT-enabled communication. This study combines virtual network function (VNF) technology with software -defined networking (SDN) called virtual network function software-defined networking (VNFSDN). The adoption of the VNFSDN approach has the potential to enhance network security and efficiency while reducing the risk of cyberattacks. This approach supports IoT devices that can analyze large volumes of data in real time. The proposed VNFSDN can dynamically adapt to changing security requirements and network conditions for IoT devices. VNFSDN uses threat filtration and threat-capturing and decision-driven algorithms to minimize cyber risks for IoT devices and enhance network performance. Additionally, the integrity of IoT devices is safeguarded by addressing the three risk categories of data manipulation, insertion, and deletion. Furthermore, the prioritized delegated proof of stake (PDPoS) consensus variant is integrated with VNFSDN to combat attacks. This variant addresses the scalability issue of blockchain technology by providing a safe and adaptable environment for IoT devices that can quickly be scaled up and down to pull together the changing demands of the organization, allowing IoT devices to efficiently utilize resources. The PDPoS variant provides flexibility to IoT devices to proactively respond to potential security threats, preventing or mitigating the impact of cyberattacks. The proposed VNFSDN dynamically adapts to the changing security requirements and network conditions, improving network resiliency and enabling proactive threat detection. Finally, we compare the proposed VNFSDN to existing state-of-the-art approaches. According to the results, the proposed VNFSDN has a 0.08 ms minimum response time, a 2% packet loss rate, 99.5% network availability, a 99.36% threat detection rate, and a 99.77% detection accuracy with 1% malicious nodes.

Application of Meta-Heuristics in 5G Network Slicing: A Systematic Review of the Literature.

Network slicing is a vital component of the 5G system to support diverse network scenarios, creating virtual networks (slices) by mapping virtual network requests to real networks. The mapping is an arduous computing process, mathematically studied and known as the Virtual Network Embedding (VNE) problem, and its complexity is NP-Hard. The mapping process is oriented to respect the QoS demands from the virtual network requests and the available resources in the physical-substrate infrastructure. Meta-heuristic approaches are a suitable way to solve the VNE problems because of their capacity to escape from the local optimum and adapt the solution search to complex networks; these abilities are essential in 5G networks scenarios. This article presents a systematic review of meta-heuristics organized by application, development and problem-solving approaches to VNE. It also provides the standard parameters to model the infrastructure and virtual network requests to simulate network slicing as a service. Finally, our work proposes some future research based on the discovered gaps.

A Resource and Task Scheduling Based Multi-Objective Optimization Model and Algorithms in Elastic Optical Networks.

The elastic optical network (EON) adopting virtual network function (VNF) is a new type of network, in which the routing, spectrum, and data center allocation are key and challenging problems, and solving these three problems simultaneously can not only improve the network efficiency for network providers, but also let users obtain better service. However, few existing works handle these three problems simultaneously. To tackle the three problems simultaneously, given a set of network function chains (i.e., a set of tasks), we set up a new multi-objective optimization model in which the total length of paths for all tasks is minimized, the totally occupied spectrums are minimized, and the loads on all data centers are most balanced, simultaneously. To solve the model, we design two new evolutionary algorithms. The experiments are conducted on 16 cases of 4 widely used types of networks, and the results indicate that the proposed model and algorithms are effective.

Towards a Security Reference Architecture for NFV.

Network function virtualization (NFV) is an emerging technology that is becoming increasingly important due to its many advantages. NFV transforms legacy hardware-based network infrastructure into software-based virtualized networks. This transformation increases the flexibility and scalability of networks, at the same time reducing the time for the creation of new networks. However, the attack surface of the network increases, which requires the definition of a clear map of where attacks may happen. ETSI standards precisely define many security aspects of this architecture, but these publications are very long and provide many details which are not of interest to software architects. We start by conducting threat analysis of some of the NFV use cases. The use cases serve as scenarios where the threats to the architecture can be enumerated. Representing threats as misuse cases that describe the modus operandi of attackers, we can find countermeasures to them in the form of security patterns, and we can build a security reference architecture (SRA). Until now, only imprecise models of NFV architectures existed; by making them more detailed and precise it is possible to handle not only security but also safety and reliability, although we do not explore those aspects. Because security is a global property that requires a holistic approach, we strongly believe that architectural models are fundamental to produce secure networks and allow us to build networks which are secure by design. The resulting SRA defines a roadmap to implement secure concrete architectures.

The effect of the virtual social network-based psycho-education on the hope of family caregivers of clients with severe mental disorders.

Psycho-education may have a positive effect on family caregivers of clients with mental disorders, and promote positive psychological states such as hope. The present study aims to investigate the effect of virtual social network-based psycho-education on the hope of family caregivers of clients with severe mental disorders. This study is a quasi-experimental research with a control and experimental groups. The participants of the study were 72 family caregivers of clients with severe mental disorders (36 in each group). Data were collected using demographic questionnaire and Adult Hope Scale before the study, immediately after the end of the training (first post-test), and 4 weeks afterwards (second post-test). The experimental group received psycho-education through Telegram App for four weeks. The results of the demographic questionnaire showed that both groups were homogeneous. The results of the Adult Hope Scale indicated that the mean score of both control and experimental groups were statistically significant and increased in the experimental group (P < 0.001). In addition, the changes of hope score in the experimental group were statistically significant in the first post-test than the pre-test, and in the second post-test than the first post-test and pre-test (P < 0.001). The findings of this study suggested that virtual social network-based psycho-education promotes the hopes of the family caregivers of clients with severe mental disorders. Due to the low cost and fast access of people to virtual networks, the content of this educational program can be widely used for family caregivers.

VNF Chain Placement for Large Scale IoT of Intelligent Transportation.

With the advent of the Internet of things (IoT), intelligent transportation has evolved over time to improve traffic safety and efficiency as well as to reduce congestion and environmental pollution. However, there are some challenging issues to be addressed so that it can be implemented to its full potential. The major challenge in intelligent transportation is that vehicles and pedestrians, as the main types of edge nodes in IoT infrastructure, are on the constant move. Hence, the topology of the large scale network is changing rapidly over time and the service chain may need reestablishment frequently. Existing Virtual Network Function (VNF) chain placement methods are mostly good at static network topology and any evolvement of the network requires global computation, which leads to the inefficiency in computing and the waste of resources. Mapping the network topology to a graph, we propose a novel VNF placement method called BVCP (Border VNF Chain Placement) to address this problem by elaborately dividing the graph into multiple subgraphs and fully exploiting border hypervisors. Experimental results show that BVCP outperforms the state-of-the-art method in VNF chain placement, which is highly efficient in large scale IoT of intelligent transportation.

Advanced Computation Capacity Modeling for Delay-Constrained Placement of IoT Services.

A vast range of sensors gather data about our environment, industries and homes. The great profit hidden in this data can only be exploited if it is integrated with relevant services for analysis and usage. A core concept of the Internet of Things targets this business opportunity through various applications. The virtualized and software-controlled 5G networks are expected to achieve the scale and dynamicity of communication networks required by Internet of Things (IoT). As the computation and communication infrastructure rapidly evolves, the corresponding substrate models of service placement algorithms lag behind, failing to appropriately describe resource abstraction and dynamic features. Our paper provides an extension to existing IoT service placement algorithms to enable them to keep up with the latest infrastructure evolution, while maintaining their existing attributes, such as end-to-end delay constraints and the cost minimization objective. We complement our recent work on 5G service placement algorithms by theoretical foundation for resource abstraction, elasticity and delay constraint. We propose efficient solutions for the problems of aggregating computation resource capacities and behavior prediction of dynamic Kubernetes infrastructure in a delay-constrained service embedding framework. Our results are supported by mathematical theorems whose proofs are presented in detail.

Survivability-Enhanced Virtual Network Embedding Strategy in Virtualized Wireless Sensor Networks.

With the widespread application of wireless sensor networks (WSNs), WSN virtualization technology has received extensive attention. A key challenge in WSN virtualization is the survivable virtual network embedding (SVNE) problem which efficiently maps a virtual network on a WSN accounting for possible substrate failures. Aiming at the lack of survivability research towards physical sensor node failure in the virtualized sensor network, the SVNE problem is mathematically modeled as a mixed integer programming problem considering resource constraints. A heuristic algorithm-node reliability-aware backup survivable embedding algorithm (NCS)-is further put forward to solve this problem. Firstly, a node reliability-aware embedding method is presented for initial embedding. The resource reliability of underlying physical sensor nodes is evaluated and the nodes with higher reliability are selected as mapping nodes. Secondly, a fault recovery mechanism based on resource reservation is proposed. The critical virtual sensor nodes are recognized and their embedded physical sensor nodes are further backed up. When the virtual sensor network (VSN) fails caused by the failure physical node, the operation of the VSN is restored by backup switching. Finally, the experimental results show that the strategy put forward in this paper can effectively guarantee the survivability of the VSN, reduce the failure penalty caused by the physical sensor nodes failure, and improve the long-term operating income of infrastructure provider.

Virtual Network Embedding for Multi-Domain Heterogeneous Converged Optical Networks: Issues and Challenges.

The emerging 5G applications and the connectivity of billions of devices have driven the investigation of multi-domain heterogeneous converged optical networks. To support emerging applications with their diverse quality of service requirements, network slicing has been proposed as a promising technology. Network virtualization is an enabler for network slicing, where the physical network can be partitioned into different configurable slices in the multi-domain heterogeneous converged optical networks. An efficient resource allocation mechanism for multiple virtual networks in network virtualization is one of the main challenges referred as virtual network embedding (VNE). This paper is a survey on the state-of-the-art works for the VNE problem towards multi-domain heterogeneous converged optical networks, providing the discussion on future research issues and challenges. In this paper, we describe VNE in multi-domain heterogeneous converged optical networks with enabling network orchestration technologies and analyze the literature about VNE algorithms with various network considerations for each network domain. The basic VNE problem with various motivations and performance metrics for general scenarios is discussed. A VNE algorithm taxonomy is presented and discussed by classifying the major VNE algorithms into three categories according to existing literature. We analyze and compare the attributes of algorithms such as node and link embedding methods, objectives, and network architecture, which can give a selection or baseline for future work of VNE. Finally, we explore some broader perspectives in future research issues and challenges on 5G scenario, field trail deployment, and machine learning-based algorithms.

Brain Storm Optimization Graph Theory (BSOGT) and Energy Resource Aware Virtual Network Mapping (ERVNM) for Medical Image System in Cloud.

With the development of Internet and the make use of Internet for medical information, the demand for huge scale and reliable managing medical information has brought out the huge scale Internet data centers. This work that has been presented here highlights the structural lay out and formulation of the medical information model. The aim of presenting this to aid medical departments as well as workers to exchange information and integrate available resources that help facilitate the analysis to be conducted on the given information. Software here comprises of medical information and offers a comprehensive service structure that benefits medical data centers. VNM or Virtual Network Mapping (VNM) essentially relates to substrate network that involves the installation and structuring of on demand virtual machines. These however are subjective to certain limitations that are applicable in relation to latency, capacity as well as bandwidth. Data centers need to dynamically handle cloud workloads effectively and efficiently. Simultaneously, since the mapping of virtual and physical networks with several providers' consumes more time along with energy. In order to resolve this issue, VNM has been mapped by making use of Graph Theory (GT) matching, a well-studied database topic. (i) Brain Storm Optimization Graph Theory (BSOGT) is introduced for modeling a virtual network request in the form of a GT with different resource constraints, and the substrate networks here is considered being a graph. For this graph the nodes and edges comprise of attributes that indicate their constraints. (ii) The algorithm that has been recently introduced executes graph decomposition into several topology patterns. Thereafter the BSOGT is executed to solve any issues that pertain to mapping. (iii) The model that has been presented here, ERVNM and the BSOGT are used with a specific mapping energy computation function.(iv) Issues pertaining to these are categorized as being those related to virtual network mapping as the ACGT and optimal solution are drawn by using effective integer linear programming. ACGT, pragmatic approach, as well as the precise and two-stage algorithms performance is evaluated by means of cloud Simulator environment. The results obtained from simulation indicate that the BSOGT algorithm attains the objectives of cloud service providers with respect to Acceptance ratio, mapping percentage, processing time as well as Convergence Time.

Virtual Network Embedding Based on Graph Entropy.

For embedding virtual networks into a large scale substrate network, a massive amount of time is needed to search the resource space even if the scale of the virtual network is small. The complexity of searching the candidate resource will be reduced if candidates in substrate network can be located in a group of particularly matched areas, in which the resource distribution and communication structure of the substrate network exhibit a maximal similarity with the objective virtual network. This work proposes to discover the optimally suitable resource in a substrate network corresponding to the objective virtual network through comparison of their graph entropies. Aiming for this, the substrate network is divided into substructures referring to the importance of nodes in it, and the entropies of these substructures are calculated. The virtual network will be embedded preferentially into the substructure with the closest entropy if the substrate resource satisfies the demand of the virtual network. The experimental results validate that the efficiency of virtual network embedding can be improved through our proposal. Simultaneously, the quality of embedding has been guaranteed without significant degradation.

Dynamic Virtual Network Reconfiguration Method for Hybrid Multiple Failures Based on Weighted Relative Entropy.

Network virtualization can offer more flexibility and better manageability for next generation Internet. With the increasing deployments of virtual networks in military and commercial networks, a major challenge is to ensure virtual network survivability against hybrid multiple failures. In this paper, we study the problem of recovering virtual networks affected by hybrid multiple failures in substrate networks and provide an integer linear programming formulation to solve it. We propose a heuristic algorithm to tackle the complexity of the integer linear programming formulation, which includes a faulty virtual network reconfiguration ranking method based on weighted relative entropy, a hybrid multiple failures ranking algorithm, and a virtual node migration method based on weighted relative entropy. In the faulty virtual network reconfiguration ranking method based on weighted relative entropy and virtual node migration method based on weighted relative entropy, multiple ranking indicators are combined in a suitable way based on weighted relative entropy. In the hybrid multiple failures ranking algorithm, the virtual node and its connective virtual links are re-embedded, firstly. Evaluation results show that our heuristic method not only has the best acceptance ratio and normal operation ratio, but also achieves the highest long-term average revenue to cost ratio compared with other virtual network reconfiguration methods.

Virtual Network Embedding Based on Topology Potential.

To improve the low acceptance ratio and revenue to cost ratio caused by the poor match between the virtual nodes and the physical nodes in the existing virtual network embedding (VNE) algorithms, we established a multi-objective optimization integer linear programming model for the VNE problem, and proposed a novel two-stage virtual network embedding algorithm based on topology potential (VNE-TP). In the node embedding stage, the field theory once used for data clustering was introduced and a node embedding function designed to find the optimal physical node. In the link embedding stage, both the available bandwidth and hops of the candidate paths were considered, and a path embedding function designed to find the optimal path. Extensive simulation results show that the proposed algorithm outperforms other existing algorithms in terms of acceptance ratio and revenue to cost ratio.

A Web-Based Peer Support Network to Help Care Partners of People With Serious Illness: Co-Design Study.

BACKGROUND: Care partners of people with serious illness experience significant challenges and unmet needs during the patient's treatment period and after their death. Learning from others with shared experiences can be valuable, but opportunities are not consistently available. OBJECTIVE: This study aims to design and prototype a regional, facilitated, and web-based peer support network to help active and bereaved care partners of persons with serious illness be better prepared to cope with the surprises that arise during serious illness and in bereavement. METHODS: An 18-member co-design team included active care partners and those in bereavement, people who had experienced serious illness, regional health care and support partners, and clinicians. It was guided by facilitators and peer network subject-matter experts. We conducted design exercises to identify the functions and specifications of a peer support network. Co-design members independently prioritized network specifications, which were incorporated into an early iteration of the web-based network. RESULTS: The team prioritized two functions: (1) connecting care partners to information and (2) facilitating emotional support. The design process generated 24 potential network specifications to support these functions. The highest priorities included providing a supportive and respectful community; connecting people to trusted resources; reducing barriers to asking for help; and providing frequently asked questions and responses. The network platform had to be simple and intuitive, provide technical support for users, protect member privacy, provide publicly available information and a private discussion forum, and be easily accessible. It was feasible to enroll members in the ConnectShareCare web-based network over a 3-month period. CONCLUSIONS: A co-design process supported the identification of critical features of a peer support network for care partners of people with serious illnesses in a rural setting, as well as initial testing and use. Further testing is underway to assess the long-term viability and impact of the network.