TY - JOUR
T1 - Performance of Hypercube Routing Schemes With or Without Buffering
AU - Varvarigos, Emmanouel A.
AU - Bertsekas, Dimitri P.
N1 - Funding Information:
Manuscript received December 15, 1992; revised September 1, 1993; approved by IEEWACM TRANSACTIONSO N NETWORKINEGdi tor I. Cidon. This work was supported by the NSF under Grants NSF-DDM-8903385 and NSF-RIA-08930554, and by the ARO under Grants DAAL03-86-K-0171 and DAAL03-92-G-0309. E. A. Varvarigos is with the Department of Electrical and Computer Engineering, University of Califomia, Santa Barbara, CA 93106 USA. D. P. Bertsekas is with the Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA 02139 USA. IEEE Log Number 9403687.
PY - 1994/6
Y1 - 1994/6
N2 - We consider two different hypercube routing schemes, which we call the simple and the priority schemes. We evaluate the throughput of both the unbuffered and the buffered version of these schemes for random multiple node-to-node communications. The results obtained are approximate, but very accurate as simulations indicate, and are given in particularly interesting forms. We find that little buffer space (between one and three packets per link) is necessary to achieve throughput close to that of the infinite buffer case. We also consider two deflection routing schemes, called the simple nonwasting deflection and the priority nonwasting deflection schemes. We evaluate their throughput using simulations, and compare it to that of the priority scheme.
AB - We consider two different hypercube routing schemes, which we call the simple and the priority schemes. We evaluate the throughput of both the unbuffered and the buffered version of these schemes for random multiple node-to-node communications. The results obtained are approximate, but very accurate as simulations indicate, and are given in particularly interesting forms. We find that little buffer space (between one and three packets per link) is necessary to achieve throughput close to that of the infinite buffer case. We also consider two deflection routing schemes, called the simple nonwasting deflection and the priority nonwasting deflection schemes. We evaluate their throughput using simulations, and compare it to that of the priority scheme.
UR - http://www.scopus.com/inward/record.url?scp=0028460132&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0028460132&partnerID=8YFLogxK
U2 - 10.1109/90.311628
DO - 10.1109/90.311628
M3 - Article
AN - SCOPUS:0028460132
SN - 1063-6692
VL - 2
SP - 299
EP - 311
JO - IEEE/ACM Transactions on Networking
JF - IEEE/ACM Transactions on Networking
IS - 3
ER -