• <tr id="yyy80"></tr>
  • <sup id="yyy80"></sup>
  • <tfoot id="yyy80"><noscript id="yyy80"></noscript></tfoot>
  • 99热精品在线国产_美女午夜性视频免费_国产精品国产高清国产av_av欧美777_自拍偷自拍亚洲精品老妇_亚洲熟女精品中文字幕_www日本黄色视频网_国产精品野战在线观看 ?

    Fuzzy Control Based Resource Scheduling in IoT Edge Computing

    2022-08-23 02:17:32SamahAlhazmiKailashKumarandSohaAlhelaly
    Computers Materials&Continua 2022年6期

    Samah Alhazmi,Kailash Kumarand Soha Alhelaly

    College of Computing and Informatics,Saudi Electronic University,Riyadh,Kingdom of Saudi Arabia

    Abstract: Edge Computing is a new technology in Internet of Things (IoT)paradigm that allows sensitive data to be sent to disperse devices quickly and without delay.Edge is identical to Fog,except its positioning in the end devices is much nearer to end-users,making it process and respond to clients in less time.Further,it aids sensor networks,real-time streaming apps,and the IoT,all of which require high-speed and dependable internet access.For such an IoT system, Resource Scheduling Process (RSP) seems to be one of the most important tasks.This paper presents a RSP for Edge Computing(EC).The resource characteristics are first standardized and normalized.Next,for task scheduling,a Fuzzy Control based Edge Resource Scheduling(FCERS)is suggested.The results demonstrate that this technique enhances resource scheduling efficiency in EC and Quality of Service (QoS).The experimental study revealed that the suggested FCERS method in this work converges quicker than the other methods.Our method reduces the total computing cost, execution time, and energy consumption on average compared to the baseline.The ES allocates higher processing resources to each user in case of limited availability of MDs;this results in improved task execution time and a reduced total task computation cost.Additionally,the proposed FCERS m 1m may more efficiently fetch user requests to suitable resource categories,increasing user requirements.

    Keywords:IoT; edge computing; resource scheduling; task scheduling; fuzzy control

    1 Introduction

    The collection of wireless interconnected items such as mobiles,sensors,Radio-Frequency Identification (RFID) tags and others form Internet of Things (IoT).These devices can utilise a unique addressing mechanism,but they have limited computational capacity and battery power.IoT devices can create enormous data in real-time and transfer it to cloud computing data centers located far away.Despite this, there is massive traffic and significant waits.As a result, more processing power and storage resources are needed by the IoT networks.Multi-access Edge Computing (MEC) is a novel technique that addresses these needs by providing a distributed computing model for networking,task processing, and data storage at IoT network edges [1].MEC can fulfil the resource needs of IoT applications while also lowering the latency in communication.Each MEC server consists of a virtualized environment that includes a computing device,data storage and wireless communication unit.The MEC servers housed several virtual resources that could be used to service stationary IoT or Mobile Devices(MD).A single-hop wireless connection,such as 4G LTE devices,Wi-Fi,Bluetooth,and other wireless interfaces,allows an MD to interact directly with MEC servers.The internet that helps to connect the cloud infrastructure is used by the MEC Servers [2].Fig.1 shows the MEC’s architecture,including wireless connections connecting IoT devices to the MEC[3,4].

    Figure 1:MEC architecture

    End-users, objects, and sensors are closer to EC’s storage, processing, control, and networking resources.An Edge Node can be as small as a smartphone, an Access Point (AP), a Base Station(BS),or even a cloud.A smartphone links wearable gadgets to the Cloud,a home gateway connects the Cloud with MD and the MDs to the core network.Edge Computing (EC) provides several outstanding features,including location awareness,resource pooling,distributed caching,processing of data analysis, scaling of resources, increased privacy and security, and dependable connection by delivering resource flexibility and intelligence.EC is a critical component of low-latency and good reliability.[5] contain many EC advantages and various use cases (e.g., media advertising, medical,offloading,smart homes,caching,and others).

    IoT support, Network architecture design, service deployment, Resource Scheduling Process(RSP) and administration, programming models and abstractions, privacy and security, incentive design, edge device dependability, and sustainability are just a few of the additional issues that EC confronts [6,7].The topic of Edge Computing Resource Allocation (RA) is the focus of this study.Unlike cloud computing, which has essentially infinite computational capacity and high network latency owing to the restricted computation capacity of Edge Nodes(EN),EC has comparatively less network delay but significant delay in processing because of the restricted computation capacity of EN.In addition,there are many small nodes in DC,equivalent to a lesser number of big Distributed Computing(DC).ENs can also be of various sizes(for example,the number of processing elements)and configurations (e.g., computing speed), extending from an MD towards 10’s/100’s of ES.These nodes are distributed across many sites,resulting in variable network and service delays for end-users.EC systems would most likely be made up of disparate communication, processing resources and Wi-Fi devices(e.g.,devices that differ in computing capabilities,battery states,and types of computational tasks).Before adopting compute offloading paradigms,three key issues must be solved.

    (a) First,effective TS algorithms must consider the various features of computational tasks and the heterogeneity of communication and computing resources.

    (b) Second, efficient administration of heterogeneous communication resources, which will be utilized for data transmission between end users’devices and external computer resources,is required.

    (c) Finally, efficient management of heterogeneous computing resources will be necessary to complete the computational tasks offloaded by various MDs.

    These three issues must be handled simultaneously, which is a problematic undertaking in extremely diverse EC systems.

    Furthermore, Edge Servers (ES) frequently have restricted processing resources in the given deployment’s cost benefits and scalability[8].One rationale is that the number of ES is installed mainly in numbers,demanding consideration of the deployment’s financial help.As a result,a particular ES may not require the same number of resources as a CS and cannot offer them.Following that,the ES will be unable to perform all tasks.The work will have a low processing efficiency and a long processing time when every task without any distinction is delivered to the ES.As a result,it’s important to find how to offload work based on demand.The act of transferring computing work from a MD to a Cloud Server(CS)or an ES is known as offloading[9–11].EC’s fundamental and crucial issue is developing an offloading technique and offloading work to an ES,resulting in increased latency while consuming less power than local execution.As a result, MD must pick the best offloading technique for their purposes,such as balancing delays and power consumption[12,13], decreasing task processing time[14–16]and energy consumption[17,18].

    RA issues have been discovered in much previous work,and the majority of them are concerned with computing or communication of TA for ES.Some researchers looked at how MDs allocate computational resources and control transmission power [19].In reality, MD-RA and ES-RA will work together to produce an offloading strategy.As a result, the link between offloading decision creation and computing RA must be investigated.

    This paper provides a dynamic Resource Scheduling Process(RSP)based on fuzzy control theory.The following are the paper’s main contributions:

    a) An RSP for EC.

    b) A model of allocation of essential resources is created depending on consumers’long-term and ongoing resource requirements.

    c) To build the RSP based on fuzzy control theory,the RSP is carried out.The scheme splits user needs and available resources into numerous resource clusters,making it easier to process fuzzy user requirements and improving cloud computing QoS.

    The remainder of the work is structured in the following manner.The present RSP and related research efforts are discussed in Section 2.The suggested model based on fuzzy control is presented in Section 3,and a new Fuzzy Control based Edge Resource Scheduling(FCERS)is given in Section 4.The carried out experiments and findings are evaluated in Section 5.To conclude,we make a list of future research work.

    2 Related Works

    Since the concept of EC was recommended, academics have been interested in computing Task Scheduling(TS)as an essential research topic in EC.There has been a slew of similar study findings recently.The primary objective of the TS offload approach is to find if a task created by a user terminal should be offloaded and where should it be scheduled.By examining TS techniques’present research state,this part recognises the task schedule’s research direction.Aazam et al.2021[20]propose a compute migration strategy for next-generation networks.A MEC approach based on Software Defined Networking (SDN) and Network Function Virtualization (NFV) technologies, as well as multi-attribute decision making and compute migration,is also presented.The authors used MATrix LABoratory(MATLAB)to conduct their tests,demonstrating multi-attribute decision making based on SDN and NFV that could pick the right MEC center,minimize server response time,and enhance Quality of Service(QoS).

    The authors[21]sought to deal with RA on NFV-enabled MECs,to reduce mobile service latency and MEC expenses.They presented a dynamic RA technique based on operational cost, consisting of a quick incremental allocation mechanism.They demonstrated that, compared to stationary MECs,their approach could deploy resources to ensure applications’low latency needs while saving money.Pham’s approach aims to improve gateway placement and multi-hop routing in NFV-enabled IoT (NIoT) and service placement at the MEC and cloud levels.To deal with a big NIoT system and optimise routing, RA for service functions, and gateway deployment, created approximation algorithms such as Service Placements Algorithm(SPA-1 and SPA-2),Gateway Placement,and Multihop Routing Algorithm (GPMRA).According to the authors, their approximation methods can minimize computing time while achieving near-optimal outcomes.

    Literature [22–24] developed a QoS decision engine that efficiently offloads to optimize performance and delay in response to the requirement in EC for real-time optimization.The work [25]presents a game theory technique for calculating unload, explains the nature of the equilibrium distribution, establishes its presence, and calculates equilibrium using a polynomial-time dispersion approach.However, the level of difficulty is higher.A multi-user distributed online task migration system is proposed in the literature [26–28], which considers the user’s selfish traits and is centred on the optimization theory presented by Lyapunov and an incentive scheme based onpeer-to-peerfile transfer.It providesmulti-hopuser involvement and common processing activities in the delay network.The present single-hop centralised collaboration method may considerably lower system power usage and enhance system performance.

    A Task Scheduling Algorithm (TSA) by Literature [29] proposed a TS method for task and resource features, and then recommends a Genetic Algorithm (GA) firework detection mechanism and uses the concepts of explosion radius,that allow load balancing and decrease TS time.Noghani et al.[30] proposed the allotment of resources for multi-user mobile EC environments regarding the Time Division Multiple Access (TDMA) and Orthogonal Frequency Division Multiple Access(OFDMA);they solved the mixed-integer issue multi-objective optimization problem and successfully minimized the consumption of total weighted mobile energy.Yang et al.[31] introduced an energyoptimizing offloading technique with guaranteed latency for global optimization.This method uses an artificial algorithm based on a fish swarm while also looking at the interaction between the fronthaul and backhaul network states[32].

    A work classification and resource usage-based task consolidation approach for a cloud computing environment was invented in 2016[33].They also devised a method of VM aggregation to balance power usage and TS processing time.A TS method in mobile cloud resources by dynamic clustering and the improved FCM method to reduce the number of corresponding criteria in the search was proposed in 2016 by Qiang et al.[34].The experiment demonstrates that the matching strategy may be proactively modified depending on the matching value and reinforcement training.Advanced Network Credit Scheduler(ANCS),proposed by Ni et al.2017[35],is a new approach for maintaining QoS in virtualization using dynamic network allocation of resources.Proportional sharing based on weight,reserving the minimum bandwidth and restricting the maximum bandwidth limitation are among the performance standards that ANCS aims to offer at the same time to meet the demands of the diverse network and cloud users.EC provides services to MDs who are close to each other.EC allows widely dispersed edge computing clusters to share resources or cache data.Following that,we feature a panel of specialists that specialize in resource management and EC.

    The deployment of the Steiner tree to examine the resource caching technique in EC is proposed by Su et al.[36].When an EC server stores resources to decrease overall route weight,it first builds a Steiner tree;the tree helps to lower resource cache costs.The paper results demonstrate that the Steiner tree approach outperforms the shortest path strategy.A dynamic RA was proposed in 2017 by Rahbari et al.[37].Its aim is resource management while screening,preparing,and encrypting data.For this aim,in an EC environment,the study provided resource management.Many factors that lead a client to quit,such as the service type,the cost of service,and the various waiver likelihood modifications,are considered in this article.The experiment results show that with the help of these characteristics,the service provider can estimate the number of resources needed[38].

    Traditional TS tool is straightforward to use.For data sharing in the TS of multi-layer deadlineconstrained scientific procedures, few Virtual Machines (VM), which are heterogeneous in nature,are provided with remote storage services by each supplier.One of the TS techniques that optimizes cost and makespan objectives is the earliest finish time.The authors considered the cloud service as commercial infrastructure.The Pareto front is used as a decision-making tool to assess the merits and demerits of several alternatives.The TS costs were lowered in half, but the turnaround time was increased by 5%.For spot VMs and on-demand instances, a Fault-tolerant TS [39] is addressed by bidding mechanism.This technique is inefficient due to the low-priced spot VM.The authors suggested a scheduler for real-time workflow [40].Backward shifting, resource scaling up,and shrinking facilitation were three phases in their technique that improved resource use over prior baseline algorithms.

    To solve the problems,heuristic approaches employ a set of rules.Traditional heuristics include first,best,and worst fit.Fog,Cloud,and Edge providers may use heuristic approaches to run largescale applications and processes.Mtshali et al.[41]use a heuristic method with an objective function that includes the task’s makespan and execution cost to schedule the tasks.The results show that this strategy is more efficient and has a lower needed cost when compared to other approaches.Based on cluster formation,Rodrigues et al.[42]present a coalitional game for radio access networks in the Fog.To increase network throughput, it employed an approach for dispersed TS of users.Other dynamic cloud TS approaches for vehicular are based on queue length and reaction time parameters.A stochastic Petri net and OpenStack were used to schedule activities and simulate them using the Markov single server system.In order to save energy, a heuristic method is employed in Xiaojun et al.[43]to plan simultaneous real-time activities in a heterogeneous network.In this work,nonlinear programming is utilised to choose frequencies and assign threads.

    Cloud-Fog investigated the TS and suggested a solution based on heuristics for striking a compromise between maximum completion time and Cloud resource monetary costs.Kao et al.[44]examined primary TS issues in a software-defined embedded system to support fog computing.To enhance users’experience,difficulties were framed as a mixed-integer nonlinear programming problem and provided an efficient heuristic TS technique.Nath et al.[45] introduced a fog computing RA method based on Priced Timed Petri Nets(PTPN).PTPN task model was created using fog resource characteristics.In terms of efficiency, the proposed technique beats static allocation strategies.In addition,heuristic approaches were used to achieve RSP in certain studies.

    3 The Proposed Approach

    3.1 System Model

    As indicated in Fig.2, we examine a network architecture with Edge Server and Node Mobile Devices.The MDui(i∈{1,2,...,N})and the ES have a channel bandwidth ofw.Because the distance in the middle ofuiand the edge server is generally 1-hop,the propagation latency amonguiand the ES‘c’is insignificant.The MDuihas only a limited amount of energyand the network generatesMtasks that must be performed during each time slot.Therefore,for each time slott(t∈{1,2,···,T})deviceui,generates a taskj(j∈{1,2,...,M})which is represented as below,Eq.(1)

    wheredi.j,tis the task’s data volume.The task is performed locally in a heterogeneous ES that specifies the required number of CPU cycles.is the necessary number of CPU cycles.The,‘t’is the maximum execution time that may be tolerated.Si.j,trepresents the task offloading strategies.Si.j,t=1,if the task is completed locally for the taskτi,j,t;otherwise,Si.j,t=0.

    The task information and the RA scheme for local computing are communicated to the ES.Still,after every time slot,the MD produces tasks and assigns them to the computing resources available locally.Depending on the offloading policy, the task is done locally or offloaded.The offloading policy is calculated by the ES and returned to the MD.

    3.2 A User Model

    Based on the service level,the user is the one who rents cloud services and submits the tasks.The user setUi={U1,U2,...,Um},which is a service entity with six tuples as defined below,Eq.(2)

    Uidis the unique ID of the user in cloud services.

    Unameis the name of the user.

    Figure 2:Network system model

    The user is provided with a resource type given by SL(Service Level).USL provides the user with SL.SL= {TierI,TierII,TierIII},for the account of the users,these parameters are considered.Ujobsis the set of tasks submitted by the user.The data regarding the security of users are given byUsec.

    3.3 B Task Model

    Multiple tasks are carried out in parallel, and they must continually interact with one another.Each task monopolizes VM resources.To the feasible extent,it must be ensured that all tasks in the RSP execute in parallel, preventing task block and reducing operation run time.The act of sending employment applications is demonstrated in Eq.(3).

    tasktis expressed as below Eq.(4),which has 7 tuples

    The unique ID fortasktistidandttypegives the type of tasks,small and large,as shown in Eq.(5).

    tlen=|ttasks|.tlen,gives the length of tasks;

    ttasksis the set of tasks in one taskttasks={Task-1,Task-2,...Task-k}

    To run a task,the minimum set of resources required is given bytres.

    The parametertartgives the Average Response Time for a task,which is calculated by averaging the response time of each task to evaluate operation cost and performance.The time that it takes for a task is to be added to the TS queue and start running is the average wait time.

    3.4 C Resource Model

    The resources such as(services,applications,server,data store etc.,)are shared.Resource model shows Resource= {r1,r2,...,rp}, total resource numberp= |Resource,rk|,rkwhich is the eight tuples:Computing resources that are shared and adjusted are referred to as resources(e.g.,networks,applications,data center,servers and services,etc.).The resource model demonstrates the total number of resources.,rkis a 9 tuple set shown below,Eq.(6)

    where

    ridis the unique ID of the resource

    rsupplyis the provider of the resource

    rtypeis the type of the resource

    rcompis the capacity of resources to process information

    rmemis resources available memory

    rstoris the capacity of the resource storage

    riois the capacity of IO in resources

    rnetis the resource bandwidth

    rposis the geographical resource position

    3.5 Edge Computing

    The data uplink transmission rate is required when the offloading of the taskτi,j,tto the ES is chosen by the MDui,Eq.(7)

    where channel bandwidth is represented byw, the MDui’s computation energy is given aspi, wherehiandσare the network gain and noise power,respectively.The inter-channel interference is given in denominator as cumulative term.Therefore,the uplink transmission time is,Eq.(8)

    The heterogeneous ES that takes timeτi,j,tfor the task is given in Eq.(9)

    whereis the computing resource assigned to the task in the time slot‘t’fromuithe ES;computing resources are allocated regularly,much as communication resources.The overall time spent on EC is given below as,Eq.(10):

    Many expensive computation applications have a considerably lower quantity of data than the input and neglect the return time.

    4 Resource Scheduling Algorithm Design

    Initially,computer RA is done for all tasks.The offloading of all tasks cannot be considered the ultimate offloading choice owing to timeline and energy restrictions,and it is not fair to use the default offloading to allocate the computation.As a result,we present a Fuzzy Control based Edge Resource Scheduling(FCERS)approach in this part to arrive at appropriate offloading options.The first step is to apply a constraint-based filter.The new offloading technique is denoted by s′,and its initial values ares′=s.It should be noticed that one of the requirements for filtering is a time limitation.We may retrieve the entire duration of edge executionafter getting the RA resultAnd IfThen s’(i,j,t)is set to 1.Furthermore,a local computational RSP is presented with energy restrictions,even though edge computations consume less energy than local computations.As a result,s′(i,j,t)=1.

    Algorithm:1 of Constraint-Based Filtering Step 1.Input τ,s Step 2.Output s′Step 3.Begin Step 4.s′←s Step 5.While(Any_Task,τi,j,t)not_processed Do Step 6.Calculate tE i,j,t =(di,j,t ri,j,t)+(cEi,j,kfEi,t )Step 7.Calculate eE i,j,t =pitt rans i,j,t using pittransi,j,t =pi(di,j,tri,j,t)Step 8.End While Step 9.If tE i,j,t >tdeadlinei,j,t or edeadlinei,j,t >eU i,j,t Then Step 10.s′i,j,t =1 Step 11.End If Step 12.End

    User needs may be classified into several categories.The user’s demands are matched with the resources in the class after locating the suitable resource category.The resource scale in the RSP is lowered after a fair split of resources.Simple weight matching is used to complete the RSP in this article.The following is the weight matching formula,Eq.(11):

    whereREQIdenotes the attribute of the user’s demands,Rset.irepresents the resource sets,andWeightimeans the attribute weights.

    The user’s demand varies in different volumes of resources.Computing needs, bandwidth and storage requirements may be split into three categories for distinct task preferences.Each task, like resources,has three characteristics,each of which has a distinct weight.The user-required attribute and the resource attribute are combined in the formula mentioned earlier,and the highest score achieved is returned to the user as the outcome of the RSP.The following is the pseudo-code for the RSP algorithm Fuzzy Control based Edge Resource Scheduling(FCERS).

    Algorithm:2 of Fuzzy Control based Edge Resource Scheduling(FCERS)Step 1.Input:Resource Set{RSet1,RSet2,...RSetm};Task Set{TSet1,TSet2,...TSetn}n,φ,m Step 2.Output Ranking rank,similarity result S Step 3.On the resource,set Do clustering Step 4. RConRS(M,L)=User&Resource_Clusters Step 5. R(s)=Size(R)Step 6.While(Test <1)Step 7. Test=Test+1 Step 8. xj =x Step 9.Process xn Step 10. Computed tE i,j,t Step 11. l=1 Step 12.While(l <=l)Do Step 13.l=l+1 Step 14.j=j+1 Step 15.While j=<m Do Step 16.j=j+1 Step 17.Space(k,i)=Sp(Information(j,:)Step 18.End While Step 19.End While Step 20.Measure xJ Step 21.If Result(xJ-x,Data)<φ Then Step 22.Break Step 23.End If Step 24. x ←xJ Step 25.End While Step 26.Obtain Resource Clusters Step 27.Measure Rank(MS)=REQI,Rseti,ωi Step 28. MR=TotalResourece(Result(REO1-Rseti)TotalWeighti Step 29.Return Similarity Measure S Step 30.End If Step 31.End

    5 Experimental Outcomes for Fuzzy Control Based Edge Resource Scheduling

    To assess FCERS’s resource allocation efficiency, we evaluated several methods, including their distribution of resources methods.We assign tasks of varying lengths to distinct Virtual Machines(VMs).The proposed FCERS model is compared with three well-developed models presented in Tab.1 below:

    In various VM,the execution speed of the Central Processing Unit(CPU)is analyzed and given in Fig.3.It shows that the proposed FCERS algorithm performs efficient RSP among corresponding VM based on the duration of tasks.When task durations are increased, the VM’s execution speed increases.The trend is more apparent than other algorithms.Improved Genetic Algorithm for Fuzzy c-means Clustering Algorithm Method (IGAFCM) and PTPN cannot adapt fast to task duration as FCERS.Additionally, the Advanced Network Credit Scheduler (ANCS) has a limited ability to respond to task characteristics.

    Table 1: Various models for RA

    Figure 3:CPU execution speed among different VMs

    Fig.4 illustrates the time required to complete a task using various techniques,and there are five VMs.The execution speed is lower in the ANCS, and the tasks are assigned to VM in an ordered fashion, resulting in resource shortages and insufficient utilization.The task execution efficiency is higher in PTPN,and the execution time is comparatively less when ANCS is used.However,tasks are not categorized, resulting in high-configuration VMs performing trivial activities and underutilized resources.When IGAFCM is used, each processor unit optimizes the available resources based on the task duration and overall execution time,decreasing the implementation latency between various VMs.When FCERS is used, process execution time is minimized.When FCERS is used, resource availability across VMs is constantly changed in response to task demand,execution time is effectively decreased,and the processing time-interval amongst processing units is considerably minimized.

    Figure 4:Comparing task execution time for different VMs

    As seen in Fig.5, the algorithm’s overall energy consumption to accomplish all operations,including computation and transmission energy utilization,is primary since the algorithm completes tasks at the quickest.The lowest general energy usage is determined using CloudSim’s built-in energy consumption model.

    As illustrated in Fig.6, the usage of memory by the proposed FCERS algorithm is comparable to that of the IGAFCM, PTPN and ANCS algorithms, completely fulfilling the memory space constraint for EC nodes.As a result,the proposed method may be implemented without compromising performance on EC nodes.

    Figure 5:Total task energy consumption

    Figure 6:Memory usage

    For Figs.7–9, we consider alternative combinations of offloading strategies and their impacts on overall computation cost, time consumption, and energy consumption, all of which vary by the number of MDs used.

    Figure 7:Total computation cost against increase in users

    Figure 8:Time consumption against increase in users

    Figure 9:Energy consumption against number of users

    To demonstrate, we evaluated two baselines.Our method reduces the total computing cost,execution time,and energy consumption on average compared to the baseline.The ES allocates higher processing resources to each user in case of limited availability of MDs;this results in improved task execution time and a reduced total task computation cost.As for EC, the energy consumption is ordered a few times or ten times that of local execution,which results in additional total computation costs.

    6 Conclusion and Future Work

    The purpose of this paper was to investigate the resource scheduling challenges in fog computing.First,we grouped the fog resources,which significantly reduces the range of user needs for resource matching.Additionally,we propose the Fuzzy Control based Edge Resource Scheduling algorithm for resource allocation.Finally,an experimental study revealed that the suggested FCERS method in this work converges quicker than the other methods.Additionally,the proposed FCERS algorithm may more efficiently fetch user requests to suitable resource categories,increasing user requirements.

    In future studies,we will address dynamic resource changes and offer a novel RSP for optimizing resource use and ensuring user requirements.

    Funding Statement:The authors received no specific funding for this study.

    Conflicts of Interest:The authors declare that they have no conflicts of interest to report regarding the present study.

    成人永久免费在线观看视频| 久久人人爽人人片av| АⅤ资源中文在线天堂| 一区二区三区免费毛片| 成人二区视频| 日韩欧美在线乱码| 国内少妇人妻偷人精品xxx网站| 久久婷婷人人爽人人干人人爱| 我要搜黄色片| 国产中年淑女户外野战色| 国产日韩欧美在线精品| 夫妻性生交免费视频一级片| 3wmmmm亚洲av在线观看| 黄色视频,在线免费观看| 成人性生交大片免费视频hd| 99热精品在线国产| 日本-黄色视频高清免费观看| 久久精品国产亚洲av香蕉五月| 精品免费久久久久久久清纯| 老司机影院成人| 美女高潮的动态| 久久久久网色| 免费观看的影片在线观看| 日韩亚洲欧美综合| videossex国产| 禁无遮挡网站| 桃色一区二区三区在线观看| 亚洲在久久综合| 99国产极品粉嫩在线观看| 国产男人的电影天堂91| 成人性生交大片免费视频hd| 黄色欧美视频在线观看| 久久久久久九九精品二区国产| 免费不卡的大黄色大毛片视频在线观看 | 青春草国产在线视频 | 国产蜜桃级精品一区二区三区| 国产黄色小视频在线观看| 最近的中文字幕免费完整| 国产精品野战在线观看| 亚洲激情五月婷婷啪啪| 久久久久久国产a免费观看| 男人和女人高潮做爰伦理| 乱码一卡2卡4卡精品| 国产精品1区2区在线观看.| 男人舔女人下体高潮全视频| 校园人妻丝袜中文字幕| 别揉我奶头 嗯啊视频| 国产精品乱码一区二三区的特点| 97人妻精品一区二区三区麻豆| 亚洲国产欧美人成| 亚洲国产精品成人久久小说 | 午夜福利高清视频| 国产精品福利在线免费观看| 亚洲精品乱码久久久久久按摩| 此物有八面人人有两片| 网址你懂的国产日韩在线| 免费无遮挡裸体视频| 不卡视频在线观看欧美| 婷婷精品国产亚洲av| 小说图片视频综合网站| 12—13女人毛片做爰片一| av天堂在线播放| 99在线人妻在线中文字幕| 国产淫片久久久久久久久| 黄色欧美视频在线观看| av天堂在线播放| 我要看日韩黄色一级片| 特大巨黑吊av在线直播| 三级男女做爰猛烈吃奶摸视频| 婷婷六月久久综合丁香| а√天堂www在线а√下载| 国产精品伦人一区二区| 亚洲国产精品合色在线| 美女国产视频在线观看| 午夜精品在线福利| 国产精品蜜桃在线观看 | 免费观看精品视频网站| 欧美一级a爱片免费观看看| 午夜久久久久精精品| 99热这里只有是精品50| 国产亚洲av片在线观看秒播厂 | 国产伦一二天堂av在线观看| 免费一级毛片在线播放高清视频| 日韩在线高清观看一区二区三区| 国产综合懂色| 天堂网av新在线| 日韩一区二区视频免费看| 日韩欧美国产在线观看| 亚洲人成网站高清观看| 黄色一级大片看看| 只有这里有精品99| 亚洲内射少妇av| 亚洲欧美日韩卡通动漫| 高清毛片免费观看视频网站| 国产成年人精品一区二区| 国产蜜桃级精品一区二区三区| 男女边吃奶边做爰视频| 91在线精品国自产拍蜜月| 亚洲欧美清纯卡通| 国产精品一二三区在线看| 欧美高清性xxxxhd video| 一本久久中文字幕| 亚洲无线在线观看| 插阴视频在线观看视频| 91精品国产九色| 人妻久久中文字幕网| 亚洲国产精品国产精品| 欧美人与善性xxx| 亚洲精品乱码久久久久久按摩| 久久99热这里只有精品18| 国产亚洲91精品色在线| 狂野欧美激情性xxxx在线观看| 亚洲精品影视一区二区三区av| 亚洲最大成人手机在线| 女人被狂操c到高潮| 久久久久久久亚洲中文字幕| 白带黄色成豆腐渣| 亚洲真实伦在线观看| 中文字幕熟女人妻在线| 亚洲av一区综合| 能在线免费观看的黄片| 国产精品久久久久久久久免| 国产成人午夜福利电影在线观看| 夜夜看夜夜爽夜夜摸| 久久欧美精品欧美久久欧美| 久久欧美精品欧美久久欧美| 美女黄网站色视频| 久久久久久国产a免费观看| 亚洲高清免费不卡视频| 欧美xxxx性猛交bbbb| 欧洲精品卡2卡3卡4卡5卡区| 两性午夜刺激爽爽歪歪视频在线观看| 国产免费一级a男人的天堂| av免费观看日本| 国产高清激情床上av| 嫩草影院入口| 啦啦啦啦在线视频资源| 黄色欧美视频在线观看| 99久久九九国产精品国产免费| 日韩精品青青久久久久久| 精品久久久久久久久亚洲| 亚洲av免费在线观看| 一边摸一边抽搐一进一小说| 国产成人aa在线观看| 中文字幕制服av| 人妻久久中文字幕网| 国产精品一区二区三区四区久久| 午夜亚洲福利在线播放| 男人和女人高潮做爰伦理| 99热全是精品| 极品教师在线视频| 久久草成人影院| 内地一区二区视频在线| 91精品一卡2卡3卡4卡| 在线播放无遮挡| 日韩欧美在线乱码| 你懂的网址亚洲精品在线观看 | 寂寞人妻少妇视频99o| 久久国产乱子免费精品| 五月玫瑰六月丁香| 美女cb高潮喷水在线观看| 色视频www国产| 日本在线视频免费播放| 伦精品一区二区三区| 亚洲av中文av极速乱| 久久精品影院6| videossex国产| 嘟嘟电影网在线观看| 国产又黄又爽又无遮挡在线| 午夜精品一区二区三区免费看| 内地一区二区视频在线| 久久午夜福利片| 在线观看午夜福利视频| 欧美成人a在线观看| 日本熟妇午夜| 久久精品91蜜桃| 国产精品久久久久久精品电影| 国产精品女同一区二区软件| 欧美丝袜亚洲另类| 精品久久久噜噜| 人妻夜夜爽99麻豆av| 国产亚洲91精品色在线| av免费在线看不卡| 亚洲美女视频黄频| 欧美成人一区二区免费高清观看| 又黄又爽又刺激的免费视频.| 免费观看精品视频网站| 91久久精品电影网| 男人舔女人下体高潮全视频| 日本爱情动作片www.在线观看| 天天躁日日操中文字幕| 秋霞在线观看毛片| 久久草成人影院| АⅤ资源中文在线天堂| 变态另类丝袜制服| av在线播放精品| 99久国产av精品国产电影| 在线免费十八禁| 夜夜夜夜夜久久久久| 国产又黄又爽又无遮挡在线| 黄色配什么色好看| 夜夜看夜夜爽夜夜摸| 狠狠狠狠99中文字幕| 久久精品综合一区二区三区| 亚洲国产色片| 欧美一级a爱片免费观看看| 一个人看视频在线观看www免费| 全区人妻精品视频| 亚洲精品日韩在线中文字幕 | 日本av手机在线免费观看| 夜夜夜夜夜久久久久| 日日摸夜夜添夜夜添av毛片| 国产极品天堂在线| 又粗又硬又长又爽又黄的视频 | 国产精品不卡视频一区二区| 亚洲人成网站在线播放欧美日韩| www日本黄色视频网| 午夜亚洲福利在线播放| 亚洲精品国产av成人精品| 校园春色视频在线观看| 国产色婷婷99| 精品不卡国产一区二区三区| av免费在线看不卡| 乱系列少妇在线播放| 可以在线观看毛片的网站| 男女啪啪激烈高潮av片| 哪里可以看免费的av片| 超碰av人人做人人爽久久| 国产成人aa在线观看| 亚洲无线观看免费| 91aial.com中文字幕在线观看| 综合色av麻豆| 又爽又黄无遮挡网站| 一个人看的www免费观看视频| 中文字幕av成人在线电影| 免费大片18禁| 亚洲人成网站在线播| 中文亚洲av片在线观看爽| 国产精品久久久久久精品电影| 亚洲精品久久国产高清桃花| 国产91av在线免费观看| .国产精品久久| 波多野结衣高清作品| 中文字幕精品亚洲无线码一区| kizo精华| 美女大奶头视频| 99国产精品一区二区蜜桃av| 草草在线视频免费看| 美女cb高潮喷水在线观看| 天堂网av新在线| 99久久久亚洲精品蜜臀av| 床上黄色一级片| 久久人人爽人人片av| 国产色婷婷99| 夜夜看夜夜爽夜夜摸| av又黄又爽大尺度在线免费看 | 欧美极品一区二区三区四区| 日韩,欧美,国产一区二区三区 | 午夜福利在线观看吧| a级毛色黄片| 国产在线男女| h日本视频在线播放| 久久久成人免费电影| 久久久久久久久久黄片| 亚洲三级黄色毛片| 久久欧美精品欧美久久欧美| 一级毛片久久久久久久久女| 亚洲第一电影网av| 99久久九九国产精品国产免费| 在线观看一区二区三区| 亚洲高清免费不卡视频| 美女被艹到高潮喷水动态| 少妇人妻一区二区三区视频| 久久久久九九精品影院| 国产色爽女视频免费观看| 国产三级中文精品| 深爱激情五月婷婷| 99热这里只有精品一区| 久久精品91蜜桃| 亚洲内射少妇av| 亚洲美女搞黄在线观看| 亚洲中文字幕日韩| 国产视频首页在线观看| 亚洲图色成人| 亚洲精品亚洲一区二区| 国产精品久久久久久av不卡| 99久久精品一区二区三区| 婷婷六月久久综合丁香| 在线免费十八禁| 成人高潮视频无遮挡免费网站| 国内少妇人妻偷人精品xxx网站| 丝袜美腿在线中文| 欧美潮喷喷水| 久久亚洲精品不卡| 能在线免费观看的黄片| 一级黄色大片毛片| 一级二级三级毛片免费看| 色尼玛亚洲综合影院| 男的添女的下面高潮视频| 亚洲欧美日韩卡通动漫| 午夜视频国产福利| 成人三级黄色视频| 麻豆成人午夜福利视频| 色综合色国产| or卡值多少钱| 亚洲国产精品久久男人天堂| ponron亚洲| 欧美性猛交╳xxx乱大交人| 国产精品久久电影中文字幕| 永久网站在线| 亚洲欧洲日产国产| 熟女电影av网| 免费av毛片视频| 国产淫片久久久久久久久| 久久精品国产亚洲av涩爱 | 能在线免费看毛片的网站| 日本在线视频免费播放| 成人特级黄色片久久久久久久| 99热只有精品国产| 久久久久九九精品影院| 国产又黄又爽又无遮挡在线| 22中文网久久字幕| 乱人视频在线观看| 女人被狂操c到高潮| 亚洲最大成人中文| 婷婷色综合大香蕉| 一级毛片我不卡| 国产成人精品一,二区 | 寂寞人妻少妇视频99o| 舔av片在线| 99久久成人亚洲精品观看| 久久久午夜欧美精品| 午夜老司机福利剧场| 日韩欧美在线乱码| 91麻豆精品激情在线观看国产| 国产成人aa在线观看| 欧美+日韩+精品| 亚洲av男天堂| 亚洲欧美中文字幕日韩二区| 欧美激情久久久久久爽电影| 欧美bdsm另类| 99在线视频只有这里精品首页| 国产伦理片在线播放av一区 | 久久99蜜桃精品久久| 我要看日韩黄色一级片| 三级毛片av免费| 国产成人一区二区在线| 亚洲av.av天堂| 一进一出抽搐动态| 搞女人的毛片| 成人国产麻豆网| 男人和女人高潮做爰伦理| 欧美变态另类bdsm刘玥| 成人三级黄色视频| 久久韩国三级中文字幕| 国产单亲对白刺激| 精品少妇黑人巨大在线播放 | 插阴视频在线观看视频| 性插视频无遮挡在线免费观看| 成人av在线播放网站| 亚洲av第一区精品v没综合| 午夜激情福利司机影院| 全区人妻精品视频| 舔av片在线| 亚洲成a人片在线一区二区| 一个人看的www免费观看视频| 色吧在线观看| 夜夜爽天天搞| 看片在线看免费视频| 3wmmmm亚洲av在线观看| 一本一本综合久久| 国产高清三级在线| 国产一区二区在线观看日韩| 午夜激情欧美在线| 在线天堂最新版资源| 91在线精品国自产拍蜜月| 青春草视频在线免费观看| 五月玫瑰六月丁香| 99久久精品一区二区三区| 国国产精品蜜臀av免费| 亚洲成av人片在线播放无| av在线天堂中文字幕| 国产又黄又爽又无遮挡在线| 国产国拍精品亚洲av在线观看| 联通29元200g的流量卡| 国产精品一区二区三区四区久久| 久99久视频精品免费| 成年版毛片免费区| 边亲边吃奶的免费视频| 欧美性猛交黑人性爽| 久久精品国产99精品国产亚洲性色| 白带黄色成豆腐渣| 自拍偷自拍亚洲精品老妇| 久久久久久久午夜电影| 麻豆国产av国片精品| 色综合色国产| 久久精品国产清高在天天线| 国产中年淑女户外野战色| 中国美白少妇内射xxxbb| 日日撸夜夜添| 狂野欧美白嫩少妇大欣赏| 国产精品1区2区在线观看.| 全区人妻精品视频| 国产精品精品国产色婷婷| 成人无遮挡网站| 欧美日韩乱码在线| 亚洲国产色片| 国产大屁股一区二区在线视频| 久久国产乱子免费精品| 国产精品爽爽va在线观看网站| 高清毛片免费观看视频网站| 99久久人妻综合| 日本黄色视频三级网站网址| 男人舔女人下体高潮全视频| 欧美日韩综合久久久久久| 男的添女的下面高潮视频| 99热只有精品国产| 久久人人爽人人片av| 国产伦理片在线播放av一区 | 悠悠久久av| 我的女老师完整版在线观看| 国产视频内射| 少妇高潮的动态图| 偷拍熟女少妇极品色| 别揉我奶头 嗯啊视频| 国产精品福利在线免费观看| 热99re8久久精品国产| a级一级毛片免费在线观看| 亚洲av成人av| 亚洲欧美精品综合久久99| 天堂中文最新版在线下载 | 男人狂女人下面高潮的视频| 亚洲人成网站在线播放欧美日韩| 长腿黑丝高跟| 精品日产1卡2卡| 在线a可以看的网站| 亚洲精品国产成人久久av| 国产精品久久久久久精品电影小说 | 欧美一级a爱片免费观看看| 蜜桃亚洲精品一区二区三区| 搡女人真爽免费视频火全软件| 一个人免费在线观看电影| 亚洲欧美日韩东京热| 欧美成人一区二区免费高清观看| 99久久九九国产精品国产免费| 性色avwww在线观看| 国产女主播在线喷水免费视频网站 | 高清在线视频一区二区三区 | 老熟妇乱子伦视频在线观看| 一本久久中文字幕| 少妇熟女aⅴ在线视频| 亚洲aⅴ乱码一区二区在线播放| 亚洲人成网站在线播放欧美日韩| 一进一出抽搐动态| 欧美精品一区二区大全| 亚洲成a人片在线一区二区| 久久精品国产自在天天线| 国产精华一区二区三区| 欧美一区二区精品小视频在线| 精品无人区乱码1区二区| 精华霜和精华液先用哪个| 精品人妻一区二区三区麻豆| 哪里可以看免费的av片| 国产免费男女视频| 国产成人精品婷婷| 国产免费男女视频| 最近手机中文字幕大全| 精品人妻偷拍中文字幕| 好男人在线观看高清免费视频| 99国产极品粉嫩在线观看| 中出人妻视频一区二区| 亚洲成人久久性| 国产片特级美女逼逼视频| 日本成人三级电影网站| 草草在线视频免费看| 亚洲av二区三区四区| 国产伦理片在线播放av一区 | 永久网站在线| 少妇猛男粗大的猛烈进出视频 | 18禁裸乳无遮挡免费网站照片| 亚洲不卡免费看| 美女大奶头视频| 久久精品国产亚洲网站| 内射极品少妇av片p| 久久人人爽人人爽人人片va| 简卡轻食公司| 日韩精品青青久久久久久| 毛片一级片免费看久久久久| 国产色婷婷99| 久久久久久伊人网av| 夜夜夜夜夜久久久久| 人人妻人人澡欧美一区二区| 熟女人妻精品中文字幕| 久久久久久久久久久免费av| 免费观看人在逋| 国产成人精品一,二区 | 亚洲国产精品久久男人天堂| 国产国拍精品亚洲av在线观看| 久久久久久久久久成人| 日韩高清综合在线| 欧美+亚洲+日韩+国产| 中文字幕免费在线视频6| 又粗又硬又长又爽又黄的视频 | 中文字幕av成人在线电影| 女的被弄到高潮叫床怎么办| 亚洲欧美日韩无卡精品| 亚洲av成人精品一区久久| 最近视频中文字幕2019在线8| 欧美日韩国产亚洲二区| 我要搜黄色片| 中文亚洲av片在线观看爽| 99热全是精品| 亚洲精品久久久久久婷婷小说 | 亚州av有码| 亚洲成av人片在线播放无| 国产精品久久视频播放| 亚洲人成网站在线观看播放| 亚洲欧美日韩卡通动漫| 日韩欧美 国产精品| 久久6这里有精品| 国产女主播在线喷水免费视频网站 | 国内少妇人妻偷人精品xxx网站| 岛国在线免费视频观看| 不卡一级毛片| 晚上一个人看的免费电影| 欧美精品国产亚洲| 少妇的逼水好多| 美女内射精品一级片tv| 久久久午夜欧美精品| 午夜爱爱视频在线播放| 亚洲欧洲国产日韩| 啦啦啦韩国在线观看视频| 深爱激情五月婷婷| 欧美人与善性xxx| 久久国内精品自在自线图片| 亚洲精品日韩在线中文字幕 | 亚洲欧美精品自产自拍| 亚洲一区高清亚洲精品| 国产精品一区二区三区四区久久| 女的被弄到高潮叫床怎么办| 日韩精品有码人妻一区| 亚洲人成网站在线观看播放| 亚洲精品久久国产高清桃花| av在线老鸭窝| 超碰av人人做人人爽久久| 亚洲电影在线观看av| 亚洲欧美日韩卡通动漫| 在线观看av片永久免费下载| 亚洲第一电影网av| av国产免费在线观看| 校园春色视频在线观看| 久久精品综合一区二区三区| 国产高清不卡午夜福利| 麻豆av噜噜一区二区三区| 国产成年人精品一区二区| 日韩国内少妇激情av| 在线免费十八禁| 搡女人真爽免费视频火全软件| 久久久欧美国产精品| 亚洲va在线va天堂va国产| 国产午夜精品久久久久久一区二区三区| 欧美一级a爱片免费观看看| 深爱激情五月婷婷| 身体一侧抽搐| 成人二区视频| 亚洲熟妇中文字幕五十中出| 少妇高潮的动态图| 非洲黑人性xxxx精品又粗又长| 91麻豆精品激情在线观看国产| 欧美+日韩+精品| 国产淫片久久久久久久久| 一区福利在线观看| 看片在线看免费视频| 成人无遮挡网站| 91aial.com中文字幕在线观看| 日韩视频在线欧美| 国产成人a∨麻豆精品| 91午夜精品亚洲一区二区三区| 国产在视频线在精品| 日本免费a在线| 亚洲成人久久性| 亚洲图色成人| 免费大片18禁| 国产高潮美女av| 一卡2卡三卡四卡精品乱码亚洲| a级毛片免费高清观看在线播放| 熟女电影av网| 女的被弄到高潮叫床怎么办| 亚洲无线在线观看| 久久精品91蜜桃| 校园春色视频在线观看| 中文字幕熟女人妻在线| 欧美日韩一区二区视频在线观看视频在线 | 又爽又黄a免费视频| 免费观看人在逋| ponron亚洲| 校园春色视频在线观看| 久久久精品欧美日韩精品| 国产精品久久久久久久电影| 人妻久久中文字幕网| 中文字幕熟女人妻在线| 色哟哟哟哟哟哟| 色尼玛亚洲综合影院| 久久久久久久午夜电影| 亚洲国产高清在线一区二区三| 成人亚洲精品av一区二区| 久久精品综合一区二区三区| 成人特级黄色片久久久久久久| 午夜精品国产一区二区电影 | 亚洲av中文字字幕乱码综合| 18禁裸乳无遮挡免费网站照片| www日本黄色视频网| 免费av观看视频| av卡一久久| 亚洲精品乱码久久久久久按摩|