Traffic analysis and simulation performance of incomplete hypercubes

The highest link traffic density upper-bound of two for a uniform message distribution in an arbitrarily sized, nonhomogeneous incomplete hypercube efficiently avoids points of potential congestion. Mean latency and throughput results for the simulated model of incomplete hypercube are comparable to the complete hypercube performance results under packet-switching and wormhole routing. Moreover, simulation results for nonuniform message distribution are provided under the sphere of locality and decreasing probability reference.