A note on "A tight lower bound on the number of channels required for deadlock-free wormhole routing"
Li Sheng, Jie Wu · IEEE Transactions on Computers · 2000
R. Libeskind-Hadas (1998) provided a tight lower bound on the number of channels required by a broad class of deadlock-free wormhole routing algorithms. In this paper, we show a simpler proof of the tight lower bound.