Multiswapped networks and their topological and algorithmic properties

DOI10.1016/j.jcss.2013.06.002zbMath1410.68033OpenAlexW1968065735MaRDI QIDQ394739

Iain A. Stewart

Publication date: 27 January 2014

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2013.06.002

zbMATH Keywords

Cayley graphsconnectivityshortest pathsinterconnection networksbiswapped networkshierarchical interconnection networksmultiswapped networksOTIS networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40) Distributed algorithms (68W15)

Related Items

Using semidirect products of groups to build classes of interconnection networks

Cites Work

• Unnamed Item
• A class of hierarchical graphs as topologies for interconnection networks
• Fully symmetric swapped networks based on bipartite cluster connectivity
• The hamiltonicity of swapped (OTIS) networks built of Hamiltonian component networks
• On pancyclicity properties of OTIS-mesh
• Swapped interconnection networks: Topological, performance, and robustness attributes
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Scalable network architectures using the optical transpose interconnection system (OTIS)