Edge computing extends cloud computing by providing a subset of computational resources that are close to the application site, lowering the need for bandwidth and augmenting responsiveness. This allows implementing cloud benefits in critical ...

This paper is a work in progress on the exact computation and bounds of the expected coupling time for finite-state Markov chains. We give an exact formula in terms of generating series. We show how this may help to bound the expected coupling time for ...

We present the marmoteCore software project, an open environment for modeling with Markov chains. This platform aims at providing the general scientific user with tools for creating Markov models and accessing the many solution algorithms available for ...

The min-plus convolution and deconvolution operations are frequently needed in the network calculus for computing performance metrics. However, due to their computational complexity, the operations can become impractical with large data sets. We provide ...

We consider a queueing system with heterogeneous agents. One class of agents demand immediate service, would leave the system if not provided. The second class of customers have longer job requirements and can wait for their turn. We discuss the ...

We consider three parallel service models in which customers of several types are served by several types of servers subject to a bipartite compatibility graph, and the service policy is first come first served. Two of the models have a fixed set of ...

In this paper we introduce the novel framework of distributionally robust games. These are multi-player games where each player models the state of nature using a worst-case distribution, also called adversarial distribution. Thus each player's payoff ...

Naor's [8] celebrated paper studies customer decisions in an observable M/M/1 queue where customers utility from joining the system is is a linear decreasing function of the joined position in queue. Naor derives the optimal threshold strategies for the ...

Routing jobs to parallel servers is a common and important task in today's computer systems. Join-the-shortest-queue (JSQ) routing minimizes the mean response time under rather general settings as long as the servers are identical and service times are ...

With the introduction of ρ-reversibility, the basic notion of reversible Markov chain has been relaxed by allowing a wider range of scenarios. Specifically, the reversibility properties are not just sought on the chain itself, but also on all the ...

We investigate in this paper the implementation of a Cloud-RAN architecture, where several software-based Base Band Units (BBUs) are collocated in a cloud data center. We specifically study several scheduling strategies in order to accelerate the ...

This paper investigates various ways in which the triple trade-off metrics between task response time, subtask dispersion and energy can be improved in split-merge queueing systems. Four ideas, namely dynamic subtask dispersion reduction, state-...

Multicopters are robotic systems with a remarkable degree of freedom and applicability. A significant limitation of all mobile robotic vehicles is the restricted on-board energy storage capacity and consequential limited operation time. Uninterrupted ...

This paper studies properties of continuous-time Markov chains with one class of transient states and at least two absorbing states. We look at a perturbation of the chain that arises by uniformly decreasing all rates to absorption. For this situation, ...

We present an extension of Whittle networks with multiple classes of customers and some signals as defined by Gelenbe. Customers are queued and served according to the balance rules defined for Whittle networks. Signals are not queued and interact with ...

Congestion in road traffic has received substantial attention in the research literature. One popular approach to modelling congesting and user response is the seminal bottleneck model introduced by Vickrey [25]. Here traffic is modelled as a fluid, and ...