A variety of modern data analysis problems, ranging from finance to job scheduling, can be considered as online resource allocation (ORA) problems. A key consideration in such ORA problems is some notion of risk, and suitable ways to alleviate risk. In several settings, the risk is structured so that groups of assets, such as stocks, are exposed to similar risks. In this paper, we present a for...

In cloud computing, resource allocation and scheduling of multiple composite web services is an important and challenging problem. This is especially so in a hybrid cloud where there may be some lowcost resources available from private clouds and some high-cost resources from public clouds. Meeting this challenge involves two classical computational problems: one is assigning resources to each ...

Many real projects complete through the realization of one and only one path of various possible network paths. Here, these networks are called alternative stochastic networks (ASNs). It is supposed that the nodes of considered network are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of the network. This a...

Resource allocation techniques have recently appeared as a widely recognized feature in LTE networks. Most of existing approaches in resource allocation focus on maximizing network’s utility functions. The great potential of utility function in improving resource allocation and enhancing fairness and mean opinion score (MOS) indexes has attracted large efforts over the last few years. In this p...

This article presents a new method to solve dynamic sensor fusion problem. We consider large number of remote sensors which measure common Gauss–Markov process. Each encodes and transmits its measurement data center through resource restricted communication network. The cost incurred by given is quantified as the expected bitrate from center. propose an approach that attempts minimize weighted ...

in dea to obtain an efficient representation in ccr andbcc models for each dmu only one linear plan would be solved; however,it is possible in centralized resource allocation (cra) to solve allthe dmus by one linear planning. in this paper, models of centralizedresource allocation in input-oriented and in dynamic case will be offeredand by using dynamic sbm, the representation of dmus in each t...

Wireless communication networks have recently attracted significant research attention. As a critical issue for improving network performance, efficient and intelligent resource allocation strategies have been intensively studied. This thesis consists of two studies on resource allocation strategy, specifically, joint bandwidth and power allocation strategy, for wireless communication networks ...

While heterogeneous cellular networks offer the potential to improve network performance by augmenting coverage and enhancing traffic capacity, resource allocation is extremely complicated due to the heterogeneous and unplanned nature of base station deployments. In this paper, we present SortingHat, a tractable optimization model which leverages the advantages of the different heterogeneous co...