ملخص
This paper describes the new fault-tolerant routing algorithm for k-ary n-cubes using the concept of «probability vectors» and conducts an extensive performance analysis for the new algorithm. To compute these vectors, a node determines first its faulty set, which represents the set of all its neighbouring nodes that are faulty or unreachable due to faulty links. Each node then calculates a probability vector, where the lth element represents the probability that a destination node at distance l cannot be reached through a minimal path due to a fault node or link. The probability vectors are used by all the nodes to achieve an efficient fault-tolerant routing in the network. The extensive performance analysis conducted in this study reveals that the proposed algorithm exhibits good fault-tolerance properties in terms of the achieved average routing distances.
اللغة الأصلية | English |
---|---|
عنوان منشور المضيف | Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS |
ناشر | IEEE Computer Society |
الصفحات | 509-514 |
عدد الصفحات | 6 |
مستوى الصوت | 2002-January |
رقم المعيار الدولي للكتب (المطبوع) | 0769517609 |
المعرِّفات الرقمية للأشياء | |
حالة النشر | Published - 2002 |
الحدث | 9th International Conference on Parallel and Distributed Systems, ICPADS 2002 - Taiwan, China المدة: ديسمبر ١٧ ٢٠٠٢ → ديسمبر ٢٠ ٢٠٠٢ |
Other
Other | 9th International Conference on Parallel and Distributed Systems, ICPADS 2002 |
---|---|
الدولة/الإقليم | China |
المدينة | Taiwan |
المدة | ١٢/١٧/٠٢ → ١٢/٢٠/٠٢ |
ASJC Scopus subject areas
- ???subjectarea.asjc.1700.1708???