Balancing Queues by Mean Field Interaction

Authors:
Donald A. Dawson;Jiashan Tang;Yiqiang Q. Zhao
Affiliations:
School of Mathematics and Statistics, Carleton University, Ottawa, Canada K1S 5B6;Aff1 Aff2;School of Mathematics and Statistics, Carleton University, Ottawa, Canada K1S 5B6
Venue:
Queueing Systems: Theory and Applications
Year:
2005

Citing 5
Cited 4

Law of large numbers and central limit theorem for unbounded jump mean-field models

Advances in Applied Mathematics
Diffusion approximation for head-of-the-line processor sharing for two parallel queues

SIAM Journal on Applied Mathematics
Sequencing and Routing in Multiclass Queueing Networks Part I: Feedback Regulation

SIAM Journal on Control and Optimization
Fast Jackson Networks with Dynamic Routing

Problems of Information Transmission
The power of two choices in randomized load balancing

The power of two choices in randomized load balancing

Analysis of a reputation system for Mobile Ad-Hoc Networks with liars

Performance Evaluation
MeanField analysis for the evaluation of gossip protocols

ACM SIGMETRICS Performance Evaluation Review
A mean field model for an optical switch with a large number of wavelengths and centralized partial conversion

Performance Evaluation
Mean-field framework for performance evaluation of push-pull gossip protocols

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider a queueing network with N nodes in which queue lengths are balanced through mean-field interaction. When N is large, we study the performance of such a network in terms of limiting results as N goes to infinity.