We present an analytical model to compute the blocking probability in channelized cellular systems with dynamic channel allocation. We model the channel occupancy in a cell by a two-dimensional (2-D) Markov chain, which can be solved to obtain the blocking probability in each cell. We apply our analytical model to linear highway systems with and without lognormal shadowing and then extend it to...

We explore a class of task allocation mechanisms that are incremental and can be tuned to the computational resource limitations of agents. Our focus is on distributed task and resource allocation problems involving coalitions of cooperative agents that must negotiate among themselves on the distribution of tasks. Our emphasis is on the design of mechanisms with desirable real-time and dynamic ...

In leased line services used by ISPs (Internet Service Providers) the bandwidth is fixed, but the traffic changes dynamically. To address this, we propose an auction method for the dynamic allocation of bandwidth to ISPs sharing backbone networks. By the method, backbone networks can be used effectively as each ISP is able to secure bandwidth according to its own policy. The Internet users can ...

Cloud computing has emerged to be a modern computing model based on Internet. This technology can enable organizations and individuals to share state-of-the-art computing resources in pay as you use fashion. Virtualization is the technology that enabled cloud computing to be affordable. The cloud resources are to be utilized optimally. In order to achieve this dynamic resource allocation is the...

Multi/Many-core systems are envisioned to satisfy the ever increasing performance requirements of complex applications in various domains such as embedded and high performance computing (HPC). Such systems need to cater for increasingly dynamic workloads, requiring e cient dynamic resource allocation strategies in order to satisfy hard or soft real-time constraints. This article provides an ext...

This paper discusses the use of cognitive models as augmented metacognition on task allocation for tasks requiring visual attention. In the domain of naval warfare, the complex and dynamic nature of the environment makes that one has to deal with a large number of tasks in parallel. Therefore, humans are often supported by software agents that take over part of these tasks. However, a problem i...

This paper investigates the problem of allocation of database fragments to a network, so that the overall communication cost for processing a given set of transactions is minimized. Presented first is a data allocation algorithm with respect to a "simple strategy" to process transactions. Secondly, we present a dynamic data allocation algorithm which is guaranteed to produce a "locally optimal"...

Computer resource allocation represents a significant challenge particularly for multiprocessor systems, which consist of shared computing resources to be allocated among co-runner processes and threads. While an efficient resource allocation would result in a highly efficient and stable overall multiprocessor system and individual thread performance, ineffective poor resource allocation causes...

In this paper we introduce an architecture for online database services oriented towards consumers. We identify two types of costs| access cost and communication cost. We demonstrate that dynamic allocation of data can minimize these costs. We do so by presenting eecient algorithms based on dynamic allocation; these algorithms optimize access and communication costs for various cost models, acc...

A population game approach for dynamic resource allocation problems Ashkan Pashaie, Lacra Pavel & Christopher J. Damaren To cite this article: Ashkan Pashaie, Lacra Pavel & Christopher J. Damaren (2016): A population game approach for dynamic resource allocation problems, International Journal of Control, DOI: 10.1080/00207179.2016.1231422 To link to this article: http://dx.doi.org/10.1080/0020...