I'm studying a routing problem on a cyclic butterfly network. The paper I am reading states that two properties of the cyclic butterfly network make it efficient for the routing algorithm it describes. I'm new to this subject, and I'm struggling to understand the first property, which is:

"(1) It embeds a Benes network - meaning that if we traverse the columns and back any permutation of the row labels can take place without collisions"

It adds that this is trivially true for a square grid. In this context do collisions mean collision of packets of information? Why is this trivially true for a square grid, but not the cyclic butterfly network?

Kind regards



1 Answer 1


I think they are talking about a path that goes from the left edge to the right edge, and then back to the left edge again. That path will never visit any node more than once. By "without collisions", they mean that the left-to-right part of the path will never intersect with the right-to-left part of the path.

I think.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.