TY - JOUR
T1 - Fast parallel solution of fixed point equations for the performance evaluation of circuit-switched networks
AU - Greenberg, Albert G.
AU - Odlyzko, Andrew M.
AU - Rexford, Jennifer
AU - Espinosa, David
PY - 1994/5
Y1 - 1994/5
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0028423248&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0028423248&partnerID=8YFLogxK
U2 - 10.1016/0166-5316(94)90006-X
DO - 10.1016/0166-5316(94)90006-X
M3 - Article
AN - SCOPUS:0028423248
SN - 0166-5316
VL - 20
SP - 67
EP - 81
JO - Performance Evaluation
JF - Performance Evaluation
IS - 1-3
ER -