A Machine-Learning Based Time Constrained Resource Allocation Scheme for Vehicular Fog Computing

Through integrating advanced communication and data processing technologies into smart vehicles and roadside infrastructures,the Intelligent Transportation System(ITS)has evolved as a promising paradigm for improving safety,efficiency of the transportation system.However,the strict delay requirement of the safety-related applications is still a great challenge for the ITS,especially in dense traffic environment.In this paper,we introduce the metric called Perception-Reaction Time(PRT),which reflects the time consumption of safety-related applications and is closely related to road efficiency and security.With the integration of the incorporating information-centric networking technology and the fog virtualization approach,we propose a novel fog resource scheduling mechanism to minimize the PRT.Furthermore,we adopt a deep reinforcement learning approach to design an on-line optimal resource allocation scheme.Numerical results demonstrate that our proposed schemes is able to reduce about 70%of the RPT compared with the traditional approach.

HAS Dynamic Buffer-Driven Resource Management to Enhance QoE in Mobile Network

Hypertext transfer protocol(HTTP) adaptive streaming(HAS) plays a key role in mobile video transmission. Considering the multi-segment and multi-rate features of HAS, this paper proposes a buffer-driven resource management(BDRM) method to enhance HAS quality of experience(QoE) in mobile network. Different from the traditional methods only focusing on base station side without considering the buffer, the proposed method takes both station and client sides into account and end user's buffer plays as the drive of whole schedule process. The proposed HAS QoE influencing factors are composed of initial delay, rebuffering and quality level. The BDRM method decomposes the HAS QoE maximization problem into client and base station sides separately to solve it in multicell and multi-user video playing scene in mobile network. In client side, the decision is made based on buffer probe and rate request algorithm by each user separately. It guarantees the less rebuffering events and decides which HAS segment rate to fetch. While, in the base station side, the schedule of wireless resource is made to maximize the quality level of all access clients and decides the final rate pulled from HAS server. The drive of buffer and twice rate request schemes make BDRMtake full advantage of HAS's multi-segment and multi-rate features. As to the simulation results, compared with proportional fair(PF), Max C/I and traditional HAS schedule(THS) methods, the proposed BDRM method decreases rebuffering percent to 1.96% from 11.1% with PF and from 7.01% with THS and increases the mean MOS of all users to 3.94 from 3.42 with PF method and from 2.15 with Max C/I method. It also guarantees a high fairness with 0.98 from the view of objective and subjective assessment metrics.

Parametric Transformation of Timed Weighted Marked Graphs:Applications in Optimal Resource Allocation

Timed weighted marked graphs are a subclass of timed Petri nets that have wide applications in the control and performance analysis of flexible manufacturing systems.Due to the existence of multiplicities(i.e.,weights)on edges,the performance analysis and resource optimization of such graphs represent a challenging problem.In this paper,we develop an approach to transform a timed weighted marked graph whose initial marking is not given,into an equivalent parametric timed marked graph where the edges have unitary weights.In order to explore an optimal resource allocation policy for a system,an analytical method is developed for the resource optimization of timed weighted marked graphs by studying an equivalent net.Finally,we apply the proposed method to a flexible manufacturing system and compare the results with a previous heuristic approach.Simulation analysis shows that the developed approach is superior to the heuristic approach.

Values of the Times of Marx's Theory of Science and Technology Progress and Utilization of Natural Resources

Marx's theory of scientific and technological progress and utilization of natural resources is an indispensable and important part of Marx's economic theory.To realize the harmonious unification of man and nature,man must correctly understand the effect of scientific and technological progress on the use of natural resources,fundamentally solve the problem that scientific and technological progress cannot replace the position of natural resources in economic development,and objectively evaluate the relationship between human power and the power of nature.Grasping and comprehending the scientific connotation of Marx's theory of scientific and technological progress and utilization of natural resources has a very important theoretical value and practical significance for saving and effectively using natural resources and building an environment-friendly society.

Contract theory based incentive mechanism design for buffer resource in wireless caching networks

