Journals Information
Computer Science and Information Technology Vol. 1(2), pp. 165 - 168
DOI: 10.13189/csit.2013.010214
Reprint (PDF) (182Kb)
Exact Formulas for the Average Internode Distance in Mesh and Binary Tree Networks
Behrooz Parhami*
Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA 93106-9560, USA
ABSTRACT
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.
KEYWORDS
Complete Binary Tree, Diameter, Expected Message Latency, Graph Theory, Interconnection Network, Linear Array, Mesh Network, Parallel Processing, Ring Network, Routing Algorithm, Torus Network
Cite This Paper in IEEE or APA Citation Styles
(a). IEEE Format:
[1] Behrooz Parhami , "Exact Formulas for the Average Internode Distance in Mesh and Binary Tree Networks," Computer Science and Information Technology, Vol. 1, No. 2, pp. 165 - 168, 2013. DOI: 10.13189/csit.2013.010214.
(b). APA Format:
Behrooz Parhami (2013). Exact Formulas for the Average Internode Distance in Mesh and Binary Tree Networks. Computer Science and Information Technology, 1(2), 165 - 168. DOI: 10.13189/csit.2013.010214.