Fault diameter of k-ary n-cube networks

Khaled Day*, Abdel Elah Al-Ayyoub

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

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

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

ملخص

We obtain the fault diameter of k-ary n-cube interconnection networks (also known as n-dimensional k-torus networks). We start by constructing a complete set of node-disjoint paths (i.e., as many paths as the degree) between any two nodes of a k-ary n-cube. Each of the obtained paths is of length zero, two, or four plus the minimum length except for one path in a special case (when the Hamming distance between the two nodes is one) where the increase over the minimum length may attain eight. These results improve those obtained in [8] where the length of some of the paths has a variable increase (which can be arbitrarily large) over the minimum length. These results are then used to derive the fault diameter of the k-ary n-cube, which is shown to be Δ + 1 where Δ is the fault free diameter.

اللغة الأصليةEnglish
الصفحات (من إلى)903-907
عدد الصفحات5
دوريةIEEE Transactions on Parallel and Distributed Systems
مستوى الصوت8
رقم الإصدار9
المعرِّفات الرقمية للأشياء
حالة النشرPublished - 1997

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700.1711???
  • ???subjectarea.asjc.1700.1708???
  • ???subjectarea.asjc.1700.1703???

بصمة

أدرس بدقة موضوعات البحث “Fault diameter of k-ary n-cube networks'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا