Revolving hierarchy in a hypercube distributed system

The centralized computation of a global state in a distributed feedback system creates a performance bottleneck. To overcome this problem for a hypercube distributed system, the authors first develop the concept of the nC-Tree and define a revolving permutation on the nodes of the nC-Tree. They define a mapping of hypercube distributed system on a sequence of 2C-Trees with a logical hiercarhical structure. The logical hierarchical structure in conjunction with the revolving permutation defines the revolving hierarchy of the hypercube system. The repeated centralized computation of a global state is performed with uniform loading thereby removing this performance bottleneck