Energy storage systems(ESSs)operate as independent market participants and collaborate with photovoltaic(PV)generation units to enhance the flexible power supply capabilities of PV units.However,the dynamic variations...Energy storage systems(ESSs)operate as independent market participants and collaborate with photovoltaic(PV)generation units to enhance the flexible power supply capabilities of PV units.However,the dynamic variations in the profitability of ESSs in the electricity market are yet to be fully understood.This study introduces a dual-timescale dynamics model that integrates a spot market clearing(SMC)model into a system dynamics(SD)model to investigate the profit-aware capacity growth of ESSs and compares the profitability of independent energy storage systems(IESSs)with that of an ESS integrated within a PV(PV-ESS).Furthermore,this study aims to ascertain the optimal allocation of the PV-ESS.First,SD and SMC models were set up.Second,the SMC model simulated on an hourly timescale was incorporated into the SD model as a subsystem,a dual-timescale model was constructed.Finally,a development simulation and profitability analysis was conducted from 2022 to 2040 to reveal the dynamic optimal range of PV-ESS allocation.Additionally,negative electricity prices were considered during clearing processes.The simulation results revealed differences in profitability and capacity growth between IESS and PV-ESS,helping grid investors and policymakers to determine the boundaries of ESSs and dynamic optimal allocation of PV-ESSs.展开更多
Cloud computing distributes task-parallel among the various resources.Applications with self-service supported and on-demand service have rapid growth.For these applications,cloud computing allocates the resources dyn...Cloud computing distributes task-parallel among the various resources.Applications with self-service supported and on-demand service have rapid growth.For these applications,cloud computing allocates the resources dynami-cally via the internet according to user requirements.Proper resource allocation is vital for fulfilling user requirements.In contrast,improper resource allocations result to load imbalance,which leads to severe service issues.The cloud resources implement internet-connected devices using the protocols for storing,communi-cating,and computations.The extensive needs and lack of optimal resource allo-cating scheme make cloud computing more complex.This paper proposes an NMDS(Network Manager based Dynamic Scheduling)for achieving a prominent resource allocation scheme for the users.The proposed system mainly focuses on dimensionality problems,where the conventional methods fail to address them.The proposed system introduced three–threshold mode of task based on its size STT,MTT,LTT(small,medium,large task thresholding).Along with it,task mer-ging enables minimum energy consumption and response time.The proposed NMDS is compared with the existing Energy-efficient Dynamic Scheduling scheme(EDS)and Decentralized Virtual Machine Migration(DVM).With a Network Manager-based Dynamic Scheduling,the proposed model achieves excellence in resource allocation compared to the other existing models.The obtained results shows the proposed system effectively allocate the resources and achieves about 94%of energy efficient than the other models.The evaluation metrics taken for comparison are energy consumption,mean response time,percentage of resource utilization,and migration.展开更多
Shared manufacturing is recognized as a new point-to-point manufac-turing mode in the digital era.Shared manufacturing is referred to as a new man-ufacturing mode to realize the dynamic allocation of manufacturing tas...Shared manufacturing is recognized as a new point-to-point manufac-turing mode in the digital era.Shared manufacturing is referred to as a new man-ufacturing mode to realize the dynamic allocation of manufacturing tasks and resources.Compared with the traditional mode,shared manufacturing offers more abundant manufacturing resources and flexible configuration options.This paper proposes a model based on the description of the dynamic allocation of tasks and resources in the shared manufacturing environment,and the characteristics of shared manufacturing resource allocation.The execution of manufacturing tasks,in which candidate manufacturing resources enter or exit at various time nodes,enables the dynamic allocation of manufacturing tasks and resources.Then non-dominated sorting genetic algorithm(NSGA-II)and multi-objective particle swarm optimization(MOPSO)algorithms are designed to solve the model.The optimal parameter settings for the NSGA-II and MOPSO algorithms have been obtained according to the experiments with various population sizes and iteration numbers.In addition,the proposed model’s efficiency,which considers the entries and exits of manufacturing resources in the shared manufacturing environment,is further demonstrated by the overlap between the outputs of the NSGA-II and MOPSO algorithms for optimal resource allocation.展开更多
Non-orthogonal multiple access(NOMA)represents the latest addition to the array of multiple access techniques,enabling simultaneous servicing of multiple users within a singular resource block in terms of time,frequen...Non-orthogonal multiple access(NOMA)represents the latest addition to the array of multiple access techniques,enabling simultaneous servicing of multiple users within a singular resource block in terms of time,frequency,and code.A typical NOMA configuration comprises a base station along with proximate and distant users.The proximity users experience more favorable channel conditions in contrast to distant users,resulting in a compromised performance for the latter due to the less favorable channel conditions.When cooperative communication is integrated with NOMA,the overall system performance,including spectral efficiency and capacity,is further elevated.This study introduces a cooperative NOMA setup in the downlink,involving three users,and employs dynamic power allocation(DPA).Within this framework,User 2 acts as a relay,functioning under the decode-and-forward protocol,forwarding signals to both User 1 and User 3.This arrangement aims to bolster the performance of the user positioned farthest from the base station,who is adversely affected by weaker channel conditions.Theoretical and simulation outcomes reveal enhancements within the system’s performance.展开更多
To meet the communication services with diverse requirements,dynamic resource allocation has shown increasing importance.In this paper,we consider the multi-slot and multi-user resource allocation(MSMU-RA)in a downlin...To meet the communication services with diverse requirements,dynamic resource allocation has shown increasing importance.In this paper,we consider the multi-slot and multi-user resource allocation(MSMU-RA)in a downlink cellular scenario with the aim of maximizing system spectral efficiency while guaranteeing user fairness.We first model the MSMURA problem as a dual-sequence decision-making process,and then solve it by a novel Transformerbased deep reinforcement learning(TDRL)approach.Specifically,the proposed TDRL approach can be achieved based on two aspects:1)To adapt to the dynamic wireless environment,the proximal policy optimization(PPO)algorithm is used to optimize the multi-slot RA strategy.2)To avoid co-channel interference,the Transformer-based PPO algorithm is presented to obtain the optimal multi-user RA scheme by exploring the mapping between user sequence and resource sequence.Experimental results show that:i)the proposed approach outperforms both the traditional and DRL methods in spectral efficiency and user fairness,ii)the proposed algorithm is superior to DRL approaches in terms of convergence speed and generalization performance.展开更多
This paper presents a novel model for dynamic bandwidth allocation and rate coordination based on DiffServ and a bandwidth broker(BB). In this model, assignment of bandwidth was made according to a periodic trace of...This paper presents a novel model for dynamic bandwidth allocation and rate coordination based on DiffServ and a bandwidth broker(BB). In this model, assignment of bandwidth was made according to a periodic trace of network characteristics per application. And adjustment of transfer rate was accomplished through negotiation with applications by a bandwidth agent. This model was evaluated using network simulator 2 (NS-2), and distinct improvements were found in respects of delay and packet loss of overall network and single flow. Finally, the model was suggested to be leveraged to multimedia applications with properties of lower delay and lower packet loss.展开更多
With the explosive growth of highspeed wireless data demand and the number of mobile devices, fog radio access networks(F-RAN) with multi-layer network structure becomes a hot topic in recent research. Meanwhile, due ...With the explosive growth of highspeed wireless data demand and the number of mobile devices, fog radio access networks(F-RAN) with multi-layer network structure becomes a hot topic in recent research. Meanwhile, due to the rapid growth of mobile communication traffic, high cost and the scarcity of wireless resources, it is especially important to develop an efficient radio resource management mechanism. In this paper, we focus on the shortcomings of resource waste, and we consider the actual situation of base station dynamic coverage and user requirements. We propose a spectrum pricing and allocation scheme based on Stackelberg game model under F-RAN framework, realizing the allocation of resource on demand. This scheme studies the double game between the users and the operators, as well as between the traditional operators and the virtual operators, maximizing the profits of the operators. At the same time, spectrum reuse technology is adopted to improve the utilization of network resource. By analyzing the simulation results, it is verified that our proposed scheme can not only avoid resource waste, but also effectively improve the operator's revenue efficiency and overall network resource utilization.展开更多
A stochastic resource allocation model, based on the principles of Markov decision processes(MDPs), is proposed in this paper. In particular, a general-purpose framework is developed, which takes into account resource...A stochastic resource allocation model, based on the principles of Markov decision processes(MDPs), is proposed in this paper. In particular, a general-purpose framework is developed, which takes into account resource requests for both instant and future needs. The considered framework can handle two types of reservations(i.e., specified and unspecified time interval reservation requests), and implement an overbooking business strategy to further increase business revenues. The resulting dynamic pricing problems can be regarded as sequential decision-making problems under uncertainty, which is solved by means of stochastic dynamic programming(DP) based algorithms. In this regard, Bellman’s backward principle of optimality is exploited in order to provide all the implementation mechanisms for the proposed reservation pricing algorithm. The curse of dimensionality, as the inevitable issue of the DP both for instant resource requests and future resource reservations,occurs. In particular, an approximate dynamic programming(ADP) technique based on linear function approximations is applied to solve such scalability issues. Several examples are provided to show the effectiveness of the proposed approach.展开更多
Mobile Edge Computing(MEC)has been envisioned as an efficient solution to provide computation-intensive yet latency-sensitive services for wireless devices.In this paper,we investigate the optimal dynamic spectrum all...Mobile Edge Computing(MEC)has been envisioned as an efficient solution to provide computation-intensive yet latency-sensitive services for wireless devices.In this paper,we investigate the optimal dynamic spectrum allocation-assisted multiuser computation offloading in MEC for overall latency minimization.Specifically,we first focus on a static multiuser computation offloading scenario and jointly optimize users'offloading decisions,transmission durations,and Edge Servers'(ESs)resource allocations.Owing to the nonconvexity of our joint optimization problem,we identify its layered structure and decompose it into two problems:a subproblem and a top problem.For the subproblem,we propose a bisection search-based algorithm to efficiently find the optimal users'offloading decisions and ESs’resource allocations under a given transmission duration.Second,we use a linear search-based algorithm for solving the top problem to obtain the optimal transmission duration based on the result of the subproblem.Further,after solving the static scenario,we consider a dynamic scenario of multiuser computation offloading with time-varying channels and workload.To efficiently address this dynamic scenario,we propose a deep reinforcement learning-based online algorithm to determine the near-optimal transmission duration in a real-time manner.Numerical results are provided to validate our proposed algorithms for minimizing the overall latency in both static and dynamic offloading scenarios.We also demonstrate the advantages of our proposed algorithms compared to the conventional multiuser computation offloading schemes.展开更多
To improve and optimize the bandwidth utilization for multi-service packet transporting system, a kind of Dynamic Full Bandwidth Utilized (DFBU) allocation algorithm allowing a single link to use far beyond its fair...To improve and optimize the bandwidth utilization for multi-service packet transporting system, a kind of Dynamic Full Bandwidth Utilized (DFBU) allocation algorithm allowing a single link to use far beyond its fair share bandwidth is presented. Three important parameters as the bound on max and minimum bandwidth, the maximum packet delay and the minimum bandwidth utilization are discussed and analyzed. Results of experiments show that the DFBU-algorithm is capable of making a single link in the system use all the spare bandwidth (up to full-bandwidth) while the performance of fairness and QoS requirement is still guaranteed.展开更多
In this paper,accelerated saddle point dynamics is proposed for distributed resource allocation over a multi-agent network,which enables a hyper-exponential convergence rate.Specifically,an inertial fast-slow dynamica...In this paper,accelerated saddle point dynamics is proposed for distributed resource allocation over a multi-agent network,which enables a hyper-exponential convergence rate.Specifically,an inertial fast-slow dynamical system with vanishing damping is introduced,based on which the distributed saddle point algorithm is designed.The dual variables are updated in two time scales,i.e.,the fast manifold and the slow manifold.In the fast manifold,the consensus of the Lagrangian multipliers and the tracking of the constraints are pursued by the consensus protocol.In the slow manifold,the updating of the Lagrangian multipliers is accelerated by inertial terms.Hyper-exponential stability is defined to characterize a faster convergence of our proposed algorithm in comparison with conventional primal-dual algorithms for distributed resource allocation.The simulation of the application in the energy dispatch problem verifies the result,which demonstrates the fast convergence of the proposed saddle point dynamics.展开更多
A realistic population density distribution scenario in conjunction with the spatial dynamic spectrum allocation (DSA) is taken into account to mitigate the spectrum wastage in terms of extra guard bands. For the in...A realistic population density distribution scenario in conjunction with the spatial dynamic spectrum allocation (DSA) is taken into account to mitigate the spectrum wastage in terms of extra guard bands. For the insertion of the extra guard bands, an efficient strategy based on self-assessment is applied to each victim cell individually and independently. Consequently, it is no more required to spread the extra guard band over the whole DSA region. Simulation results StlOW an improvement of 3% -4% in percentage of satisfied users for Universal Mobile Telecommunications System (UMTS) network and 4%-5% for Digital Video Broadcasting Terrestrial (DVB-T) network.展开更多
The goal of delivering high-quality service has spurred research of 6G satellite communication networks.The limited resource-allocation problem has been addressed by next-generation satellite communication networks,es...The goal of delivering high-quality service has spurred research of 6G satellite communication networks.The limited resource-allocation problem has been addressed by next-generation satellite communication networks,especially multilayer networks with multiple low-Earth-orbit(LEO)and nonlow-Earth-orbit(NLEO)satellites.In this study,the resource-allocation problem of a multilayer satellite network consisting of one NLEO and multiple LEO satellites is solved.The NLEO satellite is the authorized user of spectrum resources and the LEO satellites are unauthorized users.The resource allocation and dynamic pricing problems are combined,and a dynamic gamebased resource pricing and allocation model is proposed to maximize the market advantage of LEO satellites and reduce interference between LEO and NLEO satellites.In the proposed model,the resource price is formulated as the dynamic state of the LEO satellites,using the resource allocation strategy as the control variable.Based on the proposed dynamic game model,an openloop Nash equilibrium is analyzed,and an algorithm is proposed for the resource pricing and allocation problem.Numerical simulations validate the model and algorithm.展开更多
As the traffic distribution in China mainland is far from uniform, a new traffic model in China mainland is presented on the basis of per-capita Gross Domestic Product (GDP) and density of population. Based on this ch...As the traffic distribution in China mainland is far from uniform, a new traffic model in China mainland is presented on the basis of per-capita Gross Domestic Product (GDP) and density of population. Based on this characteristic traffic model, a new Traffic Dependent Dynamic Channel Allocation and Reservation (TDDCAR) technique is proposed, the simulation model is built, and the strategies' performance is evaluated through computer simulation. The simulation results show that, compared to the conventional Fixed Channel Allocation (FCA), TDDCAR estimates the traffic conditions in every spot beam and frequently adjusts the traffic according to current traffic conditions. It has achieved a significant improvement in new call blocking probability, handover blocking probability, and fair index, particularly, in heavy traffic conditions. The building of traffic model in China mainland and the analysis of the simulation results has been a key foundation for the study of resource allocation schemes in the future.展开更多
The passive optical network(PON)technology has been drastically improved in recent years.In spite of using the optical technology,the utilization of the entire bandwidth is a very challenging task.The main categories ...The passive optical network(PON)technology has been drastically improved in recent years.In spite of using the optical technology,the utilization of the entire bandwidth is a very challenging task.The main categories of PON are the Ethernet passive optical network(EPON)and gigabit passive optical network(GPON).These two networks use the dynamic bandwidth allocation(DBA)algorithm to attain the maximum usage of bandwidth,which is provided in the network dynamically according to the need of the customers with the support of the service level agreement(SLA).This paper will provide a clear review about the DBA algorithm of both technologies as well as the comparison。展开更多
This paper examines the allocation of resource to different tasks in a production company. The company produces the same kinds of goods and want to allocate m number of tasks to 50 number of machines. These machines a...This paper examines the allocation of resource to different tasks in a production company. The company produces the same kinds of goods and want to allocate m number of tasks to 50 number of machines. These machines are subject to breakdown. It is expected that the breakdown machines will be repaired and put into operation. From past records, the company estimated the profit the machines will generate from the various tasks at the first stage of the operation. Also, the company estimated the probability of breakdown of the machines for performing each of the tasks. The aim of this paper is to determine the expected maximize profit that will accrue to the company over T horizon. The profit that will accrued to the company was obtained as N4,571,100,000 after 48 weeks of operation. At the infinty horizon, the profit was obtained to be N20,491,000,000 . It was found that adequate planning, prompt and effective maintainance can enhance the profitability of the company.展开更多
With the rapid development of wireless network technologies and the growing de⁃mand for a high quality of service(QoS),the effective management of network resources has attracted a lot of attention.For example,in a pr...With the rapid development of wireless network technologies and the growing de⁃mand for a high quality of service(QoS),the effective management of network resources has attracted a lot of attention.For example,in a practical scenario,when a network shock oc⁃curs,a batch of affected flows needs to be rerouted to respond to the network shock to bring the entire network deployment back to the optimal state,and in the process of rerouting a batch of flows,the entire response time needs to be as short as possible.Specifically,we re⁃duce the time consumed for routing by slicing,but the routing success rate after slicing is re⁃duced compared with the unsliced case.In this context,we propose a two-stage dynamic net⁃work resource allocation framework that first makes decisions on the slices to which flows are assigned,and coordinates resources among slices to ensure a comparable routing suc⁃cess rate as in the unsliced case,while taking advantage of the time efficiency gains from slicing.展开更多
To fulfill the explosive growth of network capacity, fifth generation(5G) standard has captured the attention and imagination of researchers and engineers around the world. In particular, heterogeneous cloud radio acc...To fulfill the explosive growth of network capacity, fifth generation(5G) standard has captured the attention and imagination of researchers and engineers around the world. In particular, heterogeneous cloud radio access network(H-CRAN), as a promising network paradigm in 5G system, is a hot research topic in recent years. However, the densely deployment of RRHs in H-CRAN leads to downlink/uplink traffic asymmetry and severe inter-cell interference which could seriously impair the network throughput and resource utilization. To simultaneously solve these two problems, we proposed a dynamic resource allocation(DRA) scheme for H-CRAN in TDD mode. Firstly, we design a clustering algorithm to group the RRHs into different sets. Secondly, we adopt coordinated multipoint technology to eliminate the interference in each set. Finally, we formulate the joint frame structure, power and subcarrier selection problem as a mixed strategy noncooperative game. The simulation results are presented to validate the effectiveness of our proposed algorithm by compared with the existing work.展开更多
A mobile medical information system (MMIS) is an integrated application (app) of traditional hospital information systems (HIS) which comprise a picture archiving and communications system (PACS), laboratory informati...A mobile medical information system (MMIS) is an integrated application (app) of traditional hospital information systems (HIS) which comprise a picture archiving and communications system (PACS), laboratory information system (LIS), pharmaceutical management information system (PMIS), radiology information system (RIS), and nursing information system (NIS). A dynamic resource allocation table is critical for optimizing the performance to the mobile system, including the doctors, nurses, or other relevant health workers. We have designed a smart dynamic resource allocation model by using the C4.5 algorithm and cumulative distribution for optimizing the weight of resource allocated for the five major attributes in a cooperation communications system. Weka is used in this study. The class of concept is the performance of the app, optimal or suboptimal. Three generations of optimization of the weight in accordance with the optimizing rate are shown.展开更多
基金supported by National Natural Science Foundation of China(U2066209)。
文摘Energy storage systems(ESSs)operate as independent market participants and collaborate with photovoltaic(PV)generation units to enhance the flexible power supply capabilities of PV units.However,the dynamic variations in the profitability of ESSs in the electricity market are yet to be fully understood.This study introduces a dual-timescale dynamics model that integrates a spot market clearing(SMC)model into a system dynamics(SD)model to investigate the profit-aware capacity growth of ESSs and compares the profitability of independent energy storage systems(IESSs)with that of an ESS integrated within a PV(PV-ESS).Furthermore,this study aims to ascertain the optimal allocation of the PV-ESS.First,SD and SMC models were set up.Second,the SMC model simulated on an hourly timescale was incorporated into the SD model as a subsystem,a dual-timescale model was constructed.Finally,a development simulation and profitability analysis was conducted from 2022 to 2040 to reveal the dynamic optimal range of PV-ESS allocation.Additionally,negative electricity prices were considered during clearing processes.The simulation results revealed differences in profitability and capacity growth between IESS and PV-ESS,helping grid investors and policymakers to determine the boundaries of ESSs and dynamic optimal allocation of PV-ESSs.
文摘Cloud computing distributes task-parallel among the various resources.Applications with self-service supported and on-demand service have rapid growth.For these applications,cloud computing allocates the resources dynami-cally via the internet according to user requirements.Proper resource allocation is vital for fulfilling user requirements.In contrast,improper resource allocations result to load imbalance,which leads to severe service issues.The cloud resources implement internet-connected devices using the protocols for storing,communi-cating,and computations.The extensive needs and lack of optimal resource allo-cating scheme make cloud computing more complex.This paper proposes an NMDS(Network Manager based Dynamic Scheduling)for achieving a prominent resource allocation scheme for the users.The proposed system mainly focuses on dimensionality problems,where the conventional methods fail to address them.The proposed system introduced three–threshold mode of task based on its size STT,MTT,LTT(small,medium,large task thresholding).Along with it,task mer-ging enables minimum energy consumption and response time.The proposed NMDS is compared with the existing Energy-efficient Dynamic Scheduling scheme(EDS)and Decentralized Virtual Machine Migration(DVM).With a Network Manager-based Dynamic Scheduling,the proposed model achieves excellence in resource allocation compared to the other existing models.The obtained results shows the proposed system effectively allocate the resources and achieves about 94%of energy efficient than the other models.The evaluation metrics taken for comparison are energy consumption,mean response time,percentage of resource utilization,and migration.
基金This work was supported by the Key Program of Social Science Planning Foundation of Liaoning Province under Grant L21AGL017.
文摘Shared manufacturing is recognized as a new point-to-point manufac-turing mode in the digital era.Shared manufacturing is referred to as a new man-ufacturing mode to realize the dynamic allocation of manufacturing tasks and resources.Compared with the traditional mode,shared manufacturing offers more abundant manufacturing resources and flexible configuration options.This paper proposes a model based on the description of the dynamic allocation of tasks and resources in the shared manufacturing environment,and the characteristics of shared manufacturing resource allocation.The execution of manufacturing tasks,in which candidate manufacturing resources enter or exit at various time nodes,enables the dynamic allocation of manufacturing tasks and resources.Then non-dominated sorting genetic algorithm(NSGA-II)and multi-objective particle swarm optimization(MOPSO)algorithms are designed to solve the model.The optimal parameter settings for the NSGA-II and MOPSO algorithms have been obtained according to the experiments with various population sizes and iteration numbers.In addition,the proposed model’s efficiency,which considers the entries and exits of manufacturing resources in the shared manufacturing environment,is further demonstrated by the overlap between the outputs of the NSGA-II and MOPSO algorithms for optimal resource allocation.
文摘Non-orthogonal multiple access(NOMA)represents the latest addition to the array of multiple access techniques,enabling simultaneous servicing of multiple users within a singular resource block in terms of time,frequency,and code.A typical NOMA configuration comprises a base station along with proximate and distant users.The proximity users experience more favorable channel conditions in contrast to distant users,resulting in a compromised performance for the latter due to the less favorable channel conditions.When cooperative communication is integrated with NOMA,the overall system performance,including spectral efficiency and capacity,is further elevated.This study introduces a cooperative NOMA setup in the downlink,involving three users,and employs dynamic power allocation(DPA).Within this framework,User 2 acts as a relay,functioning under the decode-and-forward protocol,forwarding signals to both User 1 and User 3.This arrangement aims to bolster the performance of the user positioned farthest from the base station,who is adversely affected by weaker channel conditions.Theoretical and simulation outcomes reveal enhancements within the system’s performance.
基金supported by the National Natural Science Foundation of China(No.62071354)the Key Research and Development Program of Shaanxi(No.2022ZDLGY05-08)supported by the ISN State Key Laboratory。
文摘To meet the communication services with diverse requirements,dynamic resource allocation has shown increasing importance.In this paper,we consider the multi-slot and multi-user resource allocation(MSMU-RA)in a downlink cellular scenario with the aim of maximizing system spectral efficiency while guaranteeing user fairness.We first model the MSMURA problem as a dual-sequence decision-making process,and then solve it by a novel Transformerbased deep reinforcement learning(TDRL)approach.Specifically,the proposed TDRL approach can be achieved based on two aspects:1)To adapt to the dynamic wireless environment,the proximal policy optimization(PPO)algorithm is used to optimize the multi-slot RA strategy.2)To avoid co-channel interference,the Transformer-based PPO algorithm is presented to obtain the optimal multi-user RA scheme by exploring the mapping between user sequence and resource sequence.Experimental results show that:i)the proposed approach outperforms both the traditional and DRL methods in spectral efficiency and user fairness,ii)the proposed algorithm is superior to DRL approaches in terms of convergence speed and generalization performance.
文摘This paper presents a novel model for dynamic bandwidth allocation and rate coordination based on DiffServ and a bandwidth broker(BB). In this model, assignment of bandwidth was made according to a periodic trace of network characteristics per application. And adjustment of transfer rate was accomplished through negotiation with applications by a bandwidth agent. This model was evaluated using network simulator 2 (NS-2), and distinct improvements were found in respects of delay and packet loss of overall network and single flow. Finally, the model was suggested to be leveraged to multimedia applications with properties of lower delay and lower packet loss.
基金supported in part by the National Natural Science Foundation of China (61771120)the Fundamental Research Funds for the Central Universities (N171602002)
文摘With the explosive growth of highspeed wireless data demand and the number of mobile devices, fog radio access networks(F-RAN) with multi-layer network structure becomes a hot topic in recent research. Meanwhile, due to the rapid growth of mobile communication traffic, high cost and the scarcity of wireless resources, it is especially important to develop an efficient radio resource management mechanism. In this paper, we focus on the shortcomings of resource waste, and we consider the actual situation of base station dynamic coverage and user requirements. We propose a spectrum pricing and allocation scheme based on Stackelberg game model under F-RAN framework, realizing the allocation of resource on demand. This scheme studies the double game between the users and the operators, as well as between the traditional operators and the virtual operators, maximizing the profits of the operators. At the same time, spectrum reuse technology is adopted to improve the utilization of network resource. By analyzing the simulation results, it is verified that our proposed scheme can not only avoid resource waste, but also effectively improve the operator's revenue efficiency and overall network resource utilization.
文摘A stochastic resource allocation model, based on the principles of Markov decision processes(MDPs), is proposed in this paper. In particular, a general-purpose framework is developed, which takes into account resource requests for both instant and future needs. The considered framework can handle two types of reservations(i.e., specified and unspecified time interval reservation requests), and implement an overbooking business strategy to further increase business revenues. The resulting dynamic pricing problems can be regarded as sequential decision-making problems under uncertainty, which is solved by means of stochastic dynamic programming(DP) based algorithms. In this regard, Bellman’s backward principle of optimality is exploited in order to provide all the implementation mechanisms for the proposed reservation pricing algorithm. The curse of dimensionality, as the inevitable issue of the DP both for instant resource requests and future resource reservations,occurs. In particular, an approximate dynamic programming(ADP) technique based on linear function approximations is applied to solve such scalability issues. Several examples are provided to show the effectiveness of the proposed approach.
基金supported in part by the Joint Scientific Research Project Funding Scheme between Macao Science and Technology Development Fund and the Ministry of Science and Technology of the People's Republic of China under Grant 0066/2019/AMJin part by the Intergovernmental International Cooperation in Science and Technology Innovation Program under Grants 2019YFE0111600+3 种基金in part by the Macao Science and Technology Development Fund under Grants 0060/2019/A1 and 0162/2019/A3in part by National Natural Science Foundation of China under Grant 62072490in part by Research Grant of University of Macao under Grants MYRG2018-00237-FST and SRG2019-00168-IOTSCin part by FDCT SKL-IOTSC(UM)-2021-2023.
文摘Mobile Edge Computing(MEC)has been envisioned as an efficient solution to provide computation-intensive yet latency-sensitive services for wireless devices.In this paper,we investigate the optimal dynamic spectrum allocation-assisted multiuser computation offloading in MEC for overall latency minimization.Specifically,we first focus on a static multiuser computation offloading scenario and jointly optimize users'offloading decisions,transmission durations,and Edge Servers'(ESs)resource allocations.Owing to the nonconvexity of our joint optimization problem,we identify its layered structure and decompose it into two problems:a subproblem and a top problem.For the subproblem,we propose a bisection search-based algorithm to efficiently find the optimal users'offloading decisions and ESs’resource allocations under a given transmission duration.Second,we use a linear search-based algorithm for solving the top problem to obtain the optimal transmission duration based on the result of the subproblem.Further,after solving the static scenario,we consider a dynamic scenario of multiuser computation offloading with time-varying channels and workload.To efficiently address this dynamic scenario,we propose a deep reinforcement learning-based online algorithm to determine the near-optimal transmission duration in a real-time manner.Numerical results are provided to validate our proposed algorithms for minimizing the overall latency in both static and dynamic offloading scenarios.We also demonstrate the advantages of our proposed algorithms compared to the conventional multiuser computation offloading schemes.
文摘To improve and optimize the bandwidth utilization for multi-service packet transporting system, a kind of Dynamic Full Bandwidth Utilized (DFBU) allocation algorithm allowing a single link to use far beyond its fair share bandwidth is presented. Three important parameters as the bound on max and minimum bandwidth, the maximum packet delay and the minimum bandwidth utilization are discussed and analyzed. Results of experiments show that the DFBU-algorithm is capable of making a single link in the system use all the spare bandwidth (up to full-bandwidth) while the performance of fairness and QoS requirement is still guaranteed.
基金supported by the National Natural Science Foundation of China(61773172)supported in part by the Australian Research Council(DP200101197,DE210100274)。
文摘In this paper,accelerated saddle point dynamics is proposed for distributed resource allocation over a multi-agent network,which enables a hyper-exponential convergence rate.Specifically,an inertial fast-slow dynamical system with vanishing damping is introduced,based on which the distributed saddle point algorithm is designed.The dual variables are updated in two time scales,i.e.,the fast manifold and the slow manifold.In the fast manifold,the consensus of the Lagrangian multipliers and the tracking of the constraints are pursued by the consensus protocol.In the slow manifold,the updating of the Lagrangian multipliers is accelerated by inertial terms.Hyper-exponential stability is defined to characterize a faster convergence of our proposed algorithm in comparison with conventional primal-dual algorithms for distributed resource allocation.The simulation of the application in the energy dispatch problem verifies the result,which demonstrates the fast convergence of the proposed saddle point dynamics.
基金The National High-Tech Research and Development Program of China ( No.2005AA123950)the National Science Foundation of China (No.90604035)
文摘A realistic population density distribution scenario in conjunction with the spatial dynamic spectrum allocation (DSA) is taken into account to mitigate the spectrum wastage in terms of extra guard bands. For the insertion of the extra guard bands, an efficient strategy based on self-assessment is applied to each victim cell individually and independently. Consequently, it is no more required to spread the extra guard band over the whole DSA region. Simulation results StlOW an improvement of 3% -4% in percentage of satisfied users for Universal Mobile Telecommunications System (UMTS) network and 4%-5% for Digital Video Broadcasting Terrestrial (DVB-T) network.
基金This work is supported by the National Natural Science Foundation of China(Grant No.61971032)Fundamental Research Funds for the Central Universities(Grant No.FRF-TP-18-008A3).
文摘The goal of delivering high-quality service has spurred research of 6G satellite communication networks.The limited resource-allocation problem has been addressed by next-generation satellite communication networks,especially multilayer networks with multiple low-Earth-orbit(LEO)and nonlow-Earth-orbit(NLEO)satellites.In this study,the resource-allocation problem of a multilayer satellite network consisting of one NLEO and multiple LEO satellites is solved.The NLEO satellite is the authorized user of spectrum resources and the LEO satellites are unauthorized users.The resource allocation and dynamic pricing problems are combined,and a dynamic gamebased resource pricing and allocation model is proposed to maximize the market advantage of LEO satellites and reduce interference between LEO and NLEO satellites.In the proposed model,the resource price is formulated as the dynamic state of the LEO satellites,using the resource allocation strategy as the control variable.Based on the proposed dynamic game model,an openloop Nash equilibrium is analyzed,and an algorithm is proposed for the resource pricing and allocation problem.Numerical simulations validate the model and algorithm.
文摘As the traffic distribution in China mainland is far from uniform, a new traffic model in China mainland is presented on the basis of per-capita Gross Domestic Product (GDP) and density of population. Based on this characteristic traffic model, a new Traffic Dependent Dynamic Channel Allocation and Reservation (TDDCAR) technique is proposed, the simulation model is built, and the strategies' performance is evaluated through computer simulation. The simulation results show that, compared to the conventional Fixed Channel Allocation (FCA), TDDCAR estimates the traffic conditions in every spot beam and frequently adjusts the traffic according to current traffic conditions. It has achieved a significant improvement in new call blocking probability, handover blocking probability, and fair index, particularly, in heavy traffic conditions. The building of traffic model in China mainland and the analysis of the simulation results has been a key foundation for the study of resource allocation schemes in the future.
文摘The passive optical network(PON)technology has been drastically improved in recent years.In spite of using the optical technology,the utilization of the entire bandwidth is a very challenging task.The main categories of PON are the Ethernet passive optical network(EPON)and gigabit passive optical network(GPON).These two networks use the dynamic bandwidth allocation(DBA)algorithm to attain the maximum usage of bandwidth,which is provided in the network dynamically according to the need of the customers with the support of the service level agreement(SLA).This paper will provide a clear review about the DBA algorithm of both technologies as well as the comparison。
文摘This paper examines the allocation of resource to different tasks in a production company. The company produces the same kinds of goods and want to allocate m number of tasks to 50 number of machines. These machines are subject to breakdown. It is expected that the breakdown machines will be repaired and put into operation. From past records, the company estimated the profit the machines will generate from the various tasks at the first stage of the operation. Also, the company estimated the probability of breakdown of the machines for performing each of the tasks. The aim of this paper is to determine the expected maximize profit that will accrue to the company over T horizon. The profit that will accrued to the company was obtained as N4,571,100,000 after 48 weeks of operation. At the infinty horizon, the profit was obtained to be N20,491,000,000 . It was found that adequate planning, prompt and effective maintainance can enhance the profitability of the company.
文摘With the rapid development of wireless network technologies and the growing de⁃mand for a high quality of service(QoS),the effective management of network resources has attracted a lot of attention.For example,in a practical scenario,when a network shock oc⁃curs,a batch of affected flows needs to be rerouted to respond to the network shock to bring the entire network deployment back to the optimal state,and in the process of rerouting a batch of flows,the entire response time needs to be as short as possible.Specifically,we re⁃duce the time consumed for routing by slicing,but the routing success rate after slicing is re⁃duced compared with the unsliced case.In this context,we propose a two-stage dynamic net⁃work resource allocation framework that first makes decisions on the slices to which flows are assigned,and coordinates resources among slices to ensure a comparable routing suc⁃cess rate as in the unsliced case,while taking advantage of the time efficiency gains from slicing.
基金jointly supported by Project 61501052 and 61302080 of the National Natural Science Foundation of China
文摘To fulfill the explosive growth of network capacity, fifth generation(5G) standard has captured the attention and imagination of researchers and engineers around the world. In particular, heterogeneous cloud radio access network(H-CRAN), as a promising network paradigm in 5G system, is a hot research topic in recent years. However, the densely deployment of RRHs in H-CRAN leads to downlink/uplink traffic asymmetry and severe inter-cell interference which could seriously impair the network throughput and resource utilization. To simultaneously solve these two problems, we proposed a dynamic resource allocation(DRA) scheme for H-CRAN in TDD mode. Firstly, we design a clustering algorithm to group the RRHs into different sets. Secondly, we adopt coordinated multipoint technology to eliminate the interference in each set. Finally, we formulate the joint frame structure, power and subcarrier selection problem as a mixed strategy noncooperative game. The simulation results are presented to validate the effectiveness of our proposed algorithm by compared with the existing work.
文摘A mobile medical information system (MMIS) is an integrated application (app) of traditional hospital information systems (HIS) which comprise a picture archiving and communications system (PACS), laboratory information system (LIS), pharmaceutical management information system (PMIS), radiology information system (RIS), and nursing information system (NIS). A dynamic resource allocation table is critical for optimizing the performance to the mobile system, including the doctors, nurses, or other relevant health workers. We have designed a smart dynamic resource allocation model by using the C4.5 algorithm and cumulative distribution for optimizing the weight of resource allocated for the five major attributes in a cooperation communications system. Weka is used in this study. The class of concept is the performance of the app, optimal or suboptimal. Three generations of optimization of the weight in accordance with the optimizing rate are shown.