Enterprise architecture(EA) development is always a superior way to address business-IT alignment(BITA) issue.However, most EA design frameworks are inadequate to allocate IT resources, which is an important metric of...Enterprise architecture(EA) development is always a superior way to address business-IT alignment(BITA) issue.However, most EA design frameworks are inadequate to allocate IT resources, which is an important metric of BITA maturity. Under this situation, the idea of IT resource allocation is combined with the EA design process, in order to extend prior EA research on BITA and to demonstrate EA's capability of implementing IT governance. As an effective resource allocation method, portfolio decision analysis(PDA) is used to align business functions of business architecture and applications of system architecture. Furthermore, this paper exhibits an illustrative case with the proposed framework.展开更多
There are always large-scale items in the maintenances schedule of aircraft system, many of which have been fixed to be done in predefined sequences, which leads the workflow to be sys-tematically complex and makes th...There are always large-scale items in the maintenances schedule of aircraft system, many of which have been fixed to be done in predefined sequences, which leads the workflow to be sys-tematically complex and makes this kind of problem quite different from all sorts of existing job-selection modes. On the other hand, the human resources are always limited and men have different working capabilities on different items, which make the allocation operation of human resources be much roomy. However, the final total time span of maintenance is often required to be as short as possible in many practices, in order to suffer only the lowest cost of loss while the system is stopping. A new model for op-timizing the allocation if aircraft maintenance human resources with the constraint of predefined sequence is presented. The ge-netic algorithm is employed to find the optimal solution that holds the shortest total time span of maintenance. To generate the ul-timate maintenance work items and the human resource array, the sequences among all maintenance work items are considered firstly, the work item array is then generated through traversal with the constraint of maintenance sequence matrix, and the human resources are finally allocated according to the work item array with the constraint of the maintenance capability. An example is demonstrated to show that the model and algorithm behave a satisfying performance on finding the optimal solution as expected.展开更多
This research develops a comprehensive method to solve a combinatorial problem consisting of distribution system reconfiguration, capacitor allocation, and renewable energy resources sizing and siting simultaneously a...This research develops a comprehensive method to solve a combinatorial problem consisting of distribution system reconfiguration, capacitor allocation, and renewable energy resources sizing and siting simultaneously and to improve power system's accountability and system performance parameters. Due to finding solution which is closer to realistic characteristics, load forecasting, market price errors and the uncertainties related to the variable output power of wind based DG units are put in consideration. This work employs NSGA-II accompanied by the fuzzy set theory to solve the aforementioned multi-objective problem. The proposed scheme finally leads to a solution with a minimum voltage deviation, a maximum voltage stability, lower amount of pollutant and lower cost. The cost includes the installation costs of new equipment, reconfiguration costs, power loss cost, reliability cost, cost of energy purchased from power market, upgrade costs of lines and operation and maintenance costs of DGs. Therefore, the proposed methodology improves power quality, reliability and security in lower costs besides its preserve, with the operational indices of power distribution networks in acceptable level. To validate the proposed methodology's usefulness, it was applied on the IEEE 33-bus distribution system then the outcomes were compared with initial configuration.展开更多
Based on the theory of complex adaptive system(CAS),the optimal allocation model of water resources in sewage irrigation areas was established,which provided new ideas and application value for the rational utilizatio...Based on the theory of complex adaptive system(CAS),the optimal allocation model of water resources in sewage irrigation areas was established,which provided new ideas and application value for the rational utilization of agricultural production and waste water resources.The results demonstrated that the difference of crop energy capture mainly depended on the development stage.Waste water with a certain concentration was able to promote crop growth,while excessive concentration inhibited crop growth.The correlation between water absorption rate and leaf area index was close(R=0.9498,p<0.01).The amount of bad seeds increased at a speed of 34.7·d^-1,when system irrigated randomly in the seedling stage,while it tended to remain stable at a speed of 0.3·d^-1 after plants entering the mature stage which impacted the total yields of crops.展开更多
Resource allocation （RA） is the problem of allocating resources among various artifacts or business units to meet one or more expected goals, such a.s maximizing the profits, minimizing the costs, or achieving the b...Resource allocation （RA） is the problem of allocating resources among various artifacts or business units to meet one or more expected goals, such a.s maximizing the profits, minimizing the costs, or achieving the best qualities. A complex multiobjective RA is addressed, and a multiobjective mathematical model is used to find solutions efficiently. Then, all improved particie swarm algorithm （mO_PSO） is proposed combined with a new particle diversity controller policies and dissipation operation. Meanwhile, a modified Pareto methods used in PSO to deal with multiobjectives optimization is presented. The effectiveness of the provided algorithm is validated by its application to some illustrative example dealing with multiobjective RA problems and with the comparative experiment with other algorithm.展开更多
A joint resource allocation scheme concerned with the sensor subset,power and bandwidth for range-only target tracking in multiple-input multiple-output(MIMO)radar systems is proposed.By selecting an optimal subset of...A joint resource allocation scheme concerned with the sensor subset,power and bandwidth for range-only target tracking in multiple-input multiple-output(MIMO)radar systems is proposed.By selecting an optimal subset of sensors with the predetermined size and implementing the power allocation and bandwidth strategies among them,this algorithm can help achieving a better performance within the same resource constraints.Firstly,the Bayesian Cramer-Rao bound(BCRB)is derived from it.Secondly,a criterion for minimizing the BCRB at the target location among all targets tracking in a certain range is derived.Thirdly,the optimization problem involved with three variable vectors is formulated,which can be simplified by deriving the relationship between the optimal power allocation vector and the bandwidth allocation vector.Then,the simplified optimization problem is solved by the cyclic minimization algorithm incorporated with the sequential parametric convex approximation(SPCA)algorithm.Finally,the validity of the proposed method is demonstrated with simulation results.展开更多
This paper generalizes the classic resource allocation problem to the resource planning and allocation problem, in which the resource itself is a decision variable and the cost of each activity is uncertain when the r...This paper generalizes the classic resource allocation problem to the resource planning and allocation problem, in which the resource itself is a decision variable and the cost of each activity is uncertain when the resource is determined. The authors formulate this problem as a two-stage stochastic programming. The authors first propose an efficient algorithm for the case with finite states. Then, a sudgradient method is proposed for the general case and it is shown that the simple algorithm for the unique state case can be used to compute the subgradient of the objective function. Numerical experiments are conducted to show the effectiveness of the model.展开更多
To minimize the overall transmit power while maintaining a constant data rate and target BER, a downlink adaptive resource allocation algorithm with jointing the exclusive manner and the shared manner is proposed for ...To minimize the overall transmit power while maintaining a constant data rate and target BER, a downlink adaptive resource allocation algorithm with jointing the exclusive manner and the shared manner is proposed for multiuser MIMO-OFDM system in correlated channels. The algorithm allocates all the subcarriers to different users according to their spatial correlations. The users with high spatial correlation are allocated in the same group and the exclusive manner is applied. The shared manner with an improved null broadening method, which improves the performance of co-channel interference （CCI） suppression and decreases the number of transmit antennas required, is applied between the different group users. As the user＇s direction of departure （DOD） changes very slowly, a looking up table method is used to reduce the computational complexity. The simulation results show that despite the angle spread of DOD, when compared with the exclusive manner, the proposed algorithm improves the spectral efficiency, and when compared with the TDMA-ZF （zero forcing） shared manner, the proposed algorithm decreases the total transmit power by at least 1 dB.展开更多
To improve the error performance and the resource utilization of cooperative systems, the optimum resource allocation, i.e., power allocation and partner choice, for an adaptive decode-and-forward （DF） cooperative d...To improve the error performance and the resource utilization of cooperative systems, the optimum resource allocation, i.e., power allocation and partner choice, for an adaptive decode-and-forward （DF） cooperative diversity system based on quadrature modulation is investigated. The closed-form expression of the bit error rate （BER） system performance is derived and an optimal power allocation （OPA） algorithm is proposed to optimize the power allocation between the local and relayed signals under the minimum BER criterion. Based on the OPA algorithm, a partner choice strategy is proposed to determine the partner locations specified by various cooperation gains. Simulation results show that the proposed resource optimization algorithms are superior to the unoptimized algorithms by significantly reducing the BER and improving the cooperative gain, which is useful to simplify the practical partner choice process.展开更多
In order to lower the power consumption and improve the coefficient of resource utilization of current cloud computing systems, this paper proposes two resource pre-allocation algorithms based on the ＂shut down the r...In order to lower the power consumption and improve the coefficient of resource utilization of current cloud computing systems, this paper proposes two resource pre-allocation algorithms based on the ＂shut down the redundant, turn on the demanded＂ strategy here. Firstly, a green cloud computing model is presented, abstracting the task scheduling problem to the virtual machine deployment issue with the virtualization technology. Secondly, the future workloads of system need to be predicted： a cubic exponential smoothing algorithm based on the conservative control（CESCC） strategy is proposed, combining with the current state and resource distribution of system, in order to calculate the demand of resources for the next period of task requests. Then, a multi-objective constrained optimization model of power consumption and a low-energy resource allocation algorithm based on probabilistic matching（RA-PM） are proposed. In order to reduce the power consumption further, the resource allocation algorithm based on the improved simulated annealing（RA-ISA） is designed with the improved simulated annealing algorithm. Experimental results show that the prediction and conservative control strategy make resource pre-allocation catch up with demands, and improve the efficiency of real-time response and the stability of the system. Both RA-PM and RA-ISA can activate fewer hosts, achieve better load balance among the set of high applicable hosts, maximize the utilization of resources, and greatly reduce the power consumption of cloud computing systems.展开更多
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.展开更多
Compared with the traditional phased array radar, the co-located multiple-input multiple-output(MIMO) radar is able to transmit orthogonal waveforms to form different illuminating modes, providing a larger freedom deg...Compared with the traditional phased array radar, the co-located multiple-input multiple-output(MIMO) radar is able to transmit orthogonal waveforms to form different illuminating modes, providing a larger freedom degree in radar resource management. In order to implement the effective resource management for the co-located MIMO radar in multi-target tracking,this paper proposes a resource management optimization model,where the system resource consumption and the tracking accuracy requirements are considered comprehensively. An adaptive resource management algorithm for the co-located MIMO radar is obtained based on the proposed model, where the sub-array number, sampling period, transmitting energy, beam direction and working mode are adaptively controlled to realize the time-space resource joint allocation. Simulation results demonstrate the superiority of the proposed algorithm. Furthermore, the co-located MIMO radar using the proposed algorithm can satisfy the predetermined tracking accuracy requirements with less comprehensive cost compared with the phased array radar.展开更多
The resource allocation for device-to-device(D2D)multicast communications is investigated.To achieve fair energy efficiency(EE)among different multicast groups,the max-min fairness criterion is used as the optimizatio...The resource allocation for device-to-device(D2D)multicast communications is investigated.To achieve fair energy efficiency(EE)among different multicast groups,the max-min fairness criterion is used as the optimization criterion and the EE of D2D multicast groups are taken as the optimization objective function.The aim is to maximize the minimum EE for different D2D multicast groups under the constraints of the maximum transmit power and minimum transmit rate,which is modeled as a non-convex and mixed-integer fractional programming problem.Here,suboptimal resource allocation algorithms are proposed to solve this problem.First,channel assignment scheme is performed to assign channel to D2D multicast groups.Second,for a given channel assignment,iterative power allocation schemes with and without loss of cellular users’rate are completed,respectively.Simulation results corroborate the convergence performance of the proposed algorithms.In addition,compared with the traditional throughput maximization algorithm,the proposed algorithms can improve the energy efficiency of the system and the fairness achieved among different multicast groups.展开更多
To improve the performance of a multiuser MIMO-OFDM system with imperfect channel status information, a downlink adaptive resource allocation algorithm which combines space-time block coding and beam forming （STBC-BF...To improve the performance of a multiuser MIMO-OFDM system with imperfect channel status information, a downlink adaptive resource allocation algorithm which combines space-time block coding and beam forming （STBC-BF） is proposed. The algorithm allocates the subcarriers with a shared manner. A zero forcing processing with joint Rx-Tx is used to suppress the co-channel interference （CCI） and to construct uncorrelated channels for STBC. An adaptive power allocation for the STBC equivalent channels can increase signal to interference and noise ratio at the receiver. Simulation results show that under the condition of an imperfect CSI, the proposed algorithm improves the system performance and reduces the number of BS transmit antennas required.展开更多
To minimize the total transmit power for multicast service in an orthogonal frequency division multiplexing（OFDM） downlink system,resource allocation algorithms that adaptively allocate subcarriers and bits are prop...To minimize the total transmit power for multicast service in an orthogonal frequency division multiplexing（OFDM） downlink system,resource allocation algorithms that adaptively allocate subcarriers and bits are proposed.The proposed algorithms select users with good channel conditions for each subcarrier to reduce the transmit power,while guaranteeing each user＇s instantaneous minimum rate requirement.The resource allocation problem is first formulated as an integer programming（IP） problem,and then,a full search algorithm that achieves an optimal solution is presented.To reduce the computation load,a suboptimal algorithm is proposed.This suboptimal algorithm decouples the joint resource allocation problem by separating subcarrier and bit allocation.Greedy-like algorithms are employed in both procedures.Simulation results illustrate that the proposed algorithms can significantly reduce the transmit power compared with the conventional multicast approach and the performance of the suboptimal algorithm is close to the optimum.展开更多
Different schemes, which performed channel, power and time allocation to enhance the network performance of overall end-to-end throughput for cooperative cognitive radio network, were investigated. Interference temper...Different schemes, which performed channel, power and time allocation to enhance the network performance of overall end-to-end throughput for cooperative cognitive radio network, were investigated. Interference temperature limit of corresponding primary users was considered. Due to the constraints caused by multiple dual channels, the power allocation problem is non-convex and NP-hard. Based on geometric programming (GP), a novel and general algorithm, which turned the problem into a series of GP problems by logarithm approximation (LASGP), was proposed to efficiently solve it. Numerical results verify the efficiency and availability of the LASGP algorithm. Solutions of LASGP are provably convergent and globally optimal point can be observed as well as the channel allocation always outperforms power or timeslot allocation from simulations. Compared with schemes without any allocation, the scheme with joint channel, power and timeslot allocation significantly increases the overall end-to-end throughput by no less than 70% under same simulation conditions. This scheme can not only maximize the throughput by increasing total maximum power of relay node, but also outperform other resource allocation schemes when lower total maximum power of source and relay nodes is restricted. As the total maximum power of source node increases, the scheme with joint channel and timeslot allocation performs best in all schemes.展开更多
The bits and power allocation model of adaptive power-rate mixture for multi-user multi-server power-line communication systems was analyzed with the restrictions of maximal total power,fixed rate for each real time (...The bits and power allocation model of adaptive power-rate mixture for multi-user multi-server power-line communication systems was analyzed with the restrictions of maximal total power,fixed rate for each real time (RT) user,minimal rate for each non-real time (NRT) user,maximal bits and power for each subcarrier in each orthogonal frequency division multiplexing (OFDM) symbol. An algorithm of resource dynamic allocation in the first OFDM symbol of each frame and resource optimal adjustment in the latter OFDM symbol of each frame was proposed. In the first OFDM symbol of every frame,resource is firstly assigned for RT users so as to minimize their total used power until satisfying their fixed rates; secondly the remainder resource of power and subcarriers are assigned for NRT users so as to minimize their total used power until satisfying their minimal rates also; lastly the remainder resource is again assigned for NRT users according to the proportional fairness strategy so as to maximize their total assigning rate. In the latter OFDM symbol of each frame,bits are swapped and power is adjusted for every user based on the resource allocation results of anterior OFDM symbol. The algorithm is tested in the typical power-line channel scenarios and the simulation results indicate that the proposed algorithm has better performances than the classical multi-user resource allocation algorithms and it realizes the multiple aims of multi-user multi-server resource allocation for power-line communication systems.展开更多
The joint resource block(RB)allocation and power optimization problem is studied to maximize the sum-rate of the vehicle-to-vehicle(V2V)links in the device-to-device(D2D)-enabled V2V communication system,where one fea...The joint resource block(RB)allocation and power optimization problem is studied to maximize the sum-rate of the vehicle-to-vehicle(V2V)links in the device-to-device(D2D)-enabled V2V communication system,where one feasible cellular user(FCU)can share its RB with multiple V2V pairs.The problem is first formulated as a nonconvex mixed-integer nonlinear programming(MINLP)problem with constraint of the maximum interference power in the FCU links.Using the game theory,two coalition formation algorithms are proposed to accomplish V2V link partitioning and FCU selection,where the transferable utility functions are introduced to minimize the interference among the V2V links and the FCU links for the optimal RB allocation.The successive convex approximation(SCA)is used to transform the original problem into a convex one and the Lagrangian dual method is further applied to obtain the optimal transmit power of the V2V links.Finally,numerical results demonstrate the efficiency of the proposed resource allocation algorithm in terms of the system sum-rate.展开更多
A quality of service（QoS） guaranteed cross-layer resource allocation algorithm with physical layer, medium access control（MAC） layer and call admission control（CAC） considered simultaneously is proposed for the ...A quality of service（QoS） guaranteed cross-layer resource allocation algorithm with physical layer, medium access control（MAC） layer and call admission control（CAC） considered simultaneously is proposed for the full IP orthogonal frequency division multiple access（OFDMA） communication system, which can ensure the quality of multimedia services in full IP networks.The algorithm converts the physical layer resources such as subcarriers, transmission power, and the QoS metrics into equivalent bandwidth which can be distributed by the base station in all three layers. By this means, the QoS requirements in terms of bit error rate（BER）, transmission delay and dropping probability can be guaranteed by the cross-layer optimal equivalent bandwidth allocation. The numerical results show that the proposed algorithm has higher spectrum efficiency compared to the existing systems.展开更多
Cloud computing represents a novel computing model in the contemporary technology world. In a cloud system, the com- puting power of virtual machines （VMs） and network status can greatly affect the completion time o...Cloud computing represents a novel computing model in the contemporary technology world. In a cloud system, the com- puting power of virtual machines （VMs） and network status can greatly affect the completion time of data intensive tasks. How- ever, most of the current resource allocation policies focus only on network conditions and physical hosts. And the computing power of VMs is largely ignored. This paper proposes a comprehensive resource allocation policy which consists of a data intensive task scheduling algorithm that takes account of computing power of VMs and a VM allocation policy that considers bandwidth between storage nodes and hosts. The VM allocation policy includes VM placement and VM migration algorithms. Related simulations show that the proposed algorithms can greatly reduce the task comple- tion time and keep good load balance of physical hosts at the same time.展开更多
基金supported by the National Natural Science Foundation of China(71571189)
文摘Enterprise architecture(EA) development is always a superior way to address business-IT alignment(BITA) issue.However, most EA design frameworks are inadequate to allocate IT resources, which is an important metric of BITA maturity. Under this situation, the idea of IT resource allocation is combined with the EA design process, in order to extend prior EA research on BITA and to demonstrate EA's capability of implementing IT governance. As an effective resource allocation method, portfolio decision analysis(PDA) is used to align business functions of business architecture and applications of system architecture. Furthermore, this paper exhibits an illustrative case with the proposed framework.
文摘There are always large-scale items in the maintenances schedule of aircraft system, many of which have been fixed to be done in predefined sequences, which leads the workflow to be sys-tematically complex and makes this kind of problem quite different from all sorts of existing job-selection modes. On the other hand, the human resources are always limited and men have different working capabilities on different items, which make the allocation operation of human resources be much roomy. However, the final total time span of maintenance is often required to be as short as possible in many practices, in order to suffer only the lowest cost of loss while the system is stopping. A new model for op-timizing the allocation if aircraft maintenance human resources with the constraint of predefined sequence is presented. The ge-netic algorithm is employed to find the optimal solution that holds the shortest total time span of maintenance. To generate the ul-timate maintenance work items and the human resource array, the sequences among all maintenance work items are considered firstly, the work item array is then generated through traversal with the constraint of maintenance sequence matrix, and the human resources are finally allocated according to the work item array with the constraint of the maintenance capability. An example is demonstrated to show that the model and algorithm behave a satisfying performance on finding the optimal solution as expected.
文摘This research develops a comprehensive method to solve a combinatorial problem consisting of distribution system reconfiguration, capacitor allocation, and renewable energy resources sizing and siting simultaneously and to improve power system's accountability and system performance parameters. Due to finding solution which is closer to realistic characteristics, load forecasting, market price errors and the uncertainties related to the variable output power of wind based DG units are put in consideration. This work employs NSGA-II accompanied by the fuzzy set theory to solve the aforementioned multi-objective problem. The proposed scheme finally leads to a solution with a minimum voltage deviation, a maximum voltage stability, lower amount of pollutant and lower cost. The cost includes the installation costs of new equipment, reconfiguration costs, power loss cost, reliability cost, cost of energy purchased from power market, upgrade costs of lines and operation and maintenance costs of DGs. Therefore, the proposed methodology improves power quality, reliability and security in lower costs besides its preserve, with the operational indices of power distribution networks in acceptable level. To validate the proposed methodology's usefulness, it was applied on the IEEE 33-bus distribution system then the outcomes were compared with initial configuration.
基金Supported by the Science and Technology Research Project of the Ministry of Education(14YJCZH017)the Major State Basic Research Development Program of China(973 Program)(2017YFC0404503)+1 种基金Key Cultivation Project of Lingnan Normal University in 2019(LZ1903)Lingnan Normal University Special Talent Program(ZL2007)
文摘Based on the theory of complex adaptive system(CAS),the optimal allocation model of water resources in sewage irrigation areas was established,which provided new ideas and application value for the rational utilization of agricultural production and waste water resources.The results demonstrated that the difference of crop energy capture mainly depended on the development stage.Waste water with a certain concentration was able to promote crop growth,while excessive concentration inhibited crop growth.The correlation between water absorption rate and leaf area index was close(R=0.9498,p<0.01).The amount of bad seeds increased at a speed of 34.7·d^-1,when system irrigated randomly in the seedling stage,while it tended to remain stable at a speed of 0.3·d^-1 after plants entering the mature stage which impacted the total yields of crops.
基金the National Natural Science Foundation of China (60573159)
文摘Resource allocation （RA） is the problem of allocating resources among various artifacts or business units to meet one or more expected goals, such a.s maximizing the profits, minimizing the costs, or achieving the best qualities. A complex multiobjective RA is addressed, and a multiobjective mathematical model is used to find solutions efficiently. Then, all improved particie swarm algorithm （mO_PSO） is proposed combined with a new particle diversity controller policies and dissipation operation. Meanwhile, a modified Pareto methods used in PSO to deal with multiobjectives optimization is presented. The effectiveness of the provided algorithm is validated by its application to some illustrative example dealing with multiobjective RA problems and with the comparative experiment with other algorithm.
基金supported by the National Natural Science Foundation of China(615015136140146941301481)
文摘A joint resource allocation scheme concerned with the sensor subset,power and bandwidth for range-only target tracking in multiple-input multiple-output(MIMO)radar systems is proposed.By selecting an optimal subset of sensors with the predetermined size and implementing the power allocation and bandwidth strategies among them,this algorithm can help achieving a better performance within the same resource constraints.Firstly,the Bayesian Cramer-Rao bound(BCRB)is derived from it.Secondly,a criterion for minimizing the BCRB at the target location among all targets tracking in a certain range is derived.Thirdly,the optimization problem involved with three variable vectors is formulated,which can be simplified by deriving the relationship between the optimal power allocation vector and the bandwidth allocation vector.Then,the simplified optimization problem is solved by the cyclic minimization algorithm incorporated with the sequential parametric convex approximation(SPCA)algorithm.Finally,the validity of the proposed method is demonstrated with simulation results.
基金supported by in part by the National Natural Science Foundation of China under Grant Nos.71390334 and 71132008the MOE Project of Key Research Institute of Humanities and Social Sciences at Universities under Grant No.11JJD630004Program for New Century Excellent Talents in University under Grant No.NCET-13-0660
文摘This paper generalizes the classic resource allocation problem to the resource planning and allocation problem, in which the resource itself is a decision variable and the cost of each activity is uncertain when the resource is determined. The authors formulate this problem as a two-stage stochastic programming. The authors first propose an efficient algorithm for the case with finite states. Then, a sudgradient method is proposed for the general case and it is shown that the simple algorithm for the unique state case can be used to compute the subgradient of the objective function. Numerical experiments are conducted to show the effectiveness of the model.
基金the National Natural Science Foundation of China (60572039 60432040)
文摘To minimize the overall transmit power while maintaining a constant data rate and target BER, a downlink adaptive resource allocation algorithm with jointing the exclusive manner and the shared manner is proposed for multiuser MIMO-OFDM system in correlated channels. The algorithm allocates all the subcarriers to different users according to their spatial correlations. The users with high spatial correlation are allocated in the same group and the exclusive manner is applied. The shared manner with an improved null broadening method, which improves the performance of co-channel interference （CCI） suppression and decreases the number of transmit antennas required, is applied between the different group users. As the user＇s direction of departure （DOD） changes very slowly, a looking up table method is used to reduce the computational complexity. The simulation results show that despite the angle spread of DOD, when compared with the exclusive manner, the proposed algorithm improves the spectral efficiency, and when compared with the TDMA-ZF （zero forcing） shared manner, the proposed algorithm decreases the total transmit power by at least 1 dB.
基金supported by the National High Technology Research and Development Program of China (863 program) (2006AA01Z270)the National Major Specialized Project of Science and Technology(2009ZX03003-003+4 种基金 2009ZX03003-004)the Fundamental Research Funds for the Central University (K50510010017)the Program for Changjiang Scholars and Innovative Research Team in University(IRT0852)the "111" Project (B08038)the Open Research Fund of State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University (RCS2008K003)
文摘To improve the error performance and the resource utilization of cooperative systems, the optimum resource allocation, i.e., power allocation and partner choice, for an adaptive decode-and-forward （DF） cooperative diversity system based on quadrature modulation is investigated. The closed-form expression of the bit error rate （BER） system performance is derived and an optimal power allocation （OPA） algorithm is proposed to optimize the power allocation between the local and relayed signals under the minimum BER criterion. Based on the OPA algorithm, a partner choice strategy is proposed to determine the partner locations specified by various cooperation gains. Simulation results show that the proposed resource optimization algorithms are superior to the unoptimized algorithms by significantly reducing the BER and improving the cooperative gain, which is useful to simplify the practical partner choice process.
基金supported by the National Natural Science Foundation of China(6147219261202004)+1 种基金the Special Fund for Fast Sharing of Science Paper in Net Era by CSTD(2013116)the Natural Science Fund of Higher Education of Jiangsu Province(14KJB520014)
文摘In order to lower the power consumption and improve the coefficient of resource utilization of current cloud computing systems, this paper proposes two resource pre-allocation algorithms based on the ＂shut down the redundant, turn on the demanded＂ strategy here. Firstly, a green cloud computing model is presented, abstracting the task scheduling problem to the virtual machine deployment issue with the virtualization technology. Secondly, the future workloads of system need to be predicted： a cubic exponential smoothing algorithm based on the conservative control（CESCC） strategy is proposed, combining with the current state and resource distribution of system, in order to calculate the demand of resources for the next period of task requests. Then, a multi-objective constrained optimization model of power consumption and a low-energy resource allocation algorithm based on probabilistic matching（RA-PM） are proposed. In order to reduce the power consumption further, the resource allocation algorithm based on the improved simulated annealing（RA-ISA） is designed with the improved simulated annealing algorithm. Experimental results show that the prediction and conservative control strategy make resource pre-allocation catch up with demands, and improve the efficiency of real-time response and the stability of the system. Both RA-PM and RA-ISA can activate fewer hosts, achieve better load balance among the set of high applicable hosts, maximize the utilization of resources, and greatly reduce the power consumption of cloud computing systems.
基金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.
基金supported by the National Natural Science Fundation of China (61671137)。
文摘Compared with the traditional phased array radar, the co-located multiple-input multiple-output(MIMO) radar is able to transmit orthogonal waveforms to form different illuminating modes, providing a larger freedom degree in radar resource management. In order to implement the effective resource management for the co-located MIMO radar in multi-target tracking,this paper proposes a resource management optimization model,where the system resource consumption and the tracking accuracy requirements are considered comprehensively. An adaptive resource management algorithm for the co-located MIMO radar is obtained based on the proposed model, where the sub-array number, sampling period, transmitting energy, beam direction and working mode are adaptively controlled to realize the time-space resource joint allocation. Simulation results demonstrate the superiority of the proposed algorithm. Furthermore, the co-located MIMO radar using the proposed algorithm can satisfy the predetermined tracking accuracy requirements with less comprehensive cost compared with the phased array radar.
基金Projects(61801237,61701255)supported by the National Natural Science Foundation of ChinaProject(SBH17024)supported by the Postdoctoral Science Foundation of Jiangsu Province,China+2 种基金Project(15KJB510026)supported by the Natural Science Foundation of the Jiangsu Higher Education Institutions,ChinaProject(BK20150866)supported by the Natural Science Foundation of Jiangsu Province,ChinaProjects(NY215046,NY217056)supported by the Introduction of Talent Fund of Nanjing University of Posts and Telecommunications,China
文摘The resource allocation for device-to-device(D2D)multicast communications is investigated.To achieve fair energy efficiency(EE)among different multicast groups,the max-min fairness criterion is used as the optimization criterion and the EE of D2D multicast groups are taken as the optimization objective function.The aim is to maximize the minimum EE for different D2D multicast groups under the constraints of the maximum transmit power and minimum transmit rate,which is modeled as a non-convex and mixed-integer fractional programming problem.Here,suboptimal resource allocation algorithms are proposed to solve this problem.First,channel assignment scheme is performed to assign channel to D2D multicast groups.Second,for a given channel assignment,iterative power allocation schemes with and without loss of cellular users’rate are completed,respectively.Simulation results corroborate the convergence performance of the proposed algorithms.In addition,compared with the traditional throughput maximization algorithm,the proposed algorithms can improve the energy efficiency of the system and the fairness achieved among different multicast groups.
基金supported partly by the Postdoctoral Science Foundation of Chinathe National Natural Science Foundation of China(60572039).
文摘To improve the performance of a multiuser MIMO-OFDM system with imperfect channel status information, a downlink adaptive resource allocation algorithm which combines space-time block coding and beam forming （STBC-BF） is proposed. The algorithm allocates the subcarriers with a shared manner. A zero forcing processing with joint Rx-Tx is used to suppress the co-channel interference （CCI） and to construct uncorrelated channels for STBC. An adaptive power allocation for the STBC equivalent channels can increase signal to interference and noise ratio at the receiver. Simulation results show that under the condition of an imperfect CSI, the proposed algorithm improves the system performance and reduces the number of BS transmit antennas required.
基金supported by the National High Technology Research and Development Program of China (863 Program) (2008AA01Z226)
文摘To minimize the total transmit power for multicast service in an orthogonal frequency division multiplexing（OFDM） downlink system,resource allocation algorithms that adaptively allocate subcarriers and bits are proposed.The proposed algorithms select users with good channel conditions for each subcarrier to reduce the transmit power,while guaranteeing each user＇s instantaneous minimum rate requirement.The resource allocation problem is first formulated as an integer programming（IP） problem,and then,a full search algorithm that achieves an optimal solution is presented.To reduce the computation load,a suboptimal algorithm is proposed.This suboptimal algorithm decouples the joint resource allocation problem by separating subcarrier and bit allocation.Greedy-like algorithms are employed in both procedures.Simulation results illustrate that the proposed algorithms can significantly reduce the transmit power compared with the conventional multicast approach and the performance of the suboptimal algorithm is close to the optimum.
基金Project(60902092) supported by the National Natural Science Foundation of China
文摘Different schemes, which performed channel, power and time allocation to enhance the network performance of overall end-to-end throughput for cooperative cognitive radio network, were investigated. Interference temperature limit of corresponding primary users was considered. Due to the constraints caused by multiple dual channels, the power allocation problem is non-convex and NP-hard. Based on geometric programming (GP), a novel and general algorithm, which turned the problem into a series of GP problems by logarithm approximation (LASGP), was proposed to efficiently solve it. Numerical results verify the efficiency and availability of the LASGP algorithm. Solutions of LASGP are provably convergent and globally optimal point can be observed as well as the channel allocation always outperforms power or timeslot allocation from simulations. Compared with schemes without any allocation, the scheme with joint channel, power and timeslot allocation significantly increases the overall end-to-end throughput by no less than 70% under same simulation conditions. This scheme can not only maximize the throughput by increasing total maximum power of relay node, but also outperform other resource allocation schemes when lower total maximum power of source and relay nodes is restricted. As the total maximum power of source node increases, the scheme with joint channel and timeslot allocation performs best in all schemes.
基金Projects(51007021, 60402004) supported by the National Natural Science Foundation of China
文摘The bits and power allocation model of adaptive power-rate mixture for multi-user multi-server power-line communication systems was analyzed with the restrictions of maximal total power,fixed rate for each real time (RT) user,minimal rate for each non-real time (NRT) user,maximal bits and power for each subcarrier in each orthogonal frequency division multiplexing (OFDM) symbol. An algorithm of resource dynamic allocation in the first OFDM symbol of each frame and resource optimal adjustment in the latter OFDM symbol of each frame was proposed. In the first OFDM symbol of every frame,resource is firstly assigned for RT users so as to minimize their total used power until satisfying their fixed rates; secondly the remainder resource of power and subcarriers are assigned for NRT users so as to minimize their total used power until satisfying their minimal rates also; lastly the remainder resource is again assigned for NRT users according to the proportional fairness strategy so as to maximize their total assigning rate. In the latter OFDM symbol of each frame,bits are swapped and power is adjusted for every user based on the resource allocation results of anterior OFDM symbol. The algorithm is tested in the typical power-line channel scenarios and the simulation results indicate that the proposed algorithm has better performances than the classical multi-user resource allocation algorithms and it realizes the multiple aims of multi-user multi-server resource allocation for power-line communication systems.
基金the National Natural Scientific Foundation of China(61771291,61571272)the Major Science and Technological Innovation Project of Shandong Province(2020CXGC010109).
文摘The joint resource block(RB)allocation and power optimization problem is studied to maximize the sum-rate of the vehicle-to-vehicle(V2V)links in the device-to-device(D2D)-enabled V2V communication system,where one feasible cellular user(FCU)can share its RB with multiple V2V pairs.The problem is first formulated as a nonconvex mixed-integer nonlinear programming(MINLP)problem with constraint of the maximum interference power in the FCU links.Using the game theory,two coalition formation algorithms are proposed to accomplish V2V link partitioning and FCU selection,where the transferable utility functions are introduced to minimize the interference among the V2V links and the FCU links for the optimal RB allocation.The successive convex approximation(SCA)is used to transform the original problem into a convex one and the Lagrangian dual method is further applied to obtain the optimal transmit power of the V2V links.Finally,numerical results demonstrate the efficiency of the proposed resource allocation algorithm in terms of the system sum-rate.
基金supported by the National Natural Science Foundation of China(61271235)the Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions-Information and Communication Engineering
文摘A quality of service（QoS） guaranteed cross-layer resource allocation algorithm with physical layer, medium access control（MAC） layer and call admission control（CAC） considered simultaneously is proposed for the full IP orthogonal frequency division multiple access（OFDMA） communication system, which can ensure the quality of multimedia services in full IP networks.The algorithm converts the physical layer resources such as subcarriers, transmission power, and the QoS metrics into equivalent bandwidth which can be distributed by the base station in all three layers. By this means, the QoS requirements in terms of bit error rate（BER）, transmission delay and dropping probability can be guaranteed by the cross-layer optimal equivalent bandwidth allocation. The numerical results show that the proposed algorithm has higher spectrum efficiency compared to the existing systems.
基金supported by the National Natural Science Foundation of China(6120235461272422)the Scientific and Technological Support Project(Industry)of Jiangsu Province(BE2011189)
文摘Cloud computing represents a novel computing model in the contemporary technology world. In a cloud system, the com- puting power of virtual machines （VMs） and network status can greatly affect the completion time of data intensive tasks. How- ever, most of the current resource allocation policies focus only on network conditions and physical hosts. And the computing power of VMs is largely ignored. This paper proposes a comprehensive resource allocation policy which consists of a data intensive task scheduling algorithm that takes account of computing power of VMs and a VM allocation policy that considers bandwidth between storage nodes and hosts. The VM allocation policy includes VM placement and VM migration algorithms. Related simulations show that the proposed algorithms can greatly reduce the task comple- tion time and keep good load balance of physical hosts at the same time.
