### Abstract

A model of centralized symmetric message-switched networks is considered, where the messages having a common address must be served in the central node in the order which corresponds to their epochs of arrival to the network. The limit N → ∞ is discussed, where N is the branching number of the network graph. This procedure is inspired by an analogy with statistical mechanics (the mean-field approximation). The corresponding limit theorems are established and the limiting probability distribution for the network response time is obtained. Properties of this distribution are discussed in terms of an associated boundary problem.

Original language | English (US) |
---|---|

Pages (from-to) | 803-825 |

Number of pages | 23 |

Journal | Journal of Statistical Physics |

Volume | 66 |

Issue number | 3-4 |

DOIs | |

State | Published - Feb 1 1992 |

### All Science Journal Classification (ASJC) codes

- Statistical and Nonlinear Physics
- Mathematical Physics

## Fingerprint Dive into the research topics of 'A mean-field limit for a class of queueing networks'. Together they form a unique fingerprint.

## Cite this

*Journal of Statistical Physics*,

*66*(3-4), 803-825. https://doi.org/10.1007/BF01055703