Evidences indicate that,due to the limited caching capacity or inaccurate estimation on users’preferences,the requested files may not be fully cached in the network edge.The transmissions of the un-cached files will also lead to duplicated transmissions on backhaul channels.Buffer-aided relay has been proposed to improve the transmission performance of the un-cached files.Because of the limited buffer capacity and the information asymmetric environment,how to allocate the limited buffer capacity and how to incentivize users in participating buffer-aided relay have become critical issues.In this work,an incentive scheme based on the contract theory is proposed.Specifically,the backlog violation probability,i.e.,the buffer overflow probability,is provided based on the martingale theory.Next,based on the backlog violation probability,the utility functions of the relay node and users are constructed.With the purpose to maximize the utility of the relay node,the optimal contract problem is formulated.Then,the feasibility of the contract is also demonstrated,and the optimal solution can be obtained by the interior point method.Finally,numerical results are presented to demonstrate effectiveness of the proposed contract theory scheme.

An Efficient Federated Learning Framework Deployed in Resource-Constrained IoV:User Selection and Learning Time Optimization Schemes

In this article,an efficient federated learning(FL)Framework in the Internet of Vehicles(IoV)is studied.In the considered model,vehicle users implement an FL algorithm by training their local FL models and sending their models to a base station(BS)that generates a global FL model through the model aggregation.Since each user owns data samples with diverse sizes and different quality,it is necessary for the BS to select the proper participating users to acquire a better global model.Meanwhile,considering the high computational overhead of existing selection methods based on the gradient,the lightweight user selection scheme based on the loss decay is proposed.Due to the limited wireless bandwidth,the BS needs to select an suitable subset of users to implement the FL algorithm.Moreover,the vehicle users’computing resource that can be used for FL training is usually limited in the IoV when other multiple tasks are required to be executed.The local model training and model parameter transmission of FL will have significant effects on the latency of FL.To address this issue,the joint communication and computing optimization problem is formulated whose objective is to minimize the FL delay in the resource-constrained system.To solve the complex nonconvex problem,an algorithm based on the concave-convex procedure(CCCP)is proposed,which can achieve superior performance in the small-scale and delay-insensitive FL system.Due to the fact that the convergence rate of CCCP method is too slow in a large-scale FL system,this method is not suitable for delay-sensitive applications.To solve this issue,a block coordinate descent algorithm based on the one-step projected gradient method is proposed to decrease the complexity of the solution at the cost of light performance degrading.Simulations are conducted and numerical results show the good performance of the proposed methods.

Adaptive Time Slot Resource Allocation in SWIPT IoT Networks

The rapid advancement of Internet of Things(IoT)technology has brought convenience to people’s lives;however further development of IoT faces serious challenges,such as limited energy and shortage of network spectrum resources.To address the above challenges,this study proposes a simultaneous wireless information and power transfer IoT adaptive time slot resource allocation(SIATS)algorithm.First,an adaptive time slot consisting of periods for sensing,information transmission,and energy harvesting is designed to ensure that the minimum energy harvesting requirement ismet while the maximumuplink and downlink throughputs are obtained.Second,the optimal transmit power and channel assignment of the system are obtained using the Lagrangian dual and gradient descent methods,and the optimal time slot assignment is determined for each IoT device such that the sum of the throughput of all devices is maximized.Simulation results show that the SIATS algorithm performs satisfactorily and provides an increase in the throughput by up to 14.4%compared with that of the fixed time slot allocation(FTS)algorithm.In the case of a large noise variance,the SIATS algorithm has good noise immunity,and the total throughput of the IoT devices obtained using the SIATS algorithm can be improved by up to 34.7%compared with that obtained using the FTS algorithm.

Multi-Mode Resource Constrained Project Scheduling Models for Progress and Equal Time Interval Payments

This study utilizes a time-precedence network technique to construct two models of multi-mode resource constrained project scheduling problem with discounted cash flows （MRCPSPDCF）, individually including the progress payment （PP） and the payment at an equal time interval （ETI）. The objective of each model is to maximize the net present value （NPV） for all cash flows in the project, subject to the related operational constraints. The models are characterized as NP-hard. A heuristic algorithm, coupled with two upper bound solutions, is proposed to efficiently solve the models and evaluate the heuristic algorithm performance which was not performed in past studies. The results show that the performance of proposed models and heuristic algorithm is good.

