A fault-free unicast algorithm in twisted cubes with the restricted faulty node set

Jianxi Fan; Shukui Zhang; Xiaohua Jia; Guangquan Zhang

doi:10.1109/ICPADS.2009.40

A fault-free unicast algorithm in twisted cubes with the restricted faulty node set

Jianxi Fan
, Shukui Zhang
, Xiaohua Jia
, Guangquan Zhang

Department of Computer Science

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

3 Citations (Scopus)

Abstract

The dimensions of twisted cubes in the original definition of twisted cubes are only limited to odd integers. In this paper, we first extends the dimensions of twisted cubes to all the positive integers. Then, we introduce the concept of the set of restricted faulty nodes into twisted cubes. We further prove that under the condition that each node of the n-dimensional twisted cube TQ_n has at least one fault-free neighbor its restricted connectivity is 2n - 2, which is almost as twice as that of TQ_n under the condition of arbitrary faulty nodes, the same as that of the n-dimensional hypercube. Moreover, we give an O(NlogN) fault-free unicast algorithm, where N denotes the node number of TQ_n-1. Finally, we give the simulation result of the expected length of the fault-free path gotten by our algorithm. © 2009 IEEE.

Original language	English
Title of host publication	Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS
Pages	316-323
DOIs	https://doi.org/10.1109/ICPADS.2009.40
Publication status	Published - 2009
Event	15th International Conference on Parallel and Distributed Systems, ICPADS '09 - Shenzhen, Guangdong, China Duration: 8 Dec 2009 → 11 Dec 2009 https://ieeexplore.ieee.org/xpl/conhome/5394475/proceeding

Publication series

Name
ISSN (Print)	1521-9097

Conference

Conference	15th International Conference on Parallel and Distributed Systems, ICPADS '09
Place	China
City	Shenzhen, Guangdong
Period	8/12/09 → 11/12/09
Internet address	https://ieeexplore.ieee.org/xpl/conhome/5394475/proceeding

Research Keywords

Connectivity
Fault-free path
Set of restricted faulty nodes
Twisted cube
Unicast

Access Output

10.1109/ICPADS.2009.40

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{b25e7368c85145fca66b7e56e4c4939d,

title = "A fault-free unicast algorithm in twisted cubes with the restricted faulty node set",

abstract = "The dimensions of twisted cubes in the original definition of twisted cubes are only limited to odd integers. In this paper, we first extends the dimensions of twisted cubes to all the positive integers. Then, we introduce the concept of the set of restricted faulty nodes into twisted cubes. We further prove that under the condition that each node of the n-dimensional twisted cube TQn has at least one fault-free neighbor its restricted connectivity is 2n - 2, which is almost as twice as that of TQn under the condition of arbitrary faulty nodes, the same as that of the n-dimensional hypercube. Moreover, we give an O(NlogN) fault-free unicast algorithm, where N denotes the node number of TQn-1. Finally, we give the simulation result of the expected length of the fault-free path gotten by our algorithm. {\textcopyright} 2009 IEEE.",

keywords = "Connectivity, Fault-free path, Set of restricted faulty nodes, Twisted cube, Unicast",

author = "Jianxi Fan and Shukui Zhang and Xiaohua Jia and Guangquan Zhang",

year = "2009",

doi = "10.1109/ICPADS.2009.40",

language = "English",

isbn = "9780769539003",

pages = "316--323",

booktitle = "Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS",

note = "15th International Conference on Parallel and Distributed Systems, ICPADS '09 ; Conference date: 08-12-2009 Through 11-12-2009",

url = "https://ieeexplore.ieee.org/xpl/conhome/5394475/proceeding",

}

Fan, J, Zhang, S, Jia, X & Zhang, G 2009, A fault-free unicast algorithm in twisted cubes with the restricted faulty node set. in Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS., 5395281, pp. 316-323, 15th International Conference on Parallel and Distributed Systems, ICPADS '09, Shenzhen, Guangdong, China, 8/12/09. https://doi.org/10.1109/ICPADS.2009.40

A fault-free unicast algorithm in twisted cubes with the restricted faulty node set. / Fan, Jianxi; Zhang, Shukui; Jia, Xiaohua et al.
Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS. 2009. p. 316-323 5395281.

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - A fault-free unicast algorithm in twisted cubes with the restricted faulty node set

AU - Fan, Jianxi

AU - Zhang, Shukui

AU - Jia, Xiaohua

AU - Zhang, Guangquan

PY - 2009

Y1 - 2009

N2 - The dimensions of twisted cubes in the original definition of twisted cubes are only limited to odd integers. In this paper, we first extends the dimensions of twisted cubes to all the positive integers. Then, we introduce the concept of the set of restricted faulty nodes into twisted cubes. We further prove that under the condition that each node of the n-dimensional twisted cube TQn has at least one fault-free neighbor its restricted connectivity is 2n - 2, which is almost as twice as that of TQn under the condition of arbitrary faulty nodes, the same as that of the n-dimensional hypercube. Moreover, we give an O(NlogN) fault-free unicast algorithm, where N denotes the node number of TQn-1. Finally, we give the simulation result of the expected length of the fault-free path gotten by our algorithm. © 2009 IEEE.

AB - The dimensions of twisted cubes in the original definition of twisted cubes are only limited to odd integers. In this paper, we first extends the dimensions of twisted cubes to all the positive integers. Then, we introduce the concept of the set of restricted faulty nodes into twisted cubes. We further prove that under the condition that each node of the n-dimensional twisted cube TQn has at least one fault-free neighbor its restricted connectivity is 2n - 2, which is almost as twice as that of TQn under the condition of arbitrary faulty nodes, the same as that of the n-dimensional hypercube. Moreover, we give an O(NlogN) fault-free unicast algorithm, where N denotes the node number of TQn-1. Finally, we give the simulation result of the expected length of the fault-free path gotten by our algorithm. © 2009 IEEE.

KW - Connectivity

KW - Fault-free path

KW - Set of restricted faulty nodes

KW - Twisted cube

KW - Unicast

UR - https://www.scopus.com/pages/publications/77949590900

UR - https://www.scopus.com/pages/publications/77949590900#tab=impact

U2 - 10.1109/ICPADS.2009.40

DO - 10.1109/ICPADS.2009.40

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 9780769539003

SP - 316

EP - 323

BT - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

T2 - 15th International Conference on Parallel and Distributed Systems, ICPADS '09

Y2 - 8 December 2009 through 11 December 2009

ER -

A fault-free unicast algorithm in twisted cubes with the restricted faulty node set

Abstract

Publication series

Conference

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this