METHOD OF FAULT TOLERANT ROUTING IN DISTRIBUTED SYSTEMS BASED ON NON-BINARY DE BRUJIN TOPOLOGY
Abstract
The article considers a new method of routing in a system based on de Brujin topology, which is based on alphabetical decomposition and routing trees. Advantages and disadvantages compared to methods based on elementary transformations and based on simple decomposition into trees are considered