VLSI Design

Research Article

Efficient Congestion Mitigation Using Congestion-Aware Steiner Trees and Network Coding Topologies

Figure 2

Steps for finding network coding topology using Algorithm NC. (a) A graph 𝐺 with two nets 𝑛 𝑖 and 𝑛 𝑗 that connect nodes 𝑠 𝑖 and 𝑠 𝑗 to terminals 𝑇 1 = 𝑇 2 = 𝑇 1 2 = { 𝑡 1 , 𝑡 2 , 𝑡 3 } . (b) A Steiner tree 𝜙 connecting 𝑠 𝑗 to 𝑇 2 . (c) Modified graph in which the costs of all edges found in 𝜙 are set equal to zero and the edges connecting 𝑠 𝑖 to 𝑡 1 are reversed. A shortest path from 𝑠 𝑗 to 𝑡 1 is shown. (d) Modified graph in which the edges connecting 𝑠 𝑖 to 𝑡 2 are reversed. A shortest path from 𝑠 𝑗 to 𝑡 2 is shown. (e) Modified graph in which the edges connecting 𝑠 𝑖 to 𝑡 3 are reversed. A shortest path from 𝑠 𝑗 to 𝑡 3 is shown.
892310.fig.002a
(a)
892310.fig.002b
(b)
892310.fig.002c
(c)
892310.fig.002d
(d)
892310.fig.002e
(e)