Unchanging the diameter of k-ary n-cube networks with faulty vertices

被引：3
|
作者：
Wang, Shiying [1 ]
Li, Jing [2 ]
Yang, Yuxing [1 ]
机构：
[1] Henan Normal Univ, Sch Math & Informat Sci, Xinxiang 453007, Henan, Peoples R China
[2] Taiyuan Univ Sci & Technol, Sch Appl Sci, Taiyuan 030024, Shanxi, Peoples R China
来源：
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 2015年 / 92卷 / 01期
基金：
中国国家自然科学基金;
关键词：
interconnection networks; k-ary n-cube networks; diameter; fault-tolerance; fault diameter; 94C15; 05C12; 68M15; CYCLES; MULTICOMPUTERS;
D O I：
10.1080/00207160.2014.890189
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The k-ary n-cube is one of the most commonly used interconnection networks for parallel and distributed systems. In this paper, for a k-ary n-cube , we show that if k is even and if k is odd, where is the maximum integer such that the diameter of remains unchanged when arbitrary vertices are faulty. Furthermore, we show that for even k, if the diameter of a faulty with 2n-1 faulty vertices is larger than its fault-free diameter, then all the faulty vertices are adjacent to a certain vertex and there is only one pair of vertices in this such that their distance is equal to the fault diameter. For k-ary n-cubes with odd k, similar results are given.
引用
收藏
页码：15 / 28
页数：14
相关论文
共 50 条
  • [21] An optical interconnect model for k-ary n-cube wormhole networks
    Raksapatcharawong, M
    Pinkston, TM
    10TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM - PROCEEDINGS OF IPPS '96, 1996, : 666 - 672
  • [22] Strongly Hamiltonian laceability of the even k-ary n-cube
    Huang, Chien-Hung
    COMPUTERS & ELECTRICAL ENGINEERING, 2009, 35 (05) : 659 - 663
  • [23] Analysis of fault-tolerant routing algorithms in k-ary n-cube networks
    Al-Sadi, J
    Day, K
    Ould-Khaoua, M
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2003, 18 (02): : 79 - 85
  • [24] The conditional node connectivity of the k-ary n-cube
    Day, K
    Harous, S
    Al-Ayyoub, AE
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOL VI, PROCEEDINGS, 1999, : 2706 - 2710
  • [25] Embedding Hamiltonian Paths with Prescribed Linear Forests into k-ary n-Cube Networks
    Meng, Kaiyue
    Yang, Yuxing
    JOURNAL OF INTERCONNECTION NETWORKS, 2025, 25 (01)
  • [26] The Edge-Fault-Tolerant Bipancyclicity of the Even k-ary n-cube
    Fang, Jywe-Fei
    COMPUTER JOURNAL, 2011, 54 (02) : 255 - 262
  • [27] Performance analysis of k-ary n-cube networks with pipelined circuit switching
    Min, GY
    Sarbazi-Azad, H
    Ould-Khaoua, M
    INTERNATIONAL JOURNAL OF HIGH SPEED COMPUTING, 2000, 11 (02): : 111 - 127
  • [28] The Strong Menger Connectivity of the Directed k-Ary n-Cube
    Xie, Guoqiang
    Meng, Jixiang
    JOURNAL OF INTERCONNECTION NETWORKS, 2024, 24 (02)
  • [29] k-Pancyclicity of k-ary n-Cube Networks under the Conditional Fault Model
    Li, Jing
    Liu, Di
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2012, 23 (06) : 1115 - 1120
  • [30] Immucube:: Scalable fault-tolerant routing for k-ary n-cube networks
    Puente, Valentin
    Gregorio, Jose Angel
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2007, 18 (06) : 776 - 788
12345