Zobrazeno 1 - 10
of 184
pro vyhledávání: '"Bramson, Maury"'
Autor:
Bramson, Maury
Under the last-in, first-out (LIFO) discipline, jobs arriving later at a class always receive priority of service over earlier arrivals at any class belonging to the same station. Subcritical LIFO queueing networks with Poisson external arrivals are
Externí odkaz:
http://arxiv.org/abs/2105.00608
Consider a switched queueing network with general routing among its queues. The MaxWeight policy assigns available service by maximizing the objective function $\sum_j Q_j \sigma_j$ among the different feasible service options, where $Q_j$ denotes qu
Externí odkaz:
http://arxiv.org/abs/1909.10825
We consider a family of discrete time multihop switched queueing networks where each packet moves along a fixed route. In this setting, BackPressure is the canonical choice of scheduling policy; this policy has the virtues of possessing a maximal sta
Externí odkaz:
http://arxiv.org/abs/1412.4390
Let $\eta^*_n$ denote the maximum, at time $n$, of a nonlattice one-dimensional branching random walk $\eta_n$ possessing (enough) exponential moments. In a seminal paper, Aidekon demonstrated convergence of $\eta^*_n$ in law, after recentering, and
Externí odkaz:
http://arxiv.org/abs/1404.3423
We consider the two-dimensional Gaussian Free Field on a box of side length $N$, with Dirichlet boundary data, and prove the convergence of the law of the recentered maximum of the field.
Comment: 48 pages, 2 figures. Added in v3 Theorem 2.5 (al
Comment: 48 pages, 2 figures. Added in v3 Theorem 2.5 (al
Externí odkaz:
http://arxiv.org/abs/1301.6669
In this paper, we consider pursuit-evasion and probabilistic consequences of some geometric notions for bounded and suitably regular domains in Euclidean space that are CAT(kappa) for some kappa > 0. These geometric notions are useful for analyzing t
Externí odkaz:
http://arxiv.org/abs/1207.0597
Publikováno v:
Annals of Applied Probability 2013, Vol. 23, No. 5, 1841-1878
In join the shortest queue networks, incoming jobs are assigned to the shortest queue from among a randomly chosen subset of $D$ queues, in a system of $N$ queues; after completion of service at its queue, a job leaves the network. We also assume tha
Externí odkaz:
http://arxiv.org/abs/1106.4582
Autor:
Bramson, Maury
Publikováno v:
Annals of Applied Probability 2010, Vol. 20, No. 3, 1126-1176
There has recently been considerable interest in the stability of different fair bandwidth sharing policies for models that arise in the context of Internet congestion control. Here, we consider a connection level model, introduced by Massouli\'{e} a
Externí odkaz:
http://arxiv.org/abs/1010.3142