Related papers: Size-Aware Dispatching to Fluid Queues
We consider a probabilistic model for large-scale task allocation problems for multi-agent systems, aiming to determine an optimal deployment strategy that minimizes the overall transport cost. Specifically, we assign transportation agents…
In transportation systems (e.g. highways, railways, airports), traffic flows with distinct origin-destination pairs usually share common facilities and interact extensively. Such interaction is typically stochastic due to natural…
Distribution systems hold a very significant position in the power system since it is the main point of link between bulk power and consumers. A planned and effective distribution network is the key to cope up with the ever increasing…
Ride-sourcing platforms enable an on-demand shared transport service by solving decision problems often related to customer matching, pricing and vehicle routing. These problems have been frequently represented using aggregated mathematical…
The Traffic Assignment Problem is a fundamental, yet computationally expensive, task in transportation modeling, especially for large-scale networks. Traditional methods require iterative simulations to reach equilibrium, making real-time…
We study a stochastic network that consists of a set of servers processing multiple classes of jobs. Each class of jobs requires a concurrent occupancy of several servers while being processed, and each server is shared among the job…
Macroscopic link-based flow models are efficient for simulating flow propagation in urban road networks. Existing link-based flow models described traffic states of a link with two state variables of link inflow and outflow and assumed…
Real world networks are often subject to severe uncertainties which need to be addressed by any reliable prescriptive model. In the context of the maximum flow problem subject to arc failure, robust models have gained particular attention.…
The basic load balancing scenario involves a single dispatcher where tasks arrive that must immediately be forwarded to one of $N$ single-server queues. We discuss recent advances on scalable load balancing schemes which provide favorable…
Control of multihop Wireless networks in a distributed manner while providing end-to-end delay requirements for different flows, is a challenging problem. Using the notions of Draining Time and Discrete Review from the theory of fluid…
Understanding transport processes in complex nanoscale systems, like ionic conductivities in nanofluidic devices or heat conduction in low dimensional solids, poses the problem of examining fluctuations of currents within nonequilibrium…
We study a single server queue under a processor-sharing type of scheduling policy, where the weights for determining the sharing are given by functions of each job's remaining service(processing) amount, and obtain a fluid limit for the…
We examine the dynamic network flow problem under the assumption that the flow consists of discrete units. The dynamic network flow problem is commonly addressed in the context of developing evacuation plans, where the flow is typically…
Randomized load balancing networks arise in a variety of applications, and allow for efficient sharing of resources, while being relatively easy to implement. We consider a network of parallel queues in which incoming jobs with independent…
Currently, there is no general theory for deriving diffusion approximations of queueing systems with high- or infinite-dimensional state descriptors. In this paper, we explore one path for deriving diffusion limit equations of queueing…
We study d-way balanced allocation, which assigns each incoming job to the lightest loaded among d randomly chosen servers. While prior work has extensively studied the performance of the basic scheme, there has been less published work on…
Recent workload measurements in Google data centers provide an opportunity to challenge existing models and, more broadly, to enhance the understanding of dispatching policies in computing clusters. Through extensive data-driven…
Flow-based models typically define a latent space with dimensionality identical to the observational space. In many problems, however, the data does not populate the full ambient data space that they natively reside in, rather inhabiting a…
We consider a queueing network in which there are constraints on which queues may be served simultaneously; such networks may be used to model input-queued switches and wireless networks. The scheduling policy for such a network specifies…
In this paper we introduced Modified Sized-based Queue Management as a dropping scheme that aims to fairly prioritize and allocate more service to VoIP traffic over bulk data like FTP as the former one usually has small packet size with…