THE OPTIMAL ROUTING ALGORITHM IN HIERARCHICAL CUBIC NETWORK AND ITS PROPERTIES

Cited 9 time in webofscience Cited 0 time in scopus
  • Hit : 138
  • Download : 0
A Hierarchical Cubic Network (HCN) is a hierarchical hypercube network proposed by Ghose [4]. The HCN is topologically superior to many other similar networks. in particular, the hypercube. It has a considerably lower diameter than a comparable hypercube and is realized using almost half the number of links per node as a comparable hypercube. In this paper, we propose the shortest routing algorithm in HCN(nln) and show that the diameter of HCN(n,n) with 2(2n) nodes is n + [(n + 1)/3] + 1 which is about 2/3 of that of a comparable hypercube. We also propose the optimal routing algorithm in HCN(m,n) where m less than or equal to n and obtain that its diameter is n + [(m + 1)/3] + 1. Typical parallel algorithms run in HCN(m. n) with the same time complexity as a hypercube and the hypercube topology can be emulated with O(1) time complexity in it.
Publisher
IEICE-INST ELECTRON INFO COMMUN ENG
Issue Date
1995-04
Language
English
Article Type
Article
Citation

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, v.E78D, no.4, pp.436 - 443

ISSN
0916-8532
URI
http://hdl.handle.net/10203/75668
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 9 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0