Forest resources variation along with the main rivers in typical forest re-gion of Changbai Mountain

The restoration of the riparian vegetation disturbed by human activities is one of the hotspots of watershed ecology. Through interpreting the images of Remote Sensing in 1985 and 1999, the basic information of forest resources of Lushuihe Forest Bureau, which is a typical forest area of Changbai Mountain, was obtained with support of GIS. By dividing Land covers of Lushuihe area into 10 types (water body, residential land, stump land, farming land, wetland, mature conifer forest, midlife conifer forest, mature broadleaf forest, midlife broadleaf forest, and man-made young forest) and dividing the riparian zone into four buffers (in turn, 1000, 2000, 3000, 4000 m away from the river), the changes of riparian forest resources during 1985-1999 were analyzed. The results showed that the deforestation intension has obviously decreased and the whole environment has been evidently improved, but the riparian ecosystem was still flimsy. In buffer 1, 2, 3, the area of midlife conifer forest increased largely, but the areas of other types of land covers all decreased. Midlife conifer forest had a comparatively good status in the three buffers. In buffer 4, midlife conifer forest, mature conifer forest, and mature broadleaf forest formed a forest-age rank that is helpful to stabilize the forest ecosystem and exert its functions. Area percentage of wetland decreased in buffer 1, buffer 2, and buffer 3, even in buffer 4 in which forest ecosystem rehabilitated comparatively well, so protecting and rehabilitating wetland is a very difficult task.

Dynamic Resource Allocation in TDD-Based Heterogeneous Cloud Radio Access Networks

To fulfill the explosive growth of network capacity, fifth generation(5G) standard has captured the attention and imagination of researchers and engineers around the world. In particular, heterogeneous cloud radio access network(H-CRAN), as a promising network paradigm in 5G system, is a hot research topic in recent years. However, the densely deployment of RRHs in H-CRAN leads to downlink/uplink traffic asymmetry and severe inter-cell interference which could seriously impair the network throughput and resource utilization. To simultaneously solve these two problems, we proposed a dynamic resource allocation(DRA) scheme for H-CRAN in TDD mode. Firstly, we design a clustering algorithm to group the RRHs into different sets. Secondly, we adopt coordinated multipoint technology to eliminate the interference in each set. Finally, we formulate the joint frame structure, power and subcarrier selection problem as a mixed strategy noncooperative game. The simulation results are presented to validate the effectiveness of our proposed algorithm by compared with the existing work.

The Optimal Depletion of Exhaustible Resource under Different Commitment

There are few papers in the literature focusing on the issue of the optimal depletion of exhaustible resources in the framework of variable time preference. This paper attempts to analyze the pure consumption of exhaustible resource under hy- perbolic time preference, and to discuss the optimal depletion rate and the effect of the protection of the exhaustible resource under different commitment abilities. The results of model show that the case of the hyperbolic discount with the full commitment of the govemment is equivalent to the case of constant discount of the social planner problem. In that case, the optimal depletion rate and the initial consumption of exhaustible resource are the slowest. On the contrary, they are the highest and the myopic behaviors lead to excessive consumption of exhaustible resources inevitably without commitment. Otherwise, in the case of partial commit- ment, the results are between the cases of full commitment and of no commitment. Therefore, with the hyperbolic time preference, the optimal depletion rate of resource depends on the commitment ability. Higher commitment ability leads to lower effective rate of time preference, and consequently, lower depletion rate and lower initial depletion value. The improvement of commitment ability can decrease the impatience and myopia behaviors, and contribute to the protection of the exhaustible resources.

A multi-resource scheduling scheme of Kubernetes for IIoT

