A Fault Tolerant Routing Algorithm Based on Cube Algebra for Hypercube Systems
Yükleniyor...
Dosyalar
Tarih
2000
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Elsevier Science Bv
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
We propose an approach to determine the shortest path between the source and the destination nodes in a faulty or a non-faulty hypercube. The number of faulty nodes and links may be rather large and if any path between the nodes exists, the developed algorithm determines it. To construct this algorithm, some properties of the cube algebra are considered and some transformations based on this algebra are developed.
Açıklama
Anahtar Kelimeler
hypercube, fault-tolerance, shortest path, routing, cube algebra
Kaynak
Journal of Systems Architecture
WoS Q Değeri
Q4
Scopus Q Değeri
Q1
Cilt
46
Sayı
2
Künye
Erciyes, K., Kahramanlı, Ş. Ş., Allahverdi, N. M., (2000). A Fault Tolerant Routing Algorithm Based on Cube Algebra for Hypercube Systems. Journal of Systems Architecture, 46(2), 201-205. Doi: 10.1016/S1383 7621(98)00063-0
