A Multicast Routing Algorithm Based on Parallel Branching Method for Faulty Hypercubes
Yükleniyor...
Tarih
2001
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Institute of Electrical and Electronics Engineers Inc.
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
In this study, a multicast routing algorithm based on a parallel branching method has been developed for a faulty hypercube parallel processing system. The routing from the source to the destination nodes is guaranteed in the shortest time with this algorithm. Going through to the destinations from the source is a parallel process at each step. The superiority of the developed algorithm over previous studies is that the routing from the source to the destination is achieved in minimal steps without restriction to the number of faulty nodes. This means that the algorithm is running independently from the number of faulty nodes. The algorithm is simulated with a hypercube routing simulator.
Açıklama
R8 IEEE / Czechoslovakia Section
International Conference on Trends in Communications, EUROCON 2001 -- 4 July 2001 through 7 July 2001 -- 116312
International Conference on Trends in Communications, EUROCON 2001 -- 4 July 2001 through 7 July 2001 -- 116312
Anahtar Kelimeler
Kaynak
Eurocon 2001 - International Conference on Trends in Communications, Proceedings
WoS Q Değeri
Scopus Q Değeri
N/A
Cilt
Sayı
Künye
Güneş, S., Yılmaz, N., Allahverdi, N., (2001). A Multicast Routing Algorithm Based on Parallel Branching Method for Faulty Hypercubes. Eurocon 2001 - International Conference on Trends in Communications, Proceedings, 66-69. Doi: 10.1109/EURCON.2001.937765
