Joint Allocation of Computing and Connectivity Resources in Survivable Inter-Datacenter Elastic Optical Networks

Inter-datacenter elastic optical networks(EON)need to provide the service for the requests of cloud computing that require not only connectivity and computing resources but also network survivability.In this paper,to realize joint allocation of computing and connectivity resources in survivable inter-datacenter EONs,a survivable routing,modulation level,spectrum,and computing resource allocation algorithm(SRMLSCRA)algorithm and three datacenter selection strategies,i.e.Computing Resource First(CRF),Shortest Path First(SPF)and Random Destination(RD),are proposed for different scenarios.Unicast and manycast are applied to the communication of computing requests,and the routing strategies are calculated respectively.Simulation results show that SRMLCRA-CRF can serve the largest amount of protected computing tasks,and the requested calculation blocking probability is reduced by 29.2%,28.3%and 30.5%compared with SRMLSCRA-SPF,SRMLSCRA-RD and the benchmark EPS-RMSA algorithms respectively.Therefore,it is more applicable to the networks with huge calculations.Besides,SRMLSCRA-SPF consumes the least spectrum,thereby exhibiting its suitability for scenarios where the amount of calculation is small and communication resources are scarce.The results demonstrate that the proposed methods realize the joint allocation of computing and connectivity resources,and could provide efficient protection for services under single-link failure and occupy less spectrum.

Online Learning-Based Offloading Decision and Resource Allocation in Mobile Edge Computing-Enabled Satellite-Terrestrial Networks

Mobile edge computing(MEC)-enabled satellite-terrestrial networks(STNs)can provide Internet of Things(IoT)devices with global computing services.Sometimes,the network state information is uncertain or unknown.To deal with this situation,we investigate online learning-based offloading decision and resource allocation in MEC-enabled STNs in this paper.The problem of minimizing the average sum task completion delay of all IoT devices over all time periods is formulated.We decompose this optimization problem into a task offloading decision problem and a computing resource allocation problem.A joint optimization scheme of offloading decision and resource allocation is then proposed,which consists of a task offloading decision algorithm based on the devices cooperation aided upper confidence bound(UCB)algorithm and a computing resource allocation algorithm based on the Lagrange multiplier method.Simulation results validate that the proposed scheme performs better than other baseline schemes.

Research on the Balanced Development of Urban and Rural Compulsory Education Through Education Resource Allocation

With the rapid development of our country’s economy,education has gradually become the focus of social attention.The problem of unbalanced distribution of urban and rural educational resources has become increasingly prominent,urban educational resources are relatively rich,while rural educational resources are relatively scarce,and the balanced development of urban and rural compulsory education has become an urgent task.This paper mainly investigates and studies the distribution of urban and rural educational resources,discusses the unbalanced distribution of urban and rural educational resources and analyzes the reasons,and puts forward a series of corresponding solutions to promote the balanced development of urban and rural compulsory education.

Resource allocation based on fairness and QoS provisioning for OFDMA-WLAN system

To satisfy different service requirements of multiple users in the orthogo nal frequency division multiple access wireless local area network OFDMA-WLAN system downlink transmission a resource allocation algorithm based on fairness and quality of service QoS provisioning is proposed. Different QoS requirements are converted into different rate requirements to calculate the QoSs atisfaction level.The optimization object is revised as a fairness-driven resource optimization function to provide fairness. The complex resource allocation problem is divided into channel allocation and power assignment sub-problems. The sub-problems are solved by the bipartite graph matching and water-filling based method.Compared with other algorithms the proposed algorithm sacrifices less data rate for higher fairnes and QoS satisfaction.The sim ulation results show that the proposed algorithm is capableo fp rovi ding QoS and fairness and performs better in a tradeoff among QoS fairness and data rate.

Optimization of resource allocation in FDD massive MIMO systems

