A unified theory for a traffic analysis in product networks

Instead of providing separate solutions for each individual network, a unified theory is desirable to cover the study of a class of networks. Cartesian product graphs provide a common framework to investigate the performance of several individual networks. This paper addresses communication capabilities of product networks. It presents a unified theory to evaluate the traffic intensity and the saturation level of product networks. We have theoretically computed the traffic intensity and the saturation level. Examples of product networks that have been investigated are multidimensional meshes, multidimensional tori, and r-ary n-cube networks