التفاصيل البيبلوغرافية
| العنوان: |
Enhancing Reliability of Folded Petersen Networks Based on Edge Partition. |
| المؤلفون: |
Lin, Wanling1 (AUTHOR) linwl595@163.com, Lin, Zhaoding1 (AUTHOR) zhaoding_lin@163.com, Zhuang, Hongbin1 (AUTHOR) hbzhuang476@gmail.com, Li, Xiao-Yan1 (AUTHOR) xyli@fzu.edu.cn |
| المصدر: |
International Journal of Foundations of Computer Science. Sep2024, p1-16. 16p. |
| مصطلحات موضوعية: |
*COMPUTER systems, *FAULT tolerance (Engineering), PETERSEN graphs, REGULAR graphs, TOPOLOGY |
| مستخلص: |
The rapid expansion of infrastructure topology, especially noticeable in high-performance computing systems and data center networks, significantly increases the likelihood of failures in network components. While traditional (edge) connectivity has long been the standard for measuring the reliability of interconnection networks, this approach becomes less effective as networks grow more complex. To address this, two innovative metrics, named matroidal connectivity and conditional matroidal connectivity, have emerged. These metrics provide the flexibility to impose constraints on faulty edges across different dimensions and have shown promise in enhancing the edge fault tolerance of interconnection networks. In this paper, we explore (conditional) matroidal connectivity of the k-dimensional folded Petersen network FPk, which is constructed by iteratively applying the Cartesian product operation on the well-known Petersen graph and possesses a regular, vertex- and edge-symmetric architecture with optimal connectivity and logarithmic diameter. Specifically, the faulty edge set F is partitioned into k subsets according to the dimensions of FPk. We then arrange these subsets by their cardinality, imposing the restriction whereby the cardinality of the ith largest subset dose not exceed 3 ⋅ 10i−1 for 1 ≤ i ≤ k. Subsequently, we show that FPk − F is connected with |F|≤∑i=1k(3 ⋅ 10i−1) and determine the exact value of matroidal connectivity and conditional matroidal connectivity. [ABSTRACT FROM AUTHOR] |
|
Copyright of International Journal of Foundations of Computer Science is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Business Source Index |