The performance of massive MIMO systems relies heavily on the availability of Channel State Information at the Transmitter(CSIT).A large amount of work has been devoted to reducing the CSIT acquisition overhead at the pilot training and/or CsI feedback stage.In fact,the downlink communication generally includes three stages,i.e.,pilot training,CsI feedback,and data transmission.These three stages are mutually related and jointly determine the overall system performance.Unfortunately,there exist few studies on the reduction of csIT acquisition overhead from the global point of view.In this paper,we integrate the Minimum Mean Square Error(MMSE)channel estimation,Random Vector Quantization(RVQ)based limited feedback and Maximal Ratio Combining(MRC)precoding into a unified framework for investigating the resource allocation problem.In particular,we first approximate the covariance matrix of the quantization error with a simple expression and derive an analytical expression of the received Signal-to-Noise Ratio(SNR)based on the deterministic equivalence theory.Then the three performance metrics(the spectral efficiency,energy efficiency,and total energy consumption)oriented problems are formulated analytically.With practical system requirements,these three metrics can be collaboratively optimized.Finally,we propose an optimization solver to derive the optimal partition of channel coherence time.Experiment results verify the benefits of the proposed resource allocation schemes under three different scenarios and illustrate the tradeoff of resource allocation between three stages.

Starlet:Network defense resource allocation with multi-armed bandits for cloud-edge crowd sensing in IoT

The cloud platform has limited defense resources to fully protect the edge servers used to process crowd sensing data in Internet of Things.To guarantee the network's overall security,we present a network defense resource allocation with multi-armed bandits to maximize the network's overall benefit.Firstly,we propose the method for dynamic setting of node defense resource thresholds to obtain the defender(attacker)benefit function of edge servers(nodes)and distribution.Secondly,we design a defense resource sharing mechanism for neighboring nodes to obtain the defense capability of nodes.Subsequently,we use the decomposability and Lipschitz conti-nuity of the defender's total expected utility to reduce the difference between the utility's discrete and continuous arms and analyze the difference theoretically.Finally,experimental results show that the method maximizes the defender's total expected utility and reduces the difference between the discrete and continuous arms of the utility.

Joint Task Allocation and Resource Optimization for Blockchain Enabled Collaborative Edge Computing

Collaborative edge computing is a promising direction to handle the computation intensive tasks in B5G wireless networks.However,edge computing servers(ECSs)from different operators may not trust each other,and thus the incentives for collaboration cannot be guaranteed.In this paper,we propose a consortium blockchain enabled collaborative edge computing framework,where users can offload computing tasks to ECSs from different operators.To minimize the total delay of users,we formulate a joint task offloading and resource optimization problem,under the constraint of the computing capability of each ECS.We apply the Tammer decomposition method and heuristic optimization algorithms to obtain the optimal solution.Finally,we propose a reputation based node selection approach to facilitate the consensus process,and also consider a completion time based primary node selection to avoid monopolization of certain edge node and enhance the security of the blockchain.Simulation results validate the effectiveness of the proposed algorithm,and the total delay can be reduced by up to 40%compared with the non-cooperative case.

Learning-based user association and dynamic resource allocation in multi-connectivity enabled unmanned aerial vehicle networks

Unmanned Aerial Vehicles(UAvs)as aerial base stations to provide communication services for ground users is a flexible and cost-effective paradigm in B5G.Besides,dynamic resource allocation and multi-connectivity can be adopted to further harness the potentials of UAVs in improving communication capacity,in such situations such that the interference among users becomes a pivotal disincentive requiring effective solutions.To this end,we investigate the Joint UAV-User Association,Channel Allocation,and transmission Power Control(J-UACAPC)problem in a multi-connectivity-enabled UAV network with constrained backhaul links,where each UAV can determine the reusable channels and transmission power to serve the selected ground users.The goal was to mitigate co-channel interference while maximizing long-term system utility.The problem was modeled as a cooperative stochastic game with hybrid discrete-continuous action space.A Multi-Agent Hybrid Deep Reinforcement Learning(MAHDRL)algorithm was proposed to address this problem.Extensive simulation results demonstrated the effectiveness of the proposed algorithm and showed that it has a higher system utility than the baseline methods.

A new quantum key distribution resource allocation and routing optimization scheme

