• Open Access IconOpen Access
  • Cite Icon57
  • https://doi.org/10.1214/18-aap1437Copy DOI Icon

Supermarket model on graphs

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We consider a variation of the supermarket model in which the servers can communicate with their neighbors and where the neighborhood relationships are described in terms of a suitable graph. Tasks with unit-exponential service time distributions arrive at each vertex as independent Poisson processes with rate $\lambda$, and each task is irrevocably assigned to the shortest queue among the one it first appears and its $d-1$ randomly selected neighbors. This model has been extensively studied when the underlying graph is a clique in which case it reduces to the well known power-of-$d$ scheme. In particular, results of Mitzenmacher (1996) and Vvedenskaya et al. (1996) show that as the size of the clique gets large, the occupancy process associated with the queue-lengths at the various servers converges to a deterministic limit described by an infinite system of ordinary differential equations (ODE). In this work, we consider settings where the underlying graph need not be a clique and is allowed to be suitably sparse. We show that if the minimum degree approaches infinity (however slowly) as the number of servers $N$ approaches infinity, and the ratio between the maximum degree and the minimum degree in each connected component approaches 1 uniformly, the occupancy process converges to the same system of ODE as the classical supermarket model. In particular, the asymptotic behavior of the occupancy process is insensitive to the precise network topology. We also study the case where the graph sequence is random, with the $N$-th graph given as an Erd\H{o}s-R\'enyi random graph on $N$ vertices with average degree $c(N)$. Annealed convergence of the occupancy process to the same deterministic limit is established under the condition $c(N)\to\infty$, and under a stronger condition $c(N)/\ln N\to\infty$, convergence (in probability) is shown for almost every realization of the random graph.

Similar Papers
  • Research Article
  • Citations20

The Artificial Hamiltonian, First Integrals, and Closed-Form Solutions of Dynamical Systems for Epidemics

  • Mar 08, 2018
  • Zeitschrift für Naturforschung A
  • Rehana Naz +1
  • Conference Article
  • Citations2

New trends and solutions for the simulation of electrical circuits using a discrete event approach

  • Nov 01, 2009
  • L Capocchi +4
  • Research Article

Optimal estimation of unknown data of periodic boundary value problems for first order linear impulsive systems of ordinary differential equations from indirect noisy observations of their solutions

  • Jan 01, 2021
  • Mathematical Modeling and Computing
  • O G Nakonechnyi +1
  • Book Chapter

10 - Applications of Systems of Ordinary Differential Equations

  • Jan 01, 1994
  • Differential Equations with Maple V®
  • Martha L Abell +1
  • Book Chapter
  • Citations2

3 - LINEAR SYSTEMS

  • Jan 01, 1982
  • Ordinary Differential Equations
  • Richard K Miller +1
  • Research Article

ON THE EXISTENCE OF PERIODIC SOLUTIONS OF A SYSTEM OF ORDINARY DIFFERENTIAL EQUATIONS OF THE SECOND ORDER WITH QUASI-HOMOGENEOUS NON-LINEARITY

  • Dec 15, 2024
  • Дифференциальные уравнения
  • A N Naimov +1
  • Research Article
  • Citations44

An effective modification of the homotopy perturbation method for stiff systems of ordinary differential equations

  • Mar 24, 2011
  • Applied Mathematics Letters
  • Hossein Aminikhah +1
  • Research Article
  • Citations8

Foundations of the Theory of Lie Groups With Real Parameters

  • Jul 01, 1943
  • The Annals of Mathematics
  • P A Smith
  • Book Chapter
  • Citations2

Marchuk’s Models of Infection Diseases: New Developments

  • Jan 01, 2021
  • Irina Volinsky +3
  • Research Article
  • Citations62

Heat transfer of Maxwell base fluid flow of nanomaterial with MHD over a vertical moving surface

  • Jun 01, 2020
  • Alexandria Engineering Journal
  • Sohail Nadeem +2
  • PDF
  • Research Article
  • Citations1

Approximate Methods for Solving Problems of Mathematical Physics on Neural Hopfield Networks

  • Jun 24, 2022
  • Mathematics
  • Ilya Boykov +2
  • Book Chapter

71 - Integrable Combinations

  • Jan 01, 1992
  • Handbook of Differential Equations
  • Daniel Zwillinger
  • Conference Article
  • Citations1

A 1D Real-Time Engine Manifold Gas Dynamics Model Using Orthogonal Collocation Coupled with the Method of Characteristics

  • Apr 02, 2019
  • SAE technical papers on CD-ROM/SAE technical paper series
  • Amer Keblawi +1
  • Research Article
  • Citations16

Inference of hidden variables in systems of differential equations with genetic programming

  • Nov 13, 2012
  • Genetic Programming and Evolvable Machines
  • Theodore W Cornforth +1
  • Conference Article

On the integration of a class of nonlinear systems of ordinary differential equations

  • Jan 01, 2017
  • AIP conference proceedings
  • Aleksandr A Talyshev
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.