An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks

@article{Zerovnik2008AnOP,
  title={An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks},
  author={Janez Zerovnik and Ignasi Sau},
  journal={Discrete Mathematics & Theoretical Computer Science},
  year={2008},
  volume={10}
}
In the permutation routing problem, each processor is the origin of at most one packet and the destination of no more than one packet. The goal is to minimize the number of time steps required to route all packets to their respective destinations, under the constraint that each link can be crossed simultaneously by no more than one packet. We study this… CONTINUE READING