Quantum key distribution(QKD)is a technology that can resist the threat of quantum computers to existing conventional cryptographic protocols.However,due to the stringent requirements of the quantum key generation environment,the generated quantum keys are considered valuable,and the slow key generation rate conflicts with the high-speed data transmission in traditional optical networks.In this paper,for the QKD network with a trusted relay,which is mainly based on point-to-point quantum keys and has complex changes in network resources,we aim to allocate resources reasonably for data packet distribution.Firstly,we formulate a linear programming constraint model for the key resource allocation(KRA)problem based on the time-slot scheduling.Secondly,we propose a new scheduling scheme based on the graded key security requirements(GKSR)and a new micro-log key storage algorithm for effective storage and management of key resources.Finally,we propose a key resource consumption(KRC)routing optimization algorithm to properly allocate time slots,routes,and key resources.Simulation results show that the proposed scheme significantly improves the key distribution success rate and key resource utilization rate,among others.

Multi-Agent Deep Deterministic Policy Gradien-Based Task Offloading Resource Allocation Joint Offloading

With the advancement of technology and the continuous innovation of applications, low-latency applications such as drones, online games and virtual reality are gradually becoming popular demands in modern society. However, these applications pose a great challenge to the traditional centralized mobile cloud computing paradigm, and it is obvious that the traditional cloud computing model is already struggling to meet such demands. To address the shortcomings of cloud computing, mobile edge computing has emerged. Mobile edge computing provides users with computing and storage resources by offloading computing tasks to servers at the edge of the network. However, most existing work only considers single-objective performance optimization in terms of latency or energy consumption, but not balanced optimization in terms of latency and energy consumption. To reduce task latency and device energy consumption, the problem of joint optimization of computation offloading and resource allocation in multi-cell, multi-user, multi-server MEC environments is investigated. In this paper, a dynamic computation offloading algorithm based on Multi-Agent Deep Deterministic Policy Gradient (MADDPG) is proposed to obtain the optimal policy. The experimental results show that the algorithm proposed in this paper reduces the delay by 5 ms compared to PPO, 1.5 ms compared to DDPG and 10.7 ms compared to DQN, and reduces the energy consumption by 300 compared to PPO, 760 compared to DDPG and 380 compared to DQN. This fully proves that the algorithm proposed in this paper has excellent performance.

Energy-Efficient Computation Offloading and Resource Allocation in Fog Computing for Internet of Everything

With the dawning of the Internet of Everything(IoE) era, more and more novel applications are being deployed. However, resource constrained devices cannot fulfill the resource-requirements of these applications. This paper investigates the computation offloading problem of the coexistence and synergy between fog computing and cloud computing in IoE by jointly optimizing the offloading decisions, the allocation of computation resource and transmit power. Specifically, we propose an energy-efficient computation offloading and resource allocation(ECORA) scheme to minimize the system cost. The simulation results verify the proposed scheme can effectively decrease the system cost by up to 50% compared with the existing schemes, especially for the scenario that the computation resource of fog computing is relatively small or the number of devices increases.

A Bandwidth-Link Resources Cooperative Allocation Strategy of Data Communication in Intelligent Transportation Systems

The bandwidth resources allocation strategies of the existing Internet of Vehicles(IoV) are mainly base on the communication architecture of the traditional 802.11 x in the wireless local area network(WLAN). The traditional communication architecture of IoV will easily cause significant delay and low Packet Delivery Ratio(PDR) for disseminating critical security beacons under the condition of high-speed movement, distance-varying communication, and mixed traffic. This paper proposes a novel bandwidth-link resources cooperative allocation strategy to achieve better communication performance under the road conditions of intelligent transportation systems(ITS). Firstly, in traffic scenarios, based on the characteristic to predict the relative position of the mobile transceivers, a strategy is developed to cooperate on the mobile cellular network and the Dedicated Short-Range Communications(DSRC). Secondly, by adopting the general network simulator NS3, the dedicated mobile channel models that are suitable for the data interaction of ITS, is applied to confirm the feasibility and reliability of the strategy. Finally, by the simulation, comparison, and analysis of some critical performance parame-ters, we conclude that the novel strategy does not only reduce the system delay but also improve the other communication performance indicators, such as the PDR and communication capacity.

