Data networks
Hypercube algorithms: with applications to image processing and pattern recognition
Hypercube algorithms: with applications to image processing and pattern recognition
Linear recursive networks and their applications in topological design and data routing
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Network Topology Optimization
Distributed Computing Network Reliability
Distributed Computing Network Reliability
Fibonacci Cubes-A New Interconnection Topology
IEEE Transactions on Parallel and Distributed Systems
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Recursive Cube of Rings: A New Topology for Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant routing on complete Josephus Cubes
ACSAC '01 Proceedings of the 6th Australasian conference on Computer systems architecture
Fault-tolerance of Complete Josephus Cubes
Journal of Systems Architecture: the EUROMICRO Journal
Fault-tolerant routing for complete Josephus cubes
Parallel Computing - Special issue: High-performance parallel bio-computing
The Josephus Cube: analysis of routing and fault tolerance
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
We present a new class of interconnection topologies called the Linear Recursive Networks (LRNs) and examine their possible applications in distributed systems. Each LRN is characterized by a recursive pattern of interconnection which can be specified by simple parameters. Basic properties such as node degree, diameter, and the performance of routing algorithms for all LRNs are then collectively analyzed in terms of these parameters. By choosing appropriate values for the parameters, our results can assist a network designer in selecting a topology with required routing performance and cost of interconnection. A subclass of LRNs, called Congruent LRNs (CLRNs), is also identified here and shown to possess desirable properties for more tightly coupled systems. It is shown that the CLRNs include existing networks such as hypercube and generalized Fibonacci cubes. These results suggest that the linear recursive networks potentially have applications in interconnecting distributed systems.