The cost of broadcasting on star graphs and k-ary hypercubes

Efficient fault-tolerant routing algorithm for OTIS-cube using unsafety vectors

“…The unsafety vectors algorithm is capable to route messages using optimal distance paths especially for a large number of faulty components. Under high fault rates our algorithm is capable to route a large percentage of messages for which most of other routing algorithms announces routing failure with number of faulty nodes reaches the network degree [29,30]. This is due to the fact that the unsafety vectors algorithm repeatedly chooses to route through areas of the network with the least number of faults in the neighbourhood applying a greedy approach giving more weight to the nearest neighbourhoods.…”

Comparative Study of Product Networks

“…The parameters M, a, and b are set to 1024 bytes, 1 ms, and 1000 ms, respectively. These choices are representative of currently available machines [10]. The figure classifies the 11 networks into four categories.…”

“…This measure has been proposed as an indicator of the expected performance of an interconnection network in real communication problems [10]. Table 3 multiple-port broadcasting for the 11 graph families [3,9,10,19], where M is the message length, a is the unit transmission cost, and b is the latency. Here also we rewrite these expressions as functions of the graph size and plot them in Fig.…”

The Hyperstar Interconnection Network

“…Due to its small diameter and sublogarithmic degree, the star graph outperforms the hypercube in many respects [8]. Other properties of the star graph have been investigated including embedding [15,17,24,27,31], broadcasting [4,12,14], parallel path characterization [8,16], fault tolerance [18,23,28], load balancing [25], routing [11,19], unidirectional variants [9], and data exchange algorithms [7]. The solution of some problems on the star graph such as computing Fourier transforms [10] and sorting [22,26] have also been studied.…”