With the rapid development of Network Function Virtualization(NFV),the problem of low resource utilizationin traditional data centers is gradually being addressed.However,existing research does not optimize both local...With the rapid development of Network Function Virtualization(NFV),the problem of low resource utilizationin traditional data centers is gradually being addressed.However,existing research does not optimize both localand global allocation of resources in data centers.Hence,we propose an adaptive hybrid optimization strategy thatcombines dynamic programming and neural networks to improve resource utilization and service quality in datacenters.Our approach encompasses a service function chain simulation generator,a parallel architecture servicesystem,a dynamic programming strategy formaximizing the utilization of local server resources,a neural networkfor predicting the global utilization rate of resources and a global resource optimization strategy for bottleneck andredundant resources.With the implementation of our local and global resource allocation strategies,the systemperformance is significantly optimized through simulation.展开更多
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 t...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.展开更多
Users and edge servers are not fullymutually trusted inmobile edge computing(MEC),and hence blockchain can be introduced to provide trustableMEC.In blockchain-basedMEC,each edge server functions as a node in bothMEC a...Users and edge servers are not fullymutually trusted inmobile edge computing(MEC),and hence blockchain can be introduced to provide trustableMEC.In blockchain-basedMEC,each edge server functions as a node in bothMEC and blockchain,processing users’tasks and then uploading the task related information to the blockchain.That is,each edge server runs both users’offloaded tasks and blockchain tasks simultaneously.Note that there is a trade-off between the resource allocation for MEC and blockchain tasks.Therefore,the allocation of the resources of edge servers to the blockchain and theMEC is crucial for the processing delay of blockchain-based MEC.Most of the existing research tackles the problem of resource allocation in either blockchain or MEC,which leads to unfavorable performance of the blockchain-based MEC system.In this paper,we study how to allocate the computing resources of edge servers to the MEC and blockchain tasks with the aimtominimize the total systemprocessing delay.For the problem,we propose a computing resource Allocation algorithmfor Blockchain-based MEC(ABM)which utilizes the Slater’s condition,Karush-Kuhn-Tucker(KKT)conditions,partial derivatives of the Lagrangian function and subgradient projection method to obtain the solution.Simulation results show that ABM converges and effectively reduces the processing delay of blockchain-based MEC.展开更多
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 env...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.展开更多
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 ...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.展开更多
In this paper,we investigate IRS-aided user cooperation(UC)scheme in millimeter wave(mmWave)wirelesspowered sensor networks(WPSN),where two single-antenna users are wireless powered in the wireless energy transfer(WET...In this paper,we investigate IRS-aided user cooperation(UC)scheme in millimeter wave(mmWave)wirelesspowered sensor networks(WPSN),where two single-antenna users are wireless powered in the wireless energy transfer(WET)phase first and then cooperatively transmit information to a hybrid access point(AP)in the wireless information transmission(WIT)phase,following which the IRS is deployed to enhance the system performance of theWET andWIT.We maximized the weighted sum-rate problem by jointly optimizing the transmit time slots,power allocations,and the phase shifts of the IRS.Due to the non-convexity of the original problem,a semidefinite programming relaxation-based approach is proposed to convert the formulated problem to a convex optimization framework,which can obtain the optimal global solution.Simulation results demonstrate that the weighted sum throughput of the proposed UC scheme outperforms the non-UC scheme whether equipped with IRS or not.展开更多
Context/objectives: The fight against Chronic Non-Communicable Diseases (NCDs) is a long-term undertaking, which requires available, motivated and well-managed human resources (HR). The administrative management of sk...Context/objectives: The fight against Chronic Non-Communicable Diseases (NCDs) is a long-term undertaking, which requires available, motivated and well-managed human resources (HR). The administrative management of skills on both qualitative and quantitative levels is one of the essential functions of a health system. To better implement policies of fight against High Blood Pressure (HBP) and other chronic diseases, it is important to establish strategies to retain health personnel. This loyalty requires favorable working conditions and consideration of the contribution-reward couple. Good working conditions are likely to reduce the phenomenon of medical nomadism;conversely, poor HR management can contribute to their exodus towards exotic “green pastures”, thus leading to an additional crisis in the Cameroonian health system. The fight against HBP is a complex, multifaceted and multifactorial reality that requires appropriate management model for all types of resources mainly HR. The main objective of this research is to show the impact of poor management of human resources in Cameroon health system on medical nomadism and the ineffectiveness of the fight against High Blood Pressure. Method: A cross-sectional descriptive survey among five hundred (500) health facilities in the center region of Cameroon has been conducted. A stratified probabilistic technique has been used, and the number of health facilities to be surveyed has been determined using the “sample size estimation table” of Depelteau. The physical questionnaires have been printed and then distributed to data collectors. After data collection, the latter were grouped during processing in Excel sheets. The Chi-square test was used for data with a qualitative value and that of Kolmogorov-Sminorf for data with a quantitative value to assess the normality and reliability of data. The Crochach’s Alpha reliability test allowed us to have a summary of the means and variances and then to search for intragroup correlations between variables. Descriptive analysis was possible with the XLSTAT 2016 software. Results: 43.60% of Health Facilities (HF) managers were unqualified. 82.20% of HF managers have staff in a situation of professional insecurity. They are mainly contractual (49.00), decision-making agents (24.40%), casual agents (08.80). The proportion of unstable personnel is average of 22.00% and very unstable, 12.00%.展开更多
The fight against the COVID−19 epidemic is a war against an“invisible enemy”.Access to accurate information and appropriate allocation of medical resources are key to containing the spread of the virus as soon as po...The fight against the COVID−19 epidemic is a war against an“invisible enemy”.Access to accurate information and appropriate allocation of medical resources are key to containing the spread of the virus as soon as possible.The Chinese government has great power to collect information from individuals and basic-level organizations.It also has strong ability to pool and allocate medical resources.The fight against COVID−19 can be deemed as a quasi-natural experiment and based on this,we examine how government information capacity and medical resource allocation influence epidemic prevention and control in 286 Chinese cities(prefecture level and above).The fi ndings are as follows:(1)Government information capacities improve the effectiveness of prevention and control policies.At city level,for every 0.1 point of increase in government information capacity score,the number of confi rmed cases will reduce by 66.5,and the number of deaths per 10000 people will be down by 0.008.(2)The quantity of medical resources available has no direct influence on the effectiveness of epidemic prevention and control,but higher allocation efficiency does bring higher effectiveness.(3)The government can,on the one hand,allocate public resources based on information,and on the other hand guide the flow of social resources by releasing relevant information.Both can improve the allocation efficiency of medical resources.These fi ndings have some policy implications for improving global emergency management.展开更多
Cold-chain logistics system(CCLS)plays the role of collecting and managing the logistics data of frozen food.However,there always exist problems of information loss,data tampering,and privacy leakage in traditional ce...Cold-chain logistics system(CCLS)plays the role of collecting and managing the logistics data of frozen food.However,there always exist problems of information loss,data tampering,and privacy leakage in traditional centralized systems,which influence frozen food security and people’s health.The centralized management form impedes the development of the cold-chain logistics industry and weakens logistics data availability.This paper first introduces a distributed CCLS based on blockchain technology to solve the centralized management problem.This system aggregates the production base,storage,transport,detection,processing,and consumer to form a cold-chain logistics union.The blockchain ledger guarantees that the logistics data cannot be tampered with and establishes a traceability mechanism for food safety incidents.Meanwhile,to improve the value of logistics data,a Stackelberg game-based resource allocation model has been proposed between the logistics data resource provider and the consumer.The competition between resource price and volume balances the resource supplement and consumption.This model can help to achieve an optimal resource price when the Stackelberg game obtains Nash equilibrium.The two participants also can maximize their revenues with the optimal resource price and volume by utilizing the backward induction method.Then,the performance evaluations of transaction throughput and latency show that the proposed distributed CCLS is more secure and stable.The simulations about the variation trend of data price and amount,optimal benefits,and total benefits comparison of different forms show that the resource allocation model is more efficient and practical.Moreover,the blockchain-based CCLS and Stackelberg game-based resource allocation model also can promote the value of logistic data and improve social benefits.展开更多
With the development of artificial intelligence(AI)and 5G technology,the integration of sensing,communication and computing in the Internet of Vehicles(Io V)is becoming a trend.However,the large amount of data transmi...With the development of artificial intelligence(AI)and 5G technology,the integration of sensing,communication and computing in the Internet of Vehicles(Io V)is becoming a trend.However,the large amount of data transmission and the computing requirements of intelligent tasks lead to the complex resource management problems.In view of the above challenges,this paper proposes a tasks-oriented joint resource allocation scheme(TOJRAS)in the scenario of Io V.First,this paper proposes a system model with sensing,communication,and computing integration for multiple intelligent tasks with different requirements in the Io V.Secondly,joint resource allocation problems for real-time tasks and delay-tolerant tasks in the Io V are constructed respectively,including communication,computing and caching resources.Thirdly,a distributed deep Q-network(DDQN)based algorithm is proposed to solve the optimization problems,and the convergence and complexity of the algorithm are discussed.Finally,the experimental results based on real data sets verify the performance advantages of the proposed resource allocation scheme,compared to the existing ones.The exploration efficiency of our proposed DDQN-based algorithm is improved by at least about 5%,and our proposed resource allocation scheme improves the m AP performance by about 0.15 under resource constraints.展开更多
Accessibility and capacity of medical resources are key for the health care and emergency response, while the efficiency of the medical resources is very much limited by hypoxia in Tibet, China.Through introducing exe...Accessibility and capacity of medical resources are key for the health care and emergency response, while the efficiency of the medical resources is very much limited by hypoxia in Tibet, China.Through introducing exercise efficiency, this study explores the accessibility of township residence to county-ship medical resources in Tibet using weighted mean travel time(WMT), and evaluates the medical capacity accordingly.The results show that: 1) the average travel time of township residence to county-level hospital is around2 h by motor vehicle in Tibet.More than half of the population can not reach the county-ship hospital within 1 h, 33.24% of the population can not reach within 2 h, and 3.75% of the population can not reach within 6 h.2) When considering the catchment of the medical resources and the population size, the WMT of the county-ship medical resources ranges from 0.25 h to 10.92 h.3) After adjusted by travel time and exercise efficiency, the county-ship medical capacity became more unequal, with 38 out of 74 counties could not meet the national guideline of 1.8 medical beds per 1000.4) In total, there are 17 counties with good WMT and sufficient medical resources,while 13 counties having very high WMT and low capacity of medical resources in Tibet.In the end, suggestions on medical resources relocation and to improve the capacity are provided.This study provides a method to incorporate exercise efficiency to access the accessibility and evaluate medical capacity that can be applied in high altitude ranges.展开更多
Cloud computingmakes dynamic resource provisioning more accessible.Monitoring a functioning service is crucial,and changes are made when particular criteria are surpassed.This research explores the decentralized multi...Cloud computingmakes dynamic resource provisioning more accessible.Monitoring a functioning service is crucial,and changes are made when particular criteria are surpassed.This research explores the decentralized multi-cloud environment for allocating resources and ensuring the Quality of Service(QoS),estimating the required resources,and modifying allotted resources depending on workload and parallelism due to resources.Resource allocation is a complex challenge due to the versatile service providers and resource providers.The engagement of different service and resource providers needs a cooperation strategy for a sustainable quality of service.The objective of a coherent and rational resource allocation is to attain the quality of service.It also includes identifying critical parameters to develop a resource allocation mechanism.A framework is proposed based on the specified parameters to formulate a resource allocation process in a decentralized multi-cloud environment.The three main parameters of the proposed framework are data accessibility,optimization,and collaboration.Using an optimization technique,these three segments are further divided into subsets for resource allocation and long-term service quality.The CloudSim simulator has been used to validate the suggested framework.Several experiments have been conducted to find the best configurations suited for enhancing collaboration and resource allocation to achieve sustained QoS.The results support the suggested structure for a decentralized multi-cloud environment and the parameters that have been determined.展开更多
The computational complexity of resource allocation processes,in cognitive radio networks(CRNs),is a major issue to be managed.Furthermore,the complicated solution of the optimal algorithm for handling resource alloca...The computational complexity of resource allocation processes,in cognitive radio networks(CRNs),is a major issue to be managed.Furthermore,the complicated solution of the optimal algorithm for handling resource allocation in CRNs makes it unsuitable to adopt in real-world applications where both cognitive users,CRs,and primary users,PUs,exist in the identical geographical area.Hence,this work offers a primarily price-based power algorithm to reduce computational complexity in uplink scenarioswhile limiting interference to PUs to allowable threshold.Hence,this paper,compared to other frameworks proposed in the literature,proposes a two-step approach to reduce the complexity of the proposed mathematical model.In the first step,the subcarriers are assigned to the users of the CRN,while the cost function includes a pricing scheme to provide better power control algorithm with improved reliability proposed in the second stage.The main contribution of this paper is to lessen the complexity of the proposed algorithm and to offer flexibility in controlling the interference produced to the users of the primary networks,which has been achieved by including a pricing function in the proposed cost function.Finally,the performance of the proposed power and subcarrier algorithm is confirmed for orthogonal frequency-division multiplexing(OFDM).Simulation results prove that the performance of the proposed algorithm is better than other algorithms,albeit with a lesser complexity of O(NM)+O(Nlog(N)).展开更多
In a cloud-native era,the Kubernetes-based workflow engine enables workflow containerized execution through the inherent abilities of Kubernetes.However,when encountering continuous workflow requests and unexpected re...In a cloud-native era,the Kubernetes-based workflow engine enables workflow containerized execution through the inherent abilities of Kubernetes.However,when encountering continuous workflow requests and unexpected resource request spikes,the engine is limited to the current workflow load information for resource allocation,which lacks the agility and predictability of resource allocation,resulting in over and underprovisioning resources.This mechanism seriously hinders workflow execution efficiency and leads to high resource waste.To overcome these drawbacks,we propose an adaptive resource allocation scheme named adaptive resource allocation scheme(ARAS)for the Kubernetes-based workflow engines.Considering potential future workflow task requests within the current task pod’s lifecycle,the ARAS uses a resource scaling strategy to allocate resources in response to high-concurrency workflow scenarios.The ARAS offers resource discovery,resource evaluation,and allocation functionalities and serves as a key component for our tailored workflow engine(KubeAdaptor).By integrating the ARAS into KubeAdaptor for workflow containerized execution,we demonstrate the practical abilities of KubeAdaptor and the advantages of our ARAS.Compared with the baseline algorithm,experimental evaluation under three distinct workflow arrival patterns shows that ARAS gains time-saving of 9.8% to 40.92% in the average total duration of all workflows,time-saving of 26.4% to 79.86% in the average duration of individual workflow,and an increase of 1% to 16% in centrol processing unit(CPU)and memory resource usage rate.展开更多
To solve the contradiction between limited spectrum resources and increasing communication demand,this paper proposes a wireless resource allocation scheme based on the Deep Q Network(DQN)to allocate radio resources i...To solve the contradiction between limited spectrum resources and increasing communication demand,this paper proposes a wireless resource allocation scheme based on the Deep Q Network(DQN)to allocate radio resources in a downlink multi-user cognitive radio(CR)network with slicing.Secondary users(SUs)are multiplexed using non-orthogonal multiple access(NOMA).The SUs use the hybrid spectrum access mode to improve the spectral efficiency(SE).Considering the demand for multiple services,the enhanced mobile broadband(eMBB)slice and ultrareliable low-latency communication(URLLC)slice were established.The proposed scheme can maximize the SE while ensuring Quality of Service(QoS)for the users.This study established a mapping relationship between resource allocation and the DQN algorithm in the CR-NOMA network.According to the signal-to-interference-plusnoise ratio(SINR)of the primary users(PUs),the proposed scheme can output the optimal channel selection and power allocation.The simulation results reveal that the proposed scheme can converge faster and obtain higher rewards compared with the Q-Learning scheme.Additionally,the proposed scheme has better SE than both the overlay and underlay only modes.展开更多
With the continuous progress of information technique,assisted driving technology has become an effective technique to avoid traffic accidents.Due to the complex road conditions and the threat of vehicle information b...With the continuous progress of information technique,assisted driving technology has become an effective technique to avoid traffic accidents.Due to the complex road conditions and the threat of vehicle information being attacked and tampered with,it is difficult to ensure information security.This paper uses blockchain to ensure the safety of driving information and introduces mobile edge computing technology to monitor vehicle information and road condition information in real time,calculate the appropriate speed,and plan a reasonable driving route for the driver.To solve these problems,this paper proposes a trusted edge resource allocation framework for assisted driving service,which includes two stages:the blockchain generation stage(the first stage)and assisted driving service stage(the second stage).Furthermore,in the first stage,a delay-and-throughput-oriented block generation model for the mobile terminal is designed.In the second stage,a balanced offloading algorithm for assisted driving service based on edge collaboration is proposed to solve the problems of unbalanced load of cluster mobile edge computing(MEC)servers and low resource utilization of the system.And this paper optimizes the throughput of blockchain and delay of the transportation network through deep reinforcement learning(DRL)algorithm.Finally,compared with joint computation and communication resources’allocation(JCCR)and resource allocation method based on binary offloading(RAB),our proposed scheme can optimize the delay by 7.4%and 26.7%,and support various application services of the vehicular networks more effectively.展开更多
In this paper,we propose a low complexity spectrum resource allocation scheme cross the access points(APs)for the ultra dense networks(UDNs),in which all the APs are divided into several AP groups(APGs)and the total b...In this paper,we propose a low complexity spectrum resource allocation scheme cross the access points(APs)for the ultra dense networks(UDNs),in which all the APs are divided into several AP groups(APGs)and the total bandwidth is divided into several narrow band spectrum resources and each spectrum resource is allocated to APGs independently to decrease the interference among the cells.Furthermore,we investigate the joint spectrum and power allocation problem in UDNs to maximize the overall throughput.The problem is formulated as a mixed-integer nonconvex optimization(MINCP)problem which is difficult to solve in general.The joint optimization problem is decomposed into two subproblems in terms of the spectrum allocation and power allocation respectively.For the spectrum allocation,we model it as a auction problem and a combinatorial auction approach is proposed to tackle it.In addition,the DC programming method is adopted to optimize the power allocation subproblem.To decrease the signaling and computational overhead,we propose a distributed algorithm based on the Lagrangian dual method.Simulation results illustrate that the proposed algorithm can effectively improve the system throughput.展开更多
Network slicing is envisioned as one of the key techniques to meet the extremely diversified service requirements of the Internet of Things(IoT)as it provides an enhanced user experience and elastic resource configura...Network slicing is envisioned as one of the key techniques to meet the extremely diversified service requirements of the Internet of Things(IoT)as it provides an enhanced user experience and elastic resource configuration.In the context of slicing enhanced IoT networks,both the Service Provider(SP)and Infrastructure Provider(InP)face challenges of ensuring efficient slice construction and high profit in dynamic environments.These challenges arise from randomly generated and departed slice requests from end-users,uncertain resource availability,and multidimensional resource allocation.Admission and resource allocation for distinct demands of slice requests are the key issues in addressing these challenges and should be handled effectively in dynamic environments.To this end,we propose an Opportunistic Admission and Resource allocation(OAR)policy to deal with the issues of random slicing requests,uncertain resource availability,and heterogeneous multi-resources.The key idea of OAR is to allow the SP to decide whether to accept slice requests immediately or defer them according to the load and price of resources.To cope with the random slice requests and uncertain resource availability,we formulated this issue as a Markov Decision Process(MDP)to obtain the optimal admission policy,with the aim of maximizing the system reward.Furthermore,the buyer-seller game theory approach was adopted to realize the optimal resource allocation,while motivating each SP and InP to maximize their rewards.Our numerical results show that the proposed OAR policy can make reasonable decisions effectively and steadily,and outperforms the baseline schemes in terms of the system reward.展开更多
The number of mobile devices accessing wireless networks isskyrocketing due to the rapid advancement of sensors and wireless communicationtechnology. In the upcoming years, it is anticipated that mobile datatraffic wo...The number of mobile devices accessing wireless networks isskyrocketing due to the rapid advancement of sensors and wireless communicationtechnology. In the upcoming years, it is anticipated that mobile datatraffic would rise even more. The development of a new cellular networkparadigm is being driven by the Internet of Things, smart homes, and moresophisticated applications with greater data rates and latency requirements.Resources are being used up quickly due to the steady growth of smartphonedevices andmultimedia apps. Computation offloading to either several distantclouds or close mobile devices has consistently improved the performance ofmobile devices. The computation latency can also be decreased by offloadingcomputing duties to edge servers with a specific level of computing power.Device-to-device (D2D) collaboration can assist in processing small-scaleactivities that are time-sensitive in order to further reduce task delays. The taskoffloading performance is drastically reduced due to the variation of differentperformance capabilities of edge nodes. Therefore, this paper addressed thisproblem and proposed a new method for D2D communication. In thismethod, the time delay is reduced by enabling the edge nodes to exchangedata samples. Simulation results show that the proposed algorithm has betterperformance than traditional algorithm.展开更多
Fog computing is an emergent and powerful computing paradigm to serve latency-sensitive applications by executing internet of things(IoT)appli-cations in the proximity of the network.Fog computing offers computational...Fog computing is an emergent and powerful computing paradigm to serve latency-sensitive applications by executing internet of things(IoT)appli-cations in the proximity of the network.Fog computing offers computational and storage services between cloud and terminal devices.However,an efficient resource allocation to execute the IoT applications in a fog environment is still challenging due to limited resource availability and low delay requirement of services.A large number of heterogeneous shareable resources makes fog computing a complex environment.In the sight of these issues,this paper has proposed an efficient levy flight firefly-based resource allocation technique.The levy flight algorithm is a metaheuristic algorithm.It offers high efficiency and success rate because of its longer step length and fast convergence rate.Thus,it treats global optimization problems more efficiently and naturally.A system framework for fog computing is presented,followed by the proposed resource allocation scheme in the fog computing environment.Experimental evaluation and comparison with the firefly algorithm(FA),particle swarm optimization(PSO),genetic algorithm(GA)and hybrid algorithm using GA and PSO(GAPSO)have been conducted to validate the effectiveness and efficiency of the proposed algorithm.Simulation results show that the proposed algorithm performs efficient resource allocation and improves the quality of service(QoS).The proposed algorithm reduces average waiting time,average execution time,average turnaround time,processing cost and energy consumption and increases resource utilization and task success rate compared to FA,GAPSO,PSO and GA.展开更多
基金the Fundamental Research Program of Guangdong,China,under Grants 2020B1515310023 and 2023A1515011281in part by the National Natural Science Foundation of China under Grant 61571005.
文摘With the rapid development of Network Function Virtualization(NFV),the problem of low resource utilizationin traditional data centers is gradually being addressed.However,existing research does not optimize both localand global allocation of resources in data centers.Hence,we propose an adaptive hybrid optimization strategy thatcombines dynamic programming and neural networks to improve resource utilization and service quality in datacenters.Our approach encompasses a service function chain simulation generator,a parallel architecture servicesystem,a dynamic programming strategy formaximizing the utilization of local server resources,a neural networkfor predicting the global utilization rate of resources and a global resource optimization strategy for bottleneck andredundant resources.With the implementation of our local and global resource allocation strategies,the systemperformance is significantly optimized through simulation.
基金supported in part by the National Key R&D Program of China under Grant 2020YFB1005900the National Natural Science Foundation of China under Grant 62001220+3 种基金the Jiangsu Provincial Key Research and Development Program under Grants BE2022068the Natural Science Foundation of Jiangsu Province under Grants BK20200440the Future Network Scientific Research Fund Project FNSRFP-2021-YB-03the Young Elite Scientist Sponsorship Program,China Association for Science and Technology.
文摘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.
基金supported by the Key Research and Development Project in Anhui Province of China(Grant No.202304a05020059)the Fundamental Research Funds for the Central Universities of China(Grant No.PA2023GDSK0055)the Project of Anhui Province Economic and Information Bureau(Grant No.JB20099).
文摘Users and edge servers are not fullymutually trusted inmobile edge computing(MEC),and hence blockchain can be introduced to provide trustableMEC.In blockchain-basedMEC,each edge server functions as a node in bothMEC and blockchain,processing users’tasks and then uploading the task related information to the blockchain.That is,each edge server runs both users’offloaded tasks and blockchain tasks simultaneously.Note that there is a trade-off between the resource allocation for MEC and blockchain tasks.Therefore,the allocation of the resources of edge servers to the blockchain and theMEC is crucial for the processing delay of blockchain-based MEC.Most of the existing research tackles the problem of resource allocation in either blockchain or MEC,which leads to unfavorable performance of the blockchain-based MEC system.In this paper,we study how to allocate the computing resources of edge servers to the MEC and blockchain tasks with the aimtominimize the total systemprocessing delay.For the problem,we propose a computing resource Allocation algorithmfor Blockchain-based MEC(ABM)which utilizes the Slater’s condition,Karush-Kuhn-Tucker(KKT)conditions,partial derivatives of the Lagrangian function and subgradient projection method to obtain the solution.Simulation results show that ABM converges and effectively reduces the processing delay of blockchain-based MEC.
基金Project supported by the Natural Science Foundation of Jilin Province of China(Grant No.20210101417JC).
文摘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.
基金supported by National Key Research and Development Program of China(2018YFC1504502).
文摘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.
基金This work was supported in part by the open research fund of National Mobile Communications Research Laboratory,Southeast University(No.2023D11)in part by Sponsored by program for Science&Technology Innovation Talents in Universities of Henan Province(23HASTIT019)+2 种基金in part by Natural Science Foundation of Henan Province(20232300421097)in part by the project funded by China Postdoctoral Science Foundation(2020M682345)in part by the Henan Postdoctoral Foundation(202001015).
文摘In this paper,we investigate IRS-aided user cooperation(UC)scheme in millimeter wave(mmWave)wirelesspowered sensor networks(WPSN),where two single-antenna users are wireless powered in the wireless energy transfer(WET)phase first and then cooperatively transmit information to a hybrid access point(AP)in the wireless information transmission(WIT)phase,following which the IRS is deployed to enhance the system performance of theWET andWIT.We maximized the weighted sum-rate problem by jointly optimizing the transmit time slots,power allocations,and the phase shifts of the IRS.Due to the non-convexity of the original problem,a semidefinite programming relaxation-based approach is proposed to convert the formulated problem to a convex optimization framework,which can obtain the optimal global solution.Simulation results demonstrate that the weighted sum throughput of the proposed UC scheme outperforms the non-UC scheme whether equipped with IRS or not.
文摘Context/objectives: The fight against Chronic Non-Communicable Diseases (NCDs) is a long-term undertaking, which requires available, motivated and well-managed human resources (HR). The administrative management of skills on both qualitative and quantitative levels is one of the essential functions of a health system. To better implement policies of fight against High Blood Pressure (HBP) and other chronic diseases, it is important to establish strategies to retain health personnel. This loyalty requires favorable working conditions and consideration of the contribution-reward couple. Good working conditions are likely to reduce the phenomenon of medical nomadism;conversely, poor HR management can contribute to their exodus towards exotic “green pastures”, thus leading to an additional crisis in the Cameroonian health system. The fight against HBP is a complex, multifaceted and multifactorial reality that requires appropriate management model for all types of resources mainly HR. The main objective of this research is to show the impact of poor management of human resources in Cameroon health system on medical nomadism and the ineffectiveness of the fight against High Blood Pressure. Method: A cross-sectional descriptive survey among five hundred (500) health facilities in the center region of Cameroon has been conducted. A stratified probabilistic technique has been used, and the number of health facilities to be surveyed has been determined using the “sample size estimation table” of Depelteau. The physical questionnaires have been printed and then distributed to data collectors. After data collection, the latter were grouped during processing in Excel sheets. The Chi-square test was used for data with a qualitative value and that of Kolmogorov-Sminorf for data with a quantitative value to assess the normality and reliability of data. The Crochach’s Alpha reliability test allowed us to have a summary of the means and variances and then to search for intragroup correlations between variables. Descriptive analysis was possible with the XLSTAT 2016 software. Results: 43.60% of Health Facilities (HF) managers were unqualified. 82.20% of HF managers have staff in a situation of professional insecurity. They are mainly contractual (49.00), decision-making agents (24.40%), casual agents (08.80). The proportion of unstable personnel is average of 22.00% and very unstable, 12.00%.
文摘The fight against the COVID−19 epidemic is a war against an“invisible enemy”.Access to accurate information and appropriate allocation of medical resources are key to containing the spread of the virus as soon as possible.The Chinese government has great power to collect information from individuals and basic-level organizations.It also has strong ability to pool and allocate medical resources.The fight against COVID−19 can be deemed as a quasi-natural experiment and based on this,we examine how government information capacity and medical resource allocation influence epidemic prevention and control in 286 Chinese cities(prefecture level and above).The fi ndings are as follows:(1)Government information capacities improve the effectiveness of prevention and control policies.At city level,for every 0.1 point of increase in government information capacity score,the number of confi rmed cases will reduce by 66.5,and the number of deaths per 10000 people will be down by 0.008.(2)The quantity of medical resources available has no direct influence on the effectiveness of epidemic prevention and control,but higher allocation efficiency does bring higher effectiveness.(3)The government can,on the one hand,allocate public resources based on information,and on the other hand guide the flow of social resources by releasing relevant information.Both can improve the allocation efficiency of medical resources.These fi ndings have some policy implications for improving global emergency management.
基金supported by the National Natural Science Foundation of China under Grant 92046001,61962009the Doctor Scientific Research Fund of Zhengzhou University of Light Industry underGrant 2021BSJJ033Key ScientificResearch Project of Colleges andUniversities in Henan Province(CN)under Grant No.22A413010.
文摘Cold-chain logistics system(CCLS)plays the role of collecting and managing the logistics data of frozen food.However,there always exist problems of information loss,data tampering,and privacy leakage in traditional centralized systems,which influence frozen food security and people’s health.The centralized management form impedes the development of the cold-chain logistics industry and weakens logistics data availability.This paper first introduces a distributed CCLS based on blockchain technology to solve the centralized management problem.This system aggregates the production base,storage,transport,detection,processing,and consumer to form a cold-chain logistics union.The blockchain ledger guarantees that the logistics data cannot be tampered with and establishes a traceability mechanism for food safety incidents.Meanwhile,to improve the value of logistics data,a Stackelberg game-based resource allocation model has been proposed between the logistics data resource provider and the consumer.The competition between resource price and volume balances the resource supplement and consumption.This model can help to achieve an optimal resource price when the Stackelberg game obtains Nash equilibrium.The two participants also can maximize their revenues with the optimal resource price and volume by utilizing the backward induction method.Then,the performance evaluations of transaction throughput and latency show that the proposed distributed CCLS is more secure and stable.The simulations about the variation trend of data price and amount,optimal benefits,and total benefits comparison of different forms show that the resource allocation model is more efficient and practical.Moreover,the blockchain-based CCLS and Stackelberg game-based resource allocation model also can promote the value of logistic data and improve social benefits.
基金supported by The Fundamental Research Funds for the Central Universities(No.2021XD-A01-1)The National Natural Science Foundation of China(No.92067202)。
文摘With the development of artificial intelligence(AI)and 5G technology,the integration of sensing,communication and computing in the Internet of Vehicles(Io V)is becoming a trend.However,the large amount of data transmission and the computing requirements of intelligent tasks lead to the complex resource management problems.In view of the above challenges,this paper proposes a tasks-oriented joint resource allocation scheme(TOJRAS)in the scenario of Io V.First,this paper proposes a system model with sensing,communication,and computing integration for multiple intelligent tasks with different requirements in the Io V.Secondly,joint resource allocation problems for real-time tasks and delay-tolerant tasks in the Io V are constructed respectively,including communication,computing and caching resources.Thirdly,a distributed deep Q-network(DDQN)based algorithm is proposed to solve the optimization problems,and the convergence and complexity of the algorithm are discussed.Finally,the experimental results based on real data sets verify the performance advantages of the proposed resource allocation scheme,compared to the existing ones.The exploration efficiency of our proposed DDQN-based algorithm is improved by at least about 5%,and our proposed resource allocation scheme improves the m AP performance by about 0.15 under resource constraints.
基金Under the auspices of the Second Tibetan Plateau Scientific Expedition and Research Program (STEP)(No.2019QZKK0607)。
文摘Accessibility and capacity of medical resources are key for the health care and emergency response, while the efficiency of the medical resources is very much limited by hypoxia in Tibet, China.Through introducing exercise efficiency, this study explores the accessibility of township residence to county-ship medical resources in Tibet using weighted mean travel time(WMT), and evaluates the medical capacity accordingly.The results show that: 1) the average travel time of township residence to county-level hospital is around2 h by motor vehicle in Tibet.More than half of the population can not reach the county-ship hospital within 1 h, 33.24% of the population can not reach within 2 h, and 3.75% of the population can not reach within 6 h.2) When considering the catchment of the medical resources and the population size, the WMT of the county-ship medical resources ranges from 0.25 h to 10.92 h.3) After adjusted by travel time and exercise efficiency, the county-ship medical capacity became more unequal, with 38 out of 74 counties could not meet the national guideline of 1.8 medical beds per 1000.4) In total, there are 17 counties with good WMT and sufficient medical resources,while 13 counties having very high WMT and low capacity of medical resources in Tibet.In the end, suggestions on medical resources relocation and to improve the capacity are provided.This study provides a method to incorporate exercise efficiency to access the accessibility and evaluate medical capacity that can be applied in high altitude ranges.
文摘Cloud computingmakes dynamic resource provisioning more accessible.Monitoring a functioning service is crucial,and changes are made when particular criteria are surpassed.This research explores the decentralized multi-cloud environment for allocating resources and ensuring the Quality of Service(QoS),estimating the required resources,and modifying allotted resources depending on workload and parallelism due to resources.Resource allocation is a complex challenge due to the versatile service providers and resource providers.The engagement of different service and resource providers needs a cooperation strategy for a sustainable quality of service.The objective of a coherent and rational resource allocation is to attain the quality of service.It also includes identifying critical parameters to develop a resource allocation mechanism.A framework is proposed based on the specified parameters to formulate a resource allocation process in a decentralized multi-cloud environment.The three main parameters of the proposed framework are data accessibility,optimization,and collaboration.Using an optimization technique,these three segments are further divided into subsets for resource allocation and long-term service quality.The CloudSim simulator has been used to validate the suggested framework.Several experiments have been conducted to find the best configurations suited for enhancing collaboration and resource allocation to achieve sustained QoS.The results support the suggested structure for a decentralized multi-cloud environment and the parameters that have been determined.
基金Authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work through Large Groups Project under Grant Number RGP.2/111/43supported in part by the Agencia Estatal de Investigación,Ministerio de Ciencia e Innovación(MCIN/AEI/10.13039/501100011033)+1 种基金the R+D+i Project under Grant PID2020-115323RB-C31in part by the Grant from the Spanish Ministry of Economic Affairs and Digital Transformation and the European Union-NextGenerationEU under Grant UNICO-5G I+D/AROMA3D-Hybrid TSI-063000-2021-71.
文摘The computational complexity of resource allocation processes,in cognitive radio networks(CRNs),is a major issue to be managed.Furthermore,the complicated solution of the optimal algorithm for handling resource allocation in CRNs makes it unsuitable to adopt in real-world applications where both cognitive users,CRs,and primary users,PUs,exist in the identical geographical area.Hence,this work offers a primarily price-based power algorithm to reduce computational complexity in uplink scenarioswhile limiting interference to PUs to allowable threshold.Hence,this paper,compared to other frameworks proposed in the literature,proposes a two-step approach to reduce the complexity of the proposed mathematical model.In the first step,the subcarriers are assigned to the users of the CRN,while the cost function includes a pricing scheme to provide better power control algorithm with improved reliability proposed in the second stage.The main contribution of this paper is to lessen the complexity of the proposed algorithm and to offer flexibility in controlling the interference produced to the users of the primary networks,which has been achieved by including a pricing function in the proposed cost function.Finally,the performance of the proposed power and subcarrier algorithm is confirmed for orthogonal frequency-division multiplexing(OFDM).Simulation results prove that the performance of the proposed algorithm is better than other algorithms,albeit with a lesser complexity of O(NM)+O(Nlog(N)).
基金supported by the National Natural Science Foundation of China(61873030,62002019).
文摘In a cloud-native era,the Kubernetes-based workflow engine enables workflow containerized execution through the inherent abilities of Kubernetes.However,when encountering continuous workflow requests and unexpected resource request spikes,the engine is limited to the current workflow load information for resource allocation,which lacks the agility and predictability of resource allocation,resulting in over and underprovisioning resources.This mechanism seriously hinders workflow execution efficiency and leads to high resource waste.To overcome these drawbacks,we propose an adaptive resource allocation scheme named adaptive resource allocation scheme(ARAS)for the Kubernetes-based workflow engines.Considering potential future workflow task requests within the current task pod’s lifecycle,the ARAS uses a resource scaling strategy to allocate resources in response to high-concurrency workflow scenarios.The ARAS offers resource discovery,resource evaluation,and allocation functionalities and serves as a key component for our tailored workflow engine(KubeAdaptor).By integrating the ARAS into KubeAdaptor for workflow containerized execution,we demonstrate the practical abilities of KubeAdaptor and the advantages of our ARAS.Compared with the baseline algorithm,experimental evaluation under three distinct workflow arrival patterns shows that ARAS gains time-saving of 9.8% to 40.92% in the average total duration of all workflows,time-saving of 26.4% to 79.86% in the average duration of individual workflow,and an increase of 1% to 16% in centrol processing unit(CPU)and memory resource usage rate.
基金the National Natural Science Foundation of China(Grant No.61971057).
文摘To solve the contradiction between limited spectrum resources and increasing communication demand,this paper proposes a wireless resource allocation scheme based on the Deep Q Network(DQN)to allocate radio resources in a downlink multi-user cognitive radio(CR)network with slicing.Secondary users(SUs)are multiplexed using non-orthogonal multiple access(NOMA).The SUs use the hybrid spectrum access mode to improve the spectral efficiency(SE).Considering the demand for multiple services,the enhanced mobile broadband(eMBB)slice and ultrareliable low-latency communication(URLLC)slice were established.The proposed scheme can maximize the SE while ensuring Quality of Service(QoS)for the users.This study established a mapping relationship between resource allocation and the DQN algorithm in the CR-NOMA network.According to the signal-to-interference-plusnoise ratio(SINR)of the primary users(PUs),the proposed scheme can output the optimal channel selection and power allocation.The simulation results reveal that the proposed scheme can converge faster and obtain higher rewards compared with the Q-Learning scheme.Additionally,the proposed scheme has better SE than both the overlay and underlay only modes.
基金supported by State Grid Corporation of China Science and Technology Project“Key Technology and Application of New Multi-Mode Intelligent Network for State Grid”(5700-202024176A-0-0-00).
文摘With the continuous progress of information technique,assisted driving technology has become an effective technique to avoid traffic accidents.Due to the complex road conditions and the threat of vehicle information being attacked and tampered with,it is difficult to ensure information security.This paper uses blockchain to ensure the safety of driving information and introduces mobile edge computing technology to monitor vehicle information and road condition information in real time,calculate the appropriate speed,and plan a reasonable driving route for the driver.To solve these problems,this paper proposes a trusted edge resource allocation framework for assisted driving service,which includes two stages:the blockchain generation stage(the first stage)and assisted driving service stage(the second stage).Furthermore,in the first stage,a delay-and-throughput-oriented block generation model for the mobile terminal is designed.In the second stage,a balanced offloading algorithm for assisted driving service based on edge collaboration is proposed to solve the problems of unbalanced load of cluster mobile edge computing(MEC)servers and low resource utilization of the system.And this paper optimizes the throughput of blockchain and delay of the transportation network through deep reinforcement learning(DRL)algorithm.Finally,compared with joint computation and communication resources’allocation(JCCR)and resource allocation method based on binary offloading(RAB),our proposed scheme can optimize the delay by 7.4%and 26.7%,and support various application services of the vehicular networks more effectively.
基金supported in part by the Guangxi Natural Science Foundation under Grant 2021GXNSFBA196076in part by the General Project of Guangxi Natural Science Foundation Project(Guangdong-Guangxi Joint Fund Project)under Grant 2021GXNSFAA075031+1 种基金in part by the basic ability improvement project of young and middle-aged teachers in Guangxi Universities under Grant 2022KY0579in part by the Guangxi Key Laboratory of Precision Navigation Technology and Application,Guilin University of Electronic Technology under Grant DH202007.
文摘In this paper,we propose a low complexity spectrum resource allocation scheme cross the access points(APs)for the ultra dense networks(UDNs),in which all the APs are divided into several AP groups(APGs)and the total bandwidth is divided into several narrow band spectrum resources and each spectrum resource is allocated to APGs independently to decrease the interference among the cells.Furthermore,we investigate the joint spectrum and power allocation problem in UDNs to maximize the overall throughput.The problem is formulated as a mixed-integer nonconvex optimization(MINCP)problem which is difficult to solve in general.The joint optimization problem is decomposed into two subproblems in terms of the spectrum allocation and power allocation respectively.For the spectrum allocation,we model it as a auction problem and a combinatorial auction approach is proposed to tackle it.In addition,the DC programming method is adopted to optimize the power allocation subproblem.To decrease the signaling and computational overhead,we propose a distributed algorithm based on the Lagrangian dual method.Simulation results illustrate that the proposed algorithm can effectively improve the system throughput.
基金This work was supported in part by the Chongqing Technological Innovation and Application Development Projects under Grant cstc2019jscx-msxm1322,in part by the Zhejiang Lab under Grant 2021KF0AB03in part by the National Natural Science Foundation of China under Grant 62071091.
文摘Network slicing is envisioned as one of the key techniques to meet the extremely diversified service requirements of the Internet of Things(IoT)as it provides an enhanced user experience and elastic resource configuration.In the context of slicing enhanced IoT networks,both the Service Provider(SP)and Infrastructure Provider(InP)face challenges of ensuring efficient slice construction and high profit in dynamic environments.These challenges arise from randomly generated and departed slice requests from end-users,uncertain resource availability,and multidimensional resource allocation.Admission and resource allocation for distinct demands of slice requests are the key issues in addressing these challenges and should be handled effectively in dynamic environments.To this end,we propose an Opportunistic Admission and Resource allocation(OAR)policy to deal with the issues of random slicing requests,uncertain resource availability,and heterogeneous multi-resources.The key idea of OAR is to allow the SP to decide whether to accept slice requests immediately or defer them according to the load and price of resources.To cope with the random slice requests and uncertain resource availability,we formulated this issue as a Markov Decision Process(MDP)to obtain the optimal admission policy,with the aim of maximizing the system reward.Furthermore,the buyer-seller game theory approach was adopted to realize the optimal resource allocation,while motivating each SP and InP to maximize their rewards.Our numerical results show that the proposed OAR policy can make reasonable decisions effectively and steadily,and outperforms the baseline schemes in terms of the system reward.
文摘The number of mobile devices accessing wireless networks isskyrocketing due to the rapid advancement of sensors and wireless communicationtechnology. In the upcoming years, it is anticipated that mobile datatraffic would rise even more. The development of a new cellular networkparadigm is being driven by the Internet of Things, smart homes, and moresophisticated applications with greater data rates and latency requirements.Resources are being used up quickly due to the steady growth of smartphonedevices andmultimedia apps. Computation offloading to either several distantclouds or close mobile devices has consistently improved the performance ofmobile devices. The computation latency can also be decreased by offloadingcomputing duties to edge servers with a specific level of computing power.Device-to-device (D2D) collaboration can assist in processing small-scaleactivities that are time-sensitive in order to further reduce task delays. The taskoffloading performance is drastically reduced due to the variation of differentperformance capabilities of edge nodes. Therefore, this paper addressed thisproblem and proposed a new method for D2D communication. In thismethod, the time delay is reduced by enabling the edge nodes to exchangedata samples. Simulation results show that the proposed algorithm has betterperformance than traditional algorithm.
文摘Fog computing is an emergent and powerful computing paradigm to serve latency-sensitive applications by executing internet of things(IoT)appli-cations in the proximity of the network.Fog computing offers computational and storage services between cloud and terminal devices.However,an efficient resource allocation to execute the IoT applications in a fog environment is still challenging due to limited resource availability and low delay requirement of services.A large number of heterogeneous shareable resources makes fog computing a complex environment.In the sight of these issues,this paper has proposed an efficient levy flight firefly-based resource allocation technique.The levy flight algorithm is a metaheuristic algorithm.It offers high efficiency and success rate because of its longer step length and fast convergence rate.Thus,it treats global optimization problems more efficiently and naturally.A system framework for fog computing is presented,followed by the proposed resource allocation scheme in the fog computing environment.Experimental evaluation and comparison with the firefly algorithm(FA),particle swarm optimization(PSO),genetic algorithm(GA)and hybrid algorithm using GA and PSO(GAPSO)have been conducted to validate the effectiveness and efficiency of the proposed algorithm.Simulation results show that the proposed algorithm performs efficient resource allocation and improves the quality of service(QoS).The proposed algorithm reduces average waiting time,average execution time,average turnaround time,processing cost and energy consumption and increases resource utilization and task success rate compared to FA,GAPSO,PSO and GA.
