Zobrazeno 1 - 10
of 106
pro vyhledávání: '"Borst, Sem C."'
We consider a model inspired by compatibility constraints that arise between tasks and servers in data centers, cloud computing systems and content delivery networks. The constraints are represented by a bipartite graph or network that interconnects
Externí odkaz:
http://arxiv.org/abs/2404.06485
Consider a network of $n$ single-server queues where tasks arrive independently at each of the servers at rate $\lambda_n$. The servers are interconnected by a graph that is resampled at rate $\mu_n$ in a way that is symmetric with respect to the ser
Externí odkaz:
http://arxiv.org/abs/2305.13054
Publikováno v:
Stochastic systems, 13(2):211-246, 2023
Consider a service system where incoming tasks are instantaneously dispatched to one out of many heterogeneous server pools. Associated with each server pool is a concave utility function which depends on the class of the server pool and its current
Externí odkaz:
http://arxiv.org/abs/2112.08958
Consider a system of identical server pools where tasks with exponentially distributed service times arrive as a time-inhomogenenous Poisson process. An admission threshold is used in an inner control loop to assign incoming tasks to server pools whi
Externí odkaz:
http://arxiv.org/abs/2012.10142
Autor:
Goldsztajn, Diego, Borst, Sem C., van Leeuwaarden, Johan S. H., Mukherjee, Debankur, Whiting, Philip A.
Publikováno v:
INFORMS Journal on Computing, 34(1):39-54, 2022
We consider a large-scale service system where incoming tasks have to be instantaneously dispatched to one out of many parallel server pools. The user-perceived performance degrades with the number of concurrent tasks and the dispatcher aims at maxim
Externí odkaz:
http://arxiv.org/abs/2010.15525
We consider random-access networks where nodes represent servers with a queue and can be either active or inactive. A node deactivates at unit rate, while it activates at a rate that depends on its queue length, provided none of its neighbors is acti
Externí odkaz:
http://arxiv.org/abs/2001.02841
We consider load balancing in service systems with affinity relations between jobs and servers. Specifically, an arriving job can be allocated to a fast, primary server from a particular selection associated with this job or to a secondary server to
Externí odkaz:
http://arxiv.org/abs/1812.10703
Publikováno v:
SIAM Rev. 64 3 (2022) 554-622
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 delay perfo
Externí odkaz:
http://arxiv.org/abs/1806.05444
We present an overview of scalable load balancing algorithms which provide favorable delay performance in large-scale systems, and yet only require minimal implementation overhead. Aimed at a broad audience, the paper starts with an introduction to t
Externí odkaz:
http://arxiv.org/abs/1712.08555
Cascading failure models are typically used to capture the phenomenon where failures possibly trigger further failures in succession, causing knock-on effects. In many networks this ultimately leads to a disintegrated network where the failure propag
Externí odkaz:
http://arxiv.org/abs/1711.04491