With the rapid development of data applications in the scene of Industrial Internet of Things(IIoT),how to schedule resources in IIoT environment has become an urgent problem to be solved.Due to benefit of its strong scalability and compatibility,Kubernetes has been applied to resource scheduling in IIoT scenarios.However,the limited types of resources,the default scheduling scoring strategy,and the lack of delay control module limit its resource scheduling performance.To address these problems,this paper proposes a multi-resource scheduling(MRS)scheme of Kubernetes for IIoT.The MRS scheme dynamically balances resource utilization by taking both requirements of tasks and the current system state into consideration.Furthermore,the experiments demonstrate the effectiveness of the MRS scheme in terms of delay control and resource utilization.

Optimal Resource Allocation and Quality of Service Prediction in Cloud

In the present scenario,cloud computing service provides on-request access to a collection of resources available in remote system that can be shared by numerous clients.Resources are in self-administration;consequently,clients can adjust their usage according to their requirements.Resource usage is estimated and clients can pay according to their utilization.In literature,the existing method describes the usage of various hardware assets.Quality of Service(QoS)needs to be considered for ascertaining the schedule and the access of resources.Adhering with the security arrangement,any additional code is forbidden to ensure the usage of resources complying with QoS.Thus,all monitoring must be done from the hypervisor.To overcome the issues,Robust Resource Allocation and Utilization(RRAU)approach is developed for optimizing the management of its cloud resources.The work hosts a numerous virtual assets which could be expected under the circumstances and it enforces a controlled degree of QoS.The asset assignment calculation is heuristic,which is based on experimental evaluations,RRAU approach with J48 prediction model reduces Job Completion Time(JCT)by 4.75 s,Make Span(MS)6.25,and Monetary Cost(MC)4.25 for 15,25,35 and 45 resources are compared to the conventional methodologies in cloud environment.

Improved Delay Priority Resource Scheduling with Low Packet Loss Rate for MBMS in LTE Systems

An improved delay priority resource scheduling algorithm with low packet loss rate for multimedia broadcast multicast service(MBMS)in long term evolution(LTE)systems is proposed in this paper.Real-time services in LTE systems require lower delay and packet loss rate.However,it is difficult to meet the QoS requirements of real-time services using the current MBMS resource scheduling algorithm.The proposed algorithm in this paper jointly considers user delay information and real-time channel conditions.By introducing the user delay information,the lower delay and fairness of users are guaranteed.Meanwhile,by considering the channel conditions of users,the packet loss rate can be effectively reduced,improving the system throughput.Simulation results show that under the premise of ensuring the delay requirements of real-time services,the proposed algorithm achieves a lower packet loss rate compared to other existing algorithms.Furthermore,it can achieve a good balance between system throughput and user fairness.

Intelligent Resources Management System Design in Information Centric Networking

