Abstract
Massively parallel algorithms are presented for solving systems of fixed point equations, modeling state-dependent routing in large asymmetric circuit-switched networks. Our focus is on the Aggregated Least Busy Alternative (ALBA) routing policy of Mitra, Gibbens and Huang. On a 16384 processor MasPar parallel computer, about a minute is required to compute estimates of the call blocking probabilities for every node-pair, for realistic networks of over 100 nodes. A few hours are required on a high speed workstation.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 67-81 |
| Number of pages | 15 |
| Journal | Performance Evaluation |
| Volume | 20 |
| Issue number | 1-3 |
| DOIs | |
| State | Published - May 1994 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Software
- Modeling and Simulation
- Hardware and Architecture
- Computer Networks and Communications
Fingerprint
Dive into the research topics of 'Fast parallel solution of fixed point equations for the performance evaluation of circuit-switched networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver