Probability vectors: A new fault-tolerant routing algorithm for k-Ary n-cubes

Jehad Al-Sadi*, Khaled Day, Mohamed Ould-Khaoua

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

نتاج البحثمراجعة النظراء

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

ملخص

This paper describes a new fault-tolerant routing algorithm for the k-ary n-cube using the concept of "probability vectors". To compute these vectors, a node determines first its faulty set, which contains all its neighbouring nodes that are faulty or unreachable due to faulty nodes or links. Each node then calculates a probability vector, where the i-th element represents the probability that a destination node at distance i cannot be reached using 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. Results from a performance analysis presented below show that the new algorithm exhibits good fault-tolerance properties in terms of the achieved percentage of reachability and routing distances.

اللغة الأصليةEnglish
الصفحات830-834
عدد الصفحات5
حالة النشرPublished - 2002
منشور خارجيًانعم
الحدثApplied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing - Madrid
المدة: مارس ١١ ٢٠٠٢مارس ١٤ ٢٠٠٢

Other

OtherApplied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing
الدولة/الإقليمSpain
المدينةMadrid
المدة٣/١١/٠٢٣/١٤/٠٢

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700.1712???

بصمة

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

قم بذكر هذا