Optimal Network Architectures for Minimizing Average Distance in k-Ary n-Dimensional Mesh Networks

A general expression for the average distance for meshes of any dimension and radix, including unequal radices in different dimensions, valid for any traffic pattern under zero-load condition is formulated rigorously to allow its calculation without network-level simulations. The average distance expression is solved analytically for uniform random traffic and for a set of local random traffic patterns. Hot spot traffic patterns are also considered and the formula is empirically validated by cycle true simulations for uniform random, local, and hot spot traffic.

Provided by: Association for Computing Machinery Topic: Networking Date Added: May 2011 Format: PDF

Find By Topic