Subnetworks Reliability Analysis of Complete Transposition Networks

Large scale multiprocessor systems based on interconnection networks (graphs) as underlying topologies, have been widely used in nowdays. Thus, the reliability of interconnection networks will directly affect the stability of multiprocessor systems. The strong Menger connectivity is a significant parameter for the reliability evalution of interconnection networks. A connected graph [Formula: see text] is strong Menger (edge) connected if there are [Formula: see text] internally (edge) disjoint paths joining any two vertices [Formula: see text] and [Formula: see text] in [Formula: see text]. This article studies the strong Menger connectivity of complete transposition networks [Formula: see text] when parts of subnetworks are faulty. Let [Formula: see text] be an [Formula: see text]-dimensional subnetwork of [Formula: see text]. We show that [Formula: see text] is strong Menger (edge) connected, and determine the (edge) connectivity of [Formula: see text] is [Formula: see text].

Authors

Institutions

Publication Details

Journal
International Journal of Foundations of Computer Science
Published
2026-02-24
DOI
https://doi.org/10.1142/s012905412650005x
Primary Topic
Interconnection Networks and Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Subnetworks Reliability Analysis of Complete Transposition Networks

Shenglei Zhang, Jinyu Zou, Junzhen Wang, Bo Zhu
International Journal of Foundations of Computer Science
Interconnection Networks and Systems
article

Subnetworks Reliability Analysis of Complete Transposition Networks

Shenglei Zhang, Jinyu Zou, Junzhen Wang, Bo Zhu
article en

Abstract

Large scale multiprocessor systems based on interconnection networks (graphs) as underlying topologies, have been widely used in nowdays. Thus, the reliability of interconnection networks will directly affect the stability of multiprocessor systems. The strong Menger connectivity is a significant parameter for the reliability evalution of interconnection networks. A connected graph [Formula: see text] is strong Menger (edge) connected if there are [Formula: see text] internally (edge) disjoint paths joining any two vertices [Formula: see text] and [Formula: see text] in [Formula: see text]. This article studies the strong Menger connectivity of complete transposition networks [Formula: see text] when parts of subnetworks are faulty. Let [Formula: see text] be an [Formula: see text]-dimensional subnetwork of [Formula: see text]. We show that [Formula: see text] is strong Menger (edge) connected, and determine the (edge) connectivity of [Formula: see text] is [Formula: see text].

International Journal of Foundations of Computer Science
Qinghai University (CN), Qinghai Normal University (CN), Qinghai Tibetan Hospital (CN)
Openalex Percentile: Top 53%
Interconnection Networks and Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.