A bypassing path based routing algorithm for the pyramid structures (Q856156)

A pyramid structure belongs to the interconnection distributed architectures, modelling many parallel configurations or arrangements, such as component labelling, image processing (shrinking and expanding), etc. The pyramid structure consists of a connected mesh. To exchange information between computing nodes of the structure, a natural routing algorithm based on links between adjacent nodes is used. In the article, the existence of faulty mesh nodes or links are explicitly considered. When the nodes or links are faulty, it is generally impossible to obtain the effective path for data transmission. Therefore, an alternative routing algorithm based on a collection of bypassing paths is suggested and some of the mathematical properties of those bypassing paths are investigated. Specially, the average length of bypassing paths is studied.