Abstract
Queueing network models with dynamic routing based on the principle of balanced load, were proposed. The principle of dynamic routing was to select a server with the shortest queue among a sample collection of servers chosen at random. The network model and the limiting properties of the networks as N → ∞ were also given.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 128 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| State | Published - 2002 |
| Event | 2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland Duration: Jun 30 2002 → Jul 5 2002 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics