| 1. |
|
|
| 2. |
|
|
| 3. |
- Casimiro Ericsson, Nilo, 1970-
(författare)
-
Revenue Maximization in Resource Allocation : Applications in Wireless Communication Networks
- 2004
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Revenue maximization for network operators is considered as a criterion for resource allocation in wireless cellular networks. A business model encompassing service level agreements between network operators and service providers is presented. Admission control, through price model aware admission policing and service level control, is critical for the provisioning of useful services over a general purpose wireless network. A technical solution consisting of a fast resource scheduler taking into account service requirements and wireless channel properties, a service level controller that provides the scheduler with a reasonable load, and an admission policy to uphold the service level agreements and maximize revenue, is presented.Two different types of service level controllers are presented and implemented. One is based on a scalar PID controller, that adjusts the admitted data rates for all active clients. The other one is obtained with linear programming methods, that optimally assign data rates to clients, given their channel qualities and price models.Two new scheduling criteria, and algorithms based on them, are presented and evaluated in a simulated wireless environment. One is based on a quadratic criterion, and is implemented through approximative algorithms, encompassing a search based algorithm and two different linearizations of the criterion. The second one is based on statistical measures of the service rates and channel states, and is implemented as an approximation of the joint probability of achieving the delay limits while utilizing the available resources efficiently.Two scheduling algorithms, one based on each criterion, are tested in combination with each of the service level controllers, and evaluated in terms of throughput, delay, and computational complexity, using a target test system. Results show that both schedulers can, when feasible, meet explicit throughput and delay requirements, while at the same time allowing the service level controller to maximize revenue by allocating the surplus resources to less demanding services.
|
|
| 4. |
|
|
| 5. |
|
|
| 6. |
|
|
| 7. |
- Johansson, Mathias, 1976-
(författare)
-
Resource Allocation under Uncertainty : Applications in Mobile Communications
- 2004
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- This thesis is concerned with scheduling the use of resources, or allocating resources, so as to meet future demands for the entities produced by the resources. We consider applications in mobile communications such as scheduling users' transmissions so that the amount of transmitted information is maximized, and scenarios in the manufacturing industry where the task is to distribute work among production units so as to minimize the number of missed orders.The allocation decisions are complicated by a lack of information concerning the future demand and possibly also about the capacities of the available resources. We therefore resort to using probability theory and the maximum entropy principle as a means for making rational decisions under uncertainty.By using probabilities interpreted as a reasonable degree of belief, we find optimum decision rules for the manufacturing problem, bidding under uncertainty in a certain type of auctions, scheduling users in communications with uncertain channel qualities and uncertain arrival rates, quantization of channel information, partitioning bandwidth between interfering and non-interfering areas in cellular networks, hand-overs and admission control. Moreover, a new method for making optimum approximate Bayesian inference is introduced.We further discuss reasonable optimization criteria for the mentioned applications, and provide an introduction to the topic of probability theory as an extension to two-valued logic. It is argued that this view unifies a wide range of resource-allocation problems, and we discuss various directions for further research.
|
|
| 8. |
|
|
| 9. |
|
|
| 10. |
|
|