Joint Allocation of Wireless Resource and Computing Capability in MEC-Enabled Vehicular Network

In MEC-enabled vehicular network with limited wireless resource and computation resource,stringent delay and high reliability requirements are challenging issues.In order to reduce the total delay in the network as well as ensure the reliability of Vehicular UE(VUE),a Joint Allocation of Wireless resource and MEC Computing resource(JAWC)algorithm is proposed.The JAWC algorithm includes two steps:V2X links clustering and MEC computation resource scheduling.In the V2X links clustering,a Spectral Radius based Interference Cancellation scheme(SR-IC)is proposed to obtain the optimal resource allocation matrix.By converting the calculation of SINR into the calculation of matrix maximum row sum,the accumulated interference of VUE can be constrained and the the SINR calculation complexity can be effectively reduced.In the MEC computation resource scheduling,by transforming the original optimization problem into a convex problem,the optimal task offloading proportion of VUE and MEC computation resource allocation can be obtained.The simulation further demonstrates that the JAWC algorithm can significantly reduce the total delay as well as ensure the communication reliability of VUE in the MEC-enabled vehicular network.

Joint Optimization of Satisfaction Index and Spectrum Efficiency with Cache Restricted for Resource Allocation in Multi-Beam Satellite Systems

Dynamic resource allocation(DRA) is a key technology to improve system performances in GEO multi-beam satellite systems. And, since the cache resource on the satellite is very valuable and limited, DRA problem under restricted cache resources is also an important issue to be studied. This paper mainly investigates the DRA problem of carrier resources under certain cache constraints. What's more, with the aim to satisfy all users' traffic demands as more as possible, and to maximize the utilization of the bandwidth, we formulate a multi-objective optimization problem(MOP) where the satisfaction index and the spectrum efficiency are jointly optimized. A modified strategy SA-NSGAII which combines simulated annealing(SA) and non-dominated sorted genetic algorithm-II(NSGAII) is proposed to approximate the Pareto solution to this MOP problem. Simulation results show the effectiveness of the proposed algorithm in terms of satisfaction index, spectrum efficiency, occupied cache, and etc.

V2X Offloading and Resource Allocation in SDN-Assisted MEC-Based Vehicular Networks

As an important application scenario of 5G, the vehicular network has a huge amount of computing data, which brings challenges to the scarce network resources. Mobile edge computing(MEC) sinks cloud services to the edge of network, which reduces the delay jitter caused by remote cloud computing. Software-defined networking(SDN) is an emerging network paradigm with the features of logic centralized control and programmability. In this paper, we construct an SDN-assisted MEC network architecture for the vehicular network. By introducing SDN controller, the efficiency and flexibility of vehicular network are improved, and the network state can be perceived from the global perspective. To further reduce the system overhead, the problem of vehicle to everything(V2X) offloading and resource allocation is proposed, where the optimal offloading decision, transmission power control, subchannels assignment, and computing resource allocation scheme are given. The optimization problem is transformed into three stages because of the heterogeneity of the offloaded tasks and the NP-hard property of the problem. Firstly, the analytic hierarchy process is used to select initial offloading node, then stateless Q-learning is adopted to allocate transmission power, subchannels and computing resources. In addition, the offloading decision is modeled as a potential game, and the Nash equilibrium is proved by the potential function construction. Finally, the numerical results show that the proposed mechanism can effectively reduce the system overhead and achieve better results compared with others’ algorithms.

Joint Resource Allocation and Coordinated Computation Offloading for Fog Radio Access Networks

The cloud radio access network(C-RAN) and the fog computing have been recently proposed to tackle the dramatically increasing traffic demands and to provide better quality of service(QoS) to user equipment(UE).Considering the better computation capability of the cloud RAN(10 times larger than that of the fog RAN) and the lower transmission delay of the fog computing,we propose a joint resource allocation and coordinated computation offloading algorithm for the fog RAN(F-RAN),which takes the advantage of C-RAN and fog computing.Specifically,the F-RAN splits a computation task into the fog computing part and the cloud computing part.Based on the constraints of maximum transmission delay tolerance,fronthaul and backhaul capacity limits,we minimize the energy cost and obtain optimal computational resource allocation for multiple UE,transmission power allocation of each UE and the event splitting factor.Numerical results have been proposed with the comparison of existing methods.

