Active node placement in ShuffleNets

A (p,k) ShuffleNet is a type of regular multihop network with kp ^k nodes. If only some of the nodes are extraordinarily busy, these so-called active nodes can be assigned to specific ShuffleNet locations to minimize the average hop count. An exhaustive search for the optimal node placement is not feasible for any reasonable size networks, particularly for networks requiring frequent reconfigurations, i.e. adding and dropping active nodes and changing traffic rates. The authors propose a computationally efficient algorithm that can give near optimal solution to the above problem. The procedures of adding and dropping of active nodes are also described