Nayebi - Sharif University of Technology Azadi av., Tehran, Iran
Shamaei - Sharif University of Technology Azadi av., Tehran, Iran
Miremadi - Sharif University of Technology Azadi av., Tehran, Iran

This paper presents a detailed traffic analysis of f-cube routing algorithm. Per-node traffic analysis illustrates the traffic hotspots caused by fault regions and provides a great assistance in developing fault tolerant routing algorithms. Moreover, the effect of a traffic hotspot on the traffic of neighbor nodes and global performance degradation is investigated, here. Currently, some coarse measures like global network latency are used to compare routing protocols. These measures do not provide enough insight of traffic distribution in presence of different fault regions. To analyze the per-node traffic, some per-node traffic measures are introduced here and one of them is selected for the rest of work. Different fault regions (single node, vertical line, horizontal line, and rectangular) in different places of a mesh network are simulated and the results are compared and interpreted. In an effort to gain deep understanding of the issue of traffic analysis of faulty networks, this paper is the first attempt to investigate per-node traffic around fault regions.

Fault-tolerant routing, multi-computer networks, mesh topology, traffic distribution, f-cube routing