Information centric networking(ICN) is a new network architecture that is centred on accessing content. It aims to solve some of the problems associated with IP networks, increasing content distribution capability and improving users' experience. To analyse the requests' patterns and fully utilize the universal cached contents, a novel intelligent resources management system is proposed, which enables effi cient cache resource allocation in real time, based on changing user demand patterns. The system is composed of two parts. The fi rst part is a fi ne-grain traffi c estimation algorithm called Temporal Poisson traffi c prediction(TP2) that aims at analysing the traffi c pattern(or aggregated user requests' demands) for different contents. The second part is a collaborative cache placement algorithm that is based on traffic estimated by TP2. The experimental results show that TP2 has better performance than other comparable traffi c prediction algorithms and the proposed intelligent system can increase the utilization of cache resources and improve the network capacity.

Research on Optimization of Dual-Resource Batch Scheduling in Flexible Job Shop

With the rapid development of intelligent manufacturing and the changes in market demand,the current manufacturing industry presents the characteristics of multi-varieties,small batches,customization,and a short production cycle,with the whole production process having certain flexibility.In this paper,a mathematical model is established with the minimum production cycle as the optimization objective for the dual-resource batch scheduling of the flexible job shop,and an improved nested optimization algorithm is designed to solve the problem.The outer layer batch optimization problem is solved by the improved simulated annealing algorithm.The inner double resource scheduling problem is solved by the improved adaptive genetic algorithm,the double coding scheme,and the decoding scheme of Automated Guided Vehicle(AGV)scheduling based on the scheduling rules.The time consumption of collision-free paths is solved with the path planning algorithm which uses the Dijkstra algorithm based on a time window.Finally,the effectiveness of the algorithm is verified by actual cases,and the influence of AGV with different configurations on workshop production efficiency is analyzed.

Overbooking-Enabled Task Scheduling and Resource Allocation in Mobile Edge Computing Environments

Mobile Edge Computing(MEC)is proposed to solve the needs of Inter-net of Things(IoT)users for high resource utilization,high reliability and low latency of service requests.However,the backup virtual machine is idle when its primary virtual machine is running normally,which will waste resources.Overbooking the backup virtual machine under the above circumstances can effectively improve resource utilization.First,these virtual machines are deployed into slots randomly,and then some tasks with cooperative relationship are off-loaded to virtual machines for processing.Different deployment locations have different resource utilization and average service response time.We want tofind a balanced solution that minimizes the average service response time of the IoT application while maximizing resource utilization.In this paper,we propose a task scheduler and exploit a Task Deployment Algorithm(TDA)to obtain an optimal virtual machine deployment scheme.Finally,the simulation results show that the TDA can significantly increase the resource utilization of the system,while redu-cing the average service response time of the application by comparing TDA with the other two classical methods.The experimental results confirm that the perfor-mance of TDA is better than that of other two methods.

Concurrent processes scheduling with scarce resources in small and medium enterprises

Scarce resources,precedence and non-determined time-lag are three constraints commonly found in small and medium manufacturing enterprises(SMEs),which are deemed to block the application of workflow management system(WfMS). To tackle this problem,a workflow scheduling approach is proposed based on timing workflow net(TWF-net) and genetic algorithm(GA). The workflow is modelled in a form of TWF-net in favour of process simulation and resource conflict checking. After simplifying and reconstructing the set of workflow instance,the conflict resolution problem is transformed into a resource-constrained project scheduling problem(RCPSP),which could be efficiently solved by a heuristic method,such as GA. Finally,problems of various sizes are utilized to test the performance of the proposed algorithm and to compare it with first-come-firstserved(FCFS) strategy. The evaluation demonstrates that the proposed method is an overwhelming and effective approach for scheduling the concurrent processes with precedence and resource constraints.

Modeling for UAV resource scheduling under mission synchronization

Unmanned aerial vehicle（UAV） resource scheduling means to allocate and aggregate the available UAV resources depending on the mission requirements and the battlefield situation assessment.In previous studies,the models cannot reflect the mission synchronization;the targets are treated respectively,which results in the large scale of the problem and high computational complexity.To overcome these disadvantages,a model for UAV resource scheduling under mission synchronization is proposed,which is based on single-objective non-linear integer programming.And several cooperative teams are aggregated for the target clusters from the available resources.The evaluation indices of weapon allocation are referenced in establishing the objective function and the constraints for the issue.The scales of the target clusters are considered as the constraints for the scales of the cooperative teams to make them match in scale.The functions of the intersection between the ＂mission time-window＂ and the UAV ＂arrival time-window＂ are introduced into the objective function and the constraints in order to describe the mission synchronization effectively.The results demonstrate that the proposed expanded model can meet the requirement of mission synchronization,guide the aggregation of cooperative teams for the target clusters and control the scale of the problem effectively.

INVESTIGATION OF UPLINK RADIO RESOURCE MANAGEMENT SCHEMES FOR MULTI-SERVICES IN TDD-CDMA SYSTEMS EMPLOYING SMART ANTENNAS

In this paper, a theoretical analysis of Time Division Duplex-Code Division Multiple Access (TDD-CDMA) uplink capacity constraint is presented when employing the smart antenna techniques. The evaluation formulations of capacity and load for multi-services are proposed. In order to maximize the throughput, the objective of optimization is proposed, and an advanced uplink resource management algo-rithm is developed. The proposed algorithm based on the least interference admission control scheme focuses on the maximum throughput for the circuit switched multi-services. The simulation results show that the pro-posed strategy has a significant improvement in throughput when the optimum admission control threshold is set.