Exact Formulas for the Average Internode Distance in Mesh and Binary Tree Networks

The average internode distancein an interconnection network (or its average distance for short) is an indicator of expected message latency in that network under light and moderate network traffic. Unfortunately, it is not always easy to find an exact value for the average internode distance, particularly for networks that are not node-symmetric, because the computation must be repeated for many classes of nodes. In this short paper, we derive exact formulas for the average internode distance in mesh and complete binary tree networks.

[1]  Behrooz Parhami.  Introduction to Parallel Processing , 2002, Series in Computer Science.

[2]  Sudhakar Yalamanchili,et al.  Interconnection Networks: An Engineering Approach , 2002 .

[3]  Behrooz Parhami,et al.  Introduction to Parallel Processing: Algorithms and Architectures , 1999 .

[4]  Miguel Rio,et al.  Network topologies: inference, modeling, and generation , 2008, IEEE Communications Surveys & Tutorials.

[5]  Junming Xu.  Topological Structure and Analysis of Interconnection Networks , 2002, Network Theory and Applications.

[6]  Bruce M. Maggs.  A critical look at three of parallel computing's maxims , 1996, Proceedings Second International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'96).

[7]  John K. Antonio,et al.  Is an alligator better than an armadillo? [interconnection networks] , 1997, IEEE Concurrency.

[8]  Chi-Hsiang Yeh,et al.  Why Network Diameter is Still Important , 2000 .

[9]  Sudhakar Yalamanchili,et al.  Interconnection Networks , 2011, Encyclopedia of Parallel Computing.