Unidirectional star graphs

Khaled Day*, Anand Tripathi

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

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

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

ملخص

We propose an assignment of directions to the edges of the n-star graph and derive attractive properties for the resulting unidirectional star graph USn. A simple polarity function is used to define the directions of the edges. USn is shown to be strongly connected and recursively structured. The number of incoming ports of a node in USn is equal to the number of its outgoing ports (plus or minus one when n is even). The polarities of the ports of a neighboring node can be directly obtained from the polarities of the ports of the local node. These properties have allowed the design of a near optimal distributed routing algorithm as indicated by simulation results on all USn graphs with up to 362,880 nodes.

اللغة الأصليةEnglish
الصفحات (من إلى)123-129
عدد الصفحات7
دوريةInformation Processing Letters
مستوى الصوت45
رقم الإصدار3
المعرِّفات الرقمية للأشياء
حالة النشرPublished - مارس 8 1993
منشور خارجيًانعم

ASJC Scopus subject areas

  • ???subjectarea.asjc.2600.2614???
  • ???subjectarea.asjc.1700.1711???
  • ???subjectarea.asjc.1700.1710???
  • ???subjectarea.asjc.1700.1706???

بصمة

أدرس بدقة موضوعات البحث “Unidirectional star graphs'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا