A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Combinatorial properties of generalized hypercube graphs
Information Processing Letters
Fault Diameter of k-ary n-cube Networks
IEEE Transactions on Parallel and Distributed Systems
Node-to-set disjoint paths problem in star graphs
Information Processing Letters
Introduction to Parallel Processing: Algorithms and Architectures
Introduction to Parallel Processing: Algorithms and Architectures
Problems with Comparing Interconnection Networks: Is an Alligator Better Than an Armadillo?
IEEE Parallel & Distributed Technology: Systems & Technology
A Comparative Study of Topological Properties of Hypercubes and Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Topology Optimization of Interconnection Networks
IEEE Computer Architecture Letters
An algorithm for disjoint paths in bubble-sort graphs
Systems and Computers in Japan
Internode Distance and Optimal Routing in a Class of Alternating Group Networks
IEEE Transactions on Computers
Generalized Hypercube and Hyperbus Structures for a Computer Network
IEEE Transactions on Computers
Constructing vertex-disjoint paths in (n, k)-star graphs
Information Sciences: an International Journal
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
A survey and comparison of peer-to-peer overlay network schemes
IEEE Communications Surveys & Tutorials
Network topologies: inference, modeling, and generation
IEEE Communications Surveys & Tutorials
Conditional diagnosability of alternating group networks
Information Processing Letters
| Hi-index | 0.00 |
The existence of parallel node-disjoint paths between any pair of nodes is a desirable property of interconnection networks, because such paths allow tolerance to node and/or link failures along some of the paths, without causing disconnection. Additionally, node-disjoint paths support high-throughput communication via the concurrent transmission of parts of a message. We characterize maximum-sized families of parallel paths between any two nodes of alternating group networks. More specifically, we establish that in a given alternating group network AN n , there exist n驴1 parallel paths (the maximum possible, given the node degree of n驴1) between any pair of nodes. Furthermore, we demonstrate that these parallel paths are optimal or near-optimal, in the sense of their lengths exceeding the internode distance by no more than four. We also show that the wide diameter of AN n is at most one unit greater than the known lower bound D+1, where D is the network diameter.