Control and mapping algorithms for a double tree (DOT) network
R. MITTAL, N.K. Nanda · International Journal of Electronics · 1987
In this paper an attempt has been made to analyse the characteristics of an irregular type of β-network specifically called a double-tree (DOT) network. A general path allocation algorithm giving the number of paths of various lengths between a source destination pair has been proposed. A control algorithm has also been formulated to give the values of the flip-control signals required for setting a path between a particular source destination pair of a 2 m × 2 m DOT network. Additionally, given the flip-control settings of a 2 m × 2 m DOT network algorithm to enumerate all possible alternative paths of various lengths, complete I-O mapping has been developed.