A new fault-tolerant routing algorithm for k-ary n-cube networks

J. Al-Sadi*, K. Day, M. Ould-Khaoua

*المؤلف المقابل لهذا العمل

نتاج البحث: المساهمة في مجلةArticleمراجعة النظراء

3 اقتباسات (Scopus)


This paper describes a new fault-tolerant routing algorithm for k-ary n-cubes using the concept of "probability vectors". 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 faulty node or link. The probability vectors are used by all the nodes to achieve an efficient fault-tolerant routing in the network. An extensive performance analysis conducted in this study reveals that the proposed algorithm exhibits good fault-tolerance properties in terms of the achieved percentage of reachability and routing distances.

اللغة الأصليةEnglish
الصفحات (من إلى)29-54
عدد الصفحات26
دوريةInternational Journal of High Speed Computing
مستوى الصوت12
رقم الإصدار1
المعرِّفات الرقمية للأشياء
حالة النشرPublished - يونيو 2004

ASJC Scopus subject areas

  • ???subjectarea.asjc.2600.2614???
  • ???subjectarea.asjc.1700.1703???


أدرس بدقة موضوعات البحث “A new fault-tolerant routing algorithm for k-ary n-cube networks'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا