Related papers: Analyzing Distributed Join-Idle-Queue: A Fluid Lim…

In this paper, we consider random access, wireless, multi-hop networks, with multi-packet reception capabilities, where multiple flows are forwarded to the gateways through node disjoint paths. We explore the issue of allocating flow on…

A broad class of parallel server systems is considered, for which we prove the steady-state asymptotic independence of server workloads, as the number of servers goes to infinity, while the system load remains sub-critical. Arriving jobs…

Cloud computing environments often have to deal with random-arrival computational workloads that vary in resource requirements and demand high Quality of Service (QoS) obligations. It is typical that a Service-Level-Agreement (SLA) is…

Processing computation-intensive jobs at multiple processing cores in parallel is essential in many real-world applications. In this paper, we consider an idealised model for job parallelism in which a job can be served simultaneously by…

In large-scale distributed systems, balancing the load in an efficient way is crucial in order to achieve low latency. Recently, some load balancing policies have been suggested which are able to achieve a bounded maximum queue length in…

The load-balancing system, built on the basis of a subsystem load balancer and subsystem control and monitoring that closely interact with each other was propose in work. This system is presented as a queuing system with priority service…

In the present paper, we study the evolution of an overloaded cyclic polling model that starts empty. Exploiting a connection with multitype branching processes, we derive fluid asymptotics for the joint queue length process. Under passage…

We consider a natural scheduling problem which arises in many distributed computing frameworks. Jobs with diverse resource requirements (e.g. memory requirements) arrive over time and must be served by a cluster of servers, each with a…

Join-the-shortest queue (JSQ) and its variants have often been used in solving load balancing problems. The aim of such policies is to minimize the average system occupation, e.g., the customer's system time. In this work we extend the…

We consider a request processing system composed of organizations and their servers connected by the Internet. The latency a user observes is a sum of communication delays and the time needed to handle the request on a server. The handling…

Hierarchical edge-cloud computing-aided Internet of Things (IoT) networks offer low-latency and cost-efficient services to a growing number of data-intensive IoT devices. However, optimizing service placement, which involves determining the…

We consider a fluid queue where the input process consists of N identical sources that turn on and off at exponential waiting times. The server works at the constant rate c and an on source generates fluid at unit rate. This model was first…

In this paper, we consider a load balancing system under a general pull-based policy. In particular, each arrival is randomly dispatched to one of the servers whose queue lengths are below a threshold, if there are any; otherwise, this…

We consider the problem of scheduling in multi-class, parallel-server queuing systems with uncertain rewards from job-server assignments. In this scenario, jobs incur holding costs while awaiting completion, and job-server assignments yield…

This paper studies a diffusion model that arises as the limit of a queueing system scheduling problem in the asymptotic heavy traffic regime of Halfin and Whitt. The queueing system consists of several customer classes and many servers…

We consider a system of N queues with decentralized load balancing such as power-of-D strategies(where D may depend on N) and generic scheduling disciplines. To measure the dependence of the queues, we use the clan of ancestors, a technique…

In traditional priority queues, we assume that every customer upon arrival has a fixed, class-dependent priority, and that a customer may not commence service if a customer with a higher priority is present in the queue. However, in…

Distributed ledgers, including blockchain and other decentralized databases, are designed to store information online where all trusted network members can update the data with transparency. The dynamics of ledger's development can be…

In several smart city applications, multiple resources must be allocated among competing agents that are coupled through such shared resources and are constrained --- either through limitations of communication infrastructure or privacy…

We present a distributed algorithm for joint power control, routing and scheduling in multihop wireless networks. The algorithm also provides for Quality of Service (QoS) guarantees, namely, end-to-end mean delay guarantees and hard…