Random Access and Resource Allocation for the Coexistence of NOMA-Based and OMA-Based M2M Communications

In the future fifth generation(5G) systems,non-orthogonal multiple access(NOMA) is a promising technology that can greatly enhance the network capacity compared to orthogonal multiple access(OMA) .In this paper,we propose a novel random access(RA) and resource allocation scheme for the coexistence of NOMA-based and OMAbased machine-to-machine(M2M) communications,which aims at improving the number of successful data packet transmissions and guaranteeing the quality of service(Qo S) (e.g.,the minimum data rate requirement) for M2 M communications.The algorithm of joint user equipment(UE) paring and power allocation is proposed for the coexisting RA(i.e.,the coexistence of NOMA-based RA and OMA-based RA) .The resource allocation for the coexisting RA is investigated,thus improving the number of successful data packet transmissions by more efficiently using the radio resources.Simulation results demonstrate that the proposed RA and resource allocation scheme outperforms the conventional RA in terms of the number of successful data packet transmissions,thus is a promising technology in future M2 M communications.

Simultaneously Designing and Targeting for Networks with Multiple Resources of Different Qualities

This paper presents a new design procedure for the networks with multiple resources, such as hydrogen and water, of different qualities. The minimum consumption targets of the resources and pinch-causing sources can be identified as well during design. The objective of this work is to reduce the consumption of the resources with higher quality due to their higher cost. A few examples are investigated to show the proposed method. For a net-work of single resource with single contaminant, there is often only one pinch point for the resource. On the other hand, for a network of multiple resources with single contaminant, there might be a few different pinch points. Each resource might have its own pinch point, if its amount is sufficient. The contaminant concentration of the pinch-causing source for a resource with lower concentration will be below that of the higher-concentration resource(s).

Deep Reinforcement Learning Based Joint Partial Computation Offloading and Resource Allocation in Mobility-Aware MEC System

Mobile edge computing(MEC)emerges as a paradigm to free mobile devices(MDs)from increasingly dense computing workloads in 6G networks.The quality of computing experience can be greatly improved by offloading computing tasks from MDs to MEC servers.Renewable energy harvested by energy harvesting equipments(EHQs)is considered as a promising power supply for users to process and offload tasks.In this paper,we apply the uniform mobility model of MDs to derive a more realistic wireless channel model in a multi-user MEC system with batteries as EHQs to harvest and storage energy.We investigate an optimization problem of the weighted sum of delay cost and energy cost of MDs in the MEC system.We propose an effective joint partial computation offloading and resource allocation(CORA)algorithm which is based on deep reinforcement learning(DRL)to obtain the optimal scheduling without prior knowledge of task arrival,renewable energy arrival as well as channel condition.The simulation results verify the efficiency of the proposed algorithm,which undoubtedly minimizes the cost of MDs compared with other benchmarks.

Allocation and Scheduling of Network Resource for Multiple Control Applications in SDN

The network resource allocation in SDN for control applications is becoming a key problem in the near future because of the conflict between the need of the flow-level flexibility control and the limited capacity of flow table.Based on the analysis of the difference of the definition of network resource between SDN and traditional IP network,the idea of the integrated allocation of link bandwidth and flow table for multiple control applications in SDN is proposed in this paper.Furthermore,a price-based joint allocation model of network resource in SDN is built by introducing the price for each of the resources,which can get the proportional fair allocation of link bandwidth and the minimum global delay at the same time.We have also designed a popular flow scheduling policy based on the proportional fair allocation of link bandwidth in order to achieve the minimum global delay.A flow scheduling module has been implemented and evaluated in Floodlight,named virtual forwarding space(VFS).VFS can not only implement the fair allocation of link bandwidth and minimum delay flow scheduling in data plane but also accelerate packet forwarding by looking up control rules in control plane.