Out of equilibrium functional central limit theorems for a large network where customers join the shortest of several queues
| dc.creator | Graham, Carl | |
| dc.date | 2003-12-17 | |
| dc.date | 2004-03-31 | |
| dc.date.accessioned | 2026-07-07T05:04:00Z | |
| dc.date.available | 2026-07-07T05:04:00Z | |
| dc.description | Customers arrive at rate N times alpha on a network of N single server infinite buffer queues, choose L queues uniformly, join the shortest one, and are served there in turn at rate beta. We let N go to infinity.We prove a functional central limit theorem (CLT) for the tails of the empirical measures of the queue occupations,in a Hilbert space with the weak topology, with limit given by an Ornstein-Uhlenbeck process. The a priori assumption is that the initial data converge.This completes a recent functional CLT in equilibrium result for which convergence for the initial data was not known in advance, but was deduced a posteriori from the functional CLT. | |
| dc.description | A new preprint math.PR/0403538, has been written as a combined version of the present preprint and the preprint math.PR/0312334. It is recommended to read the new combined version instead of the two others | |
| dc.identifier | https://arxiv.org/abs/math/0312335 | |
| dc.identifier | http://arxiv.org/abs/math/0312335 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/69634 | |
| dc.subject | Probability | |
| dc.subject | 60K35; 60K25 | |
| dc.title | Out of equilibrium functional central limit theorems for a large network where customers join the shortest of several queues | |
| dc.type | text |