Node Resource Allocation Research Articles

Collaborative Coded Distributed Computing Scheme: A Two-Phase Cooperative Game Approach

As a modern communication paradigm, Artificial intelligence based Internet of Things (AIoT) can provide an interactive platform across the globe to enrich the quality of networking services. With the AIoT paradigm, coded distributed computing (CDC) has recently emerged to be a promising solution to address the straggling effects in conventional distributed computing systems. In this article, we propose a novel CDC control scheme in the AIoT platform. Based on the cooperative game theory, the main challenges of our scheme are i) the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</i> value decision for the CDC process, and ii) edge node resource allocation for offloading tasks. Using the ideas of coalition game and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">weighted Nash social welfare solution (WNSWS)</i> , our proposed scheme is developed as a two-phase game model to achieve a mutually desirable solution. At the first phase, a dynamic coalition formation is proceeded to select the most adaptable edge nodes for the offloading subtasks. At the second phase, the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">WNSWS</i> is adopted to effectively share each edge node’s computing resource. Based on the jointly design of these two cooperative games, we explore the synergy effect to optimize the CDC process. In the edge assisted distributed computing infrastructure, our reciprocal combinative approach can provide a fair-efficient solution through the sequential interactions of edge nodes and AIoT devices. In the performance evaluation, we provide extensive simulation analyses to show our scheme’s superiority by comparing with the existing baseline protocols.

Protein complexes detection based on node local properties and gene expression in PPI weighted networks

BackgroundIdentifying protein complexes from protein–protein interaction (PPI) networks is a crucial task, and many related algorithms have been developed. Most algorithms usually employ direct neighbors of nodes and ignore resource allocation and second-order neighbors. The effective use of such information is crucial to protein complex detection.ResultBased on this observation, we propose a new way by combining node resource allocation and gene expression information to weight protein network (NRAGE-WPN), in which protein complexes are detected based on core-attachment and second-order neighbors.ConclusionsThrough comparison with eleven methods in Yeast and Human PPI network, the experimental results demonstrate that this algorithm not only performs better than other methods on 75% in terms of f-measure+, but also can achieve an ideal overall performance in terms of a composite score consisting of five performance measures. This identification method is simple and can accurately identify more complexes.

Embedding Security Awareness for Virtual Resource Allocation in 5G Hetnets Using Reinforcement Learning

In the 5G era, heterogeneous networks (Het-Nets) are designed for achieving data rates and customized service demands. To realize this, virtualization technologies are widely accepted as enablers for implementing 5G HetNets, aimed at managing and scheduling virtualized physical resources in a flexible manner. However, the major focus of the existing research lies in the effective allocation of virtual resources and maximizing the number of implemented network services, ignoring the virtual resource security issues. However, the security threats and vulnerabilities due to the complexity of virtualization can lead to major performance outbreaks and information leakage. Therefore, this article attempts to tackle the security issues in 5G HetNets virtual resource allocation. The article starts from modeling the major security attacks for virtual resource allocation through comprehensive discussion on the typical types of security attacks. Following the attack model, a novel secure framework (VRA-RL-SecAwa) based on the emerging reinforcement learning approach, is presented. The proposed VRA-RL-SecAwa framework works in different phases, 1. Reinforcement-learning-based preliminary security preparation 2. Greedy-approach-based secure virtual node resource allocation embedding 3. Secure and shortest path virtual link resource allocation scheme 4. Network reconfiguration and update The proposed VRA-RL-SecAwa framework is evaluated through extensive simulations in order to demonstrate its efficiency and effectiveness. The results obtained validate the superiority of the proposed framework in contrast to existing variants of its category.

Profit-Maximized Collaborative Computation Offloading and Resource Allocation in Distributed Cloud and Edge Computing Systems

Edge computing is a new architecture to provide computing, storage, and networking resources for achieving the Internet of Things. It brings computation to the network edge in close proximity to users. However, nodes in the edge have limited energy and resources. Completely running tasks in the edge may cause poor performance. Cloud data centers (CDCs) have rich resources for executing tasks, but they are located in places far away from users. CDCs lead to long transmission delays and large financial costs for utilizing resources. Therefore, it is essential to smartly offload users’ tasks between a CDC layer and an edge computing layer. This work proposes a cloud and edge computing system, which has a terminal layer, edge computing layer, and CDC layer. Based on it, this work designs a profit-maximized collaborative computation offloading and resource allocation algorithm to maximize the profit of systems and guarantee that response time limits of tasks are strictly met. In each time slot, this work jointly considers CPU, memory, and bandwidth resources, load balance of all heterogeneous nodes in the edge layer, maximum amount of energy, maximum number of servers, and task queue stability in the CDC layer. Considering the abovementioned factors, a single-objective constrained optimization problem is formulated and solved by a proposed simulated-annealing-based migrating birds optimization procedure to obtain a close-to-optimal solution. The proposed method achieves joint optimization of computation offloading between CDC and edge, and resource allocation in CDC. Realistic data-based simulation results demonstrate that it realizes higher profit than its peers. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Note to Practitioners</i> —This work considers the joint optimization of computation offloading between Cloud data center (CDC) and edge computing layers, and resource allocation in CDC. It is important to maximize the profit of distributed cloud and edge computing systems by optimally scheduling all tasks between them given user-specific response time limits of tasks. It is challenging to execute them in nodes in the edge computing layer because their computation resources and battery capacities are often constrained and heterogeneous. Current offloading methods fail to jointly optimize computation offloading and resource allocation for nodes in the edge and servers in CDC. They are insufficient and coarse-grained to schedule arriving tasks. In this work, a novel algorithm is proposed to maximize the profit of distributed cloud and edge computing systems while meeting response time limits of tasks. It explicitly specifies the task service rate and the selected node for each task in each time slot by considering resource limits, load balance requirement, and processing capacities of nodes in the edge, and server and energy constraints in CDC. Real-life data-driven simulations show that the proposed method realizes a larger profit than several typical offloading strategies. It can be readily implemented and incorporated into large-scale industrial computing systems.

