#### Filter Results:

- Full text PDF available (75)

#### Publication Year

1995

2019

- This year (12)
- Last 5 years (43)
- Last 10 years (73)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

We consider a single class open queueing network, also known as a generalized Jackson network (GJN). A classical result in heavy-traffic theory asserts that the sequence of normalized queue length… (More)

We construct a deterministic fully polynomial time approximationscheme (FPTAS) for computing the total number of matchings in abounded degree graph. Additionally, for an arbitrary graph, weconstruct… (More)

- Don Coppersmith, David Gamarnik, Maxim Sviridenko
- SODA
- 2002

- David Gamarnik, Alexander L. Stolyar
- Queueing Syst.
- 2012

We consider a heterogeneous queueing system consisting of one large pool of O(r) identical servers, where r→∞ is the scaling parameter. The arriving customers belong to one of several classes which… (More)

- Patrick C Eschenfeldt, David Gamarnik
- Math. Oper. Res.
- 2018

We consider queueing systems with n parallel queues under a Join the Shortest Queue (JSQ) policy in the Halfin-Whitt heavy-traffic regime. We use the martingale method to prove that a scaled process… (More)

We find necessary and sufficient conditions for the stability of all work-conserving policies for multiclass fluid queueing networks with two stations. Furthermore, we find new sufficient conditions… (More)

- David Gamarnik
- STOC
- 1999

We investigate the stability of packet routing policies in adversarial queueing networks. We provide a simple classification of networks which are stable under any greedy scheduling policy. We show… (More)

- David Gamarnik, Devavrat Shah, Yehua Wei
- Operations Research
- 2010

We formulate a Belief Propagation (BP) algorithm in the context of the capacitated minimum-cost network flow problem (MCF). Unlike most of the instances of BP studied in the past, the messages of BP… (More)

We study the distribution of steady state queue lengths in multiclass queueing networks under a stable policy We propose a general methodology based on Lyapunov functions for the performance analysis… (More)

We establish the existence of free energy limits for several combinatorial models on Erdös-Rényi graph G(N, ⌊cN⌋) and random r-regular graph G(N, r). For a variety of models, including independent… (More)