CGCarl Graham

Carl Graham

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Carl Graham has a total of 2 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Self-adaptive congestion control for multi-class intermittent connections in a communication network

    by Carl Graham, Philippe Robert

    A Markovian model of the evolution of intermittent connections of various classes in a communication network is established and investigated. Any connection evolves in a way which depends only on its class and the state of the network, in particular as to the route it uses among a subset of the network nodes. It can be either active (ON) when it is transmitting data along its route, or idle (OFF). The congestion of a given node is defined as a functional of the transmission rates of all ON connections going through it, and causes losses and delays to these connections. In order to control this, the ON connections self-adaptively vary their transmission rate in TCP-like fashion. The connections interact through this feedback loop. A Markovian model is provided by the states (OFF, or ON with some transmission rate) of the connections. The number of connections in each class being potentially huge, a mean-field limit result is proved with an appropriate scaling so as to reduce the dimensionality. In the limit, the evolution of the states of the connections can be represented by a non-linear system of stochastic differential equations, of dimension the number of classes. Additionally, it is shown that the corresponding stationary distribution can be expressed by the solution of a fixed-point equation of finite dimension.

  • Open Access

    Interacting multi-class transmissions in large stochastic networks

    by Carl Graham, Philippe Robert

    The mean-field limit of a Markovian model describing the interaction of several classes of permanent connections in a network is analyzed. Each of the connections has a self-adaptive behavior in that its transmission rate along its route depends on the level of congestion of the nodes of the route. Since several classes of connections going through the nodes of the network are considered, an original mean-field result in a multi-class context is established. It is shown that, as the number of connections goes to infinity, the behavior of the different classes of connections can be represented by the solution of an unusual nonlinear stochastic differential equation depending not only on the sample paths of the process, but also on its distribution. Existence and uniqueness results for the solutions of these equations are derived. Properties of their invariant distributions are investigated and it is shown that, under some natural assumptions, they are determined by the solutions of a fixed-point equation in a finite-dimensional space.

  • Open Access

    Convergence of multi-class systems of fixed possibly infinite sizes

    by Carl Graham

    Multi-class systems having possibly both finite and infinite classes are investigated under a natural partial exchangeability assumption. It is proved that the conditional law of such a system, given the vector of the empirical measures of its finite classes and directing measures of its infinite ones (given by the de Finetti Theorem), corresponds to sampling independently from each class, without replacement from the finite classes and i.i.d. from the directing measure for the infinite ones. The equivalence between the convergence of multi-exchangeable systems with fixed class sizes and the convergence of the corresponding vectors of measures is then established.

  • Open Access

    Chaoticity for Multiclass Systems and Exchangeability Within Classes

    by Carl Graham

    Classical results for exchangeable systems of random variables are extended to multiclass systems satisfying a natural partial exchangeability assumption. It is proved that the conditional law of a finite multiclass system, given the value of the vector of the empirical measures of its classes, corresponds to independent uniform orderings of the samples within {each} class, and that a family of such systems converges in law {if and only if} the corresponding empirical measure vectors converge in law. As a corollary, convergence within {each} class to an infinite independent and identically distributed system implies asymptotic independence between {different} classes. A result implying the Hewitt-Savage 0-1 law is also extended.


  • Open Access

    Chaoticity for multi-class systems and exchangeability within classes

    by Carl Graham

    Classical results for exchangeable systems of random variables are extended to multi-class systems satisfying a natural partial exchangeability assumption. It is proved that the conditional law of a finite multi-class system, given the value of the vector of the empirical measures of its classes, corresponds to independent uniform orderings of the samples within each class, and that a family of such systems converges in law if and only if the corresponding empirical measure vectors converge in law. As a corollary, convergence within each class to an infinite i.i.d. system implies asymptotic independence between different classes. A result implying the Hewitt-Savage 0-1 Law is also extended.

  • Open Access

    Out of equilibrium functional central limit theorems for a large network where customers join the shortest of several queues

    by Carl Graham

    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.

  • Open Access

    A functional central limit theorem in equilibrium for a large network in which customers join the shortest of several queues

    by Carl Graham

    We consider N single server infinite buffer queues with service rate beta. Customers arrive at rate N times alpha,choose L queues uniformly, and join the shortest one. The stability condition is alpha strictly less than beta. We study in equilibrium the sequence of the fraction of queues of length at least k, in the large N limit. We prove a functional central limit theorem on an infinite-dimensional Hilbert space with its weak topology, with limit a stationary Ornstein-Uhlenbeck process. We use ergodicity and justify the inversion of limits of long times and large sizes N by a compactness-uniqueness method. The main tool for proving tightness of the ill-known invariant laws and ergodicity of the limit is a global exponential stability result for the nonlinear dynamical system obtained in the functional law of large numbers limit.

  • Chaoticity on path space for a queueing network with selection of the shortest queue among several

    by Carl Graham

    We consider a network with N infinite-buffer queues with service rates λ, and global task arrival rate Nν. Each task is allocated L queues among N with uniform probability and joins the least loaded one, ties being resolved uniformly. We prove Q-chaoticity on path space for chaotic initial conditions and in equilibrium: any fixed finite subnetwork behaves in the limit N goes to infinity as an i.i.d. system of queues of law Q. The law Q is characterized as the unique solution for a non-linear martingale problem; if the initial conditions are q-chaotic, then Q 0 = q, and in equilibrium Q 0 = q ρ is the globally attractive stable point of the Kolmogorov equation corresponding to the martingale problem. This result is equivalent to a law of large numbers on path space with limit Q, and implies a functional law of large numbers with limit (Q t ) t≥0. The significant improvement in buffer utilization, due to the resource pooling coming from the choices, is precisely quantified at the limit.


  • Chaoticity on path space for a queueing network with selection of the shortest queue among several

    by Carl Graham

    We consider a network with N infinite-buffer queues with service rates λ, and global task arrival rate Nν. Each task is allocated L queues among N with uniform probability and joins the least loaded one, ties being resolved uniformly. We prove Q-chaoticity on path space for chaotic initial conditions and in equilibrium: any fixed finite subnetwork behaves in the limit N goes to infinity as an i.i.d. system of queues of law Q. The law Q is characterized as the unique solution for a non-linear martingale problem; if the initial conditions are q-chaotic, then Q0 = q, and in equilibrium Q0 = qρ is the globally attractive stable point of the Kolmogorov equation corresponding to the martingale problem. This result is equivalent to a law of large numbers on path space with limit Q, and implies a functional law of large numbers with limit (Qt)t≥0. The significant improvement in buffer utilization, due to the resource pooling coming from the choices, is precisely quantified at the limit.