Neighborhood search-based job scheduling for IoT big data real-time processing in distributed edge-cloud computing environment

Cloud-edge collaboration architecture, which combines edge processing and centralized cloud processing, is suitable for placement and caching of streaming media. A cache-aware scheduling model based on neighborhood search is proposed. The model is divided into four sub-problems: job classification, node resource allocation, node clustering, and cache-aware job scheduling. Firstly, jobs are categorized into three categories, and then different resources are allocated to nodes according to different job execution conditions. Secondly, the nodes with similar capabilities are clustered, and the jobs are cached by delay-waiting. For jobs that do not satisfy the data locality, the jobs are scheduled to the nodes with similar capabilities according to the neighborhood search results. Meanwhile, a cache-aware scheduling algorithm based on neighborhood search is proposed. Experiments show that the proposed algorithm can effectively minimize the delay of content transmission and the cost of content placement, the job execution time is shortened and the processing capacity of the cloud data center is improved.

Adaptive Resource Allocation Method Based on Deep Q Network for Industrial Internet of Things

The transformation and upgrading of the industrial manufacturing field brings important development opportunities for the promotion and deployment of the Industrial Internet of Things (IIoT). How to connect huge number of IIoT nodes to the current IP-based Internet for promoting the integration of industrialization and informationization is a key issue towards IIoT. Targeting at the insufficiency that existing algorithms only support a single channel and utilize limited number of time slots, which results in the deteriorated performance for solving the problem of resource allocation for nodes with different priorities. In this paper the self-similarity of the observation data of the IIoT nodes is evaluated to dynamically prioritize the nodes, and then Deep Q Network (DQN) algorithm is adopted to design an adaptive resource allocation method that takes into account the characteristics of diverse node priorities. Simulation results demonstrate that the proposed method can effectively improve network throughput and reduce data transmission delay in comparison with existing methods.

End user–oriented node resource allocation: An application‐based method

AbstractFor a network, how to allocate limited resources to achieve high network reliability has been concerned by engineers. From the perspective of the users, the quality of applications is the most intuitive perception of network reliability. Previous allocation methods focus little on applications, which makes it difficult to optimize resource with given application requirements. This paper proposes an application‐based resource allocation method during network design. Under given application scenario and resource constraints, the allocation model is constructed to maximize application reliability, which is presented as a novel user‐oriented metric to assess the quality of applications. Furthermore, improved genetic algorithm (GA) is adopted to obtain optimal allocation strategy. To improve the efficiency of the algorithm, application‐affected node importance is evaluated to generate initial population. Simulation results demonstrate that the proposed method can achieve higher application reliability than the other three allocation methods when applied to an Avionics Full Duplex Switched Ethernet (AFDX) case. This makes it possible to optimize resource allocation in the light of different application demands in network design.

How network monitoring and reinforcement learning can improve tcp fairness in wireless multi-hop networks

Wireless mesh network (WMN) is an emerging technology for the last-mile Internet access. Despite extensive research and the commercial implementations of WMNs, there are still serious fairness issues in the transport layer, where the transmission control protocol (TCP) favors flows with a smaller number of hops to flows with a larger number of hops. TCP unfair behavior is a known anomaly over WMN that attracts much attention in recent years and is the focus of this paper. In this article, we propose a distributed network monitoring mechanism using a cross-layer approach that deploys reinforcement learning techniques (RL) to achieve fair resource allocation for nodes within the wireless mesh setting. In our approach, we deploy Q-learning, a reinforcement learning mechanism, to monitor the dynamics of the network. The Q-learning agent creates a state map of the network based on the medium access control (MAC) parameters and takes actions to enhance TCP fairness and throughput of the starved flows in the network. The proposal creates a distributed cooperative mechanism where each node hosting a TCP source monitors the network and adjusts its TCP parameters based on the network dynamics. Extensive simulation results and testbed analysis demonstrate that the proposed method significantly improves the TCP fairness in a multi-hop wireless environment.

Characterization of Bandwidth-Aware Meta-Schedulers for Co-Allocating Jobs Across Multiple Clusters

In this paper, we present a bandwidth-centric job communication model that captures the interaction and impact of simultaneously co-allocating jobs across multiple clusters. We compare our dynamic model with previous research that utilizes a fixed execution time penalty for co-allocated jobs. We explore the interaction of simultaneously co-allocated jobs and the contention they often create in the network infrastructure of a dedicated computational multi-cluster. We also present several bandwidth-aware co-allocating meta-schedulers. These schedulers take inter-cluster network utilization into account as a means by which to mitigate degraded job run-time performance. We make use of a bandwidth-centric parallel job communication model that captures the time-varying utilization of shared inter-cluster network resources. By doing so, we are able to evaluate the performance of multi-cluster scheduling algorithms that focus not only on node resource allocation, but also on shared inter-cluster network bandwidth.