Optimizing one-to-one data communication on double-loop networks

A double-loop network DL(n; a, b) has n nodes 0, 1, ..., n-1 and 2n links u rarr u+a (mod n) and u rarr u+b (mod n) where u is a node and n, a, and b are positive integers. Since DL(n; a, b) is 2-regular, there are at most two disjoint paths. In this paper, we will optimize one-to-one data communication with the store-arid-forward model and in the packet-switching mode on the double-loop network. We first find two disjoint paths and then partition workloads according to their lengths such that the transferring time is minimized