10.46298/dmtcs.443
https://dmtcs.episciences.org/443
Sau, Ignasi
Ignasi
Sau
0000-0002-8981-9287
Žerovnik, Janez
Janez
Žerovnik
An optimal permutation routing algorithm on full-duplex hexagonal networks
Distributed Computing and Networking
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 problem in a hexagonal network, i.e. a finite subgraph of a triangular grid, which is a widely used network in practical applications. We present an optimal distributed permutation routing algorithm on full-duplex hexagonal networks, using the addressing scheme described by F.G. Nocetti, I. Stojmenovic and J. Zhang (IEEE TPDS 13(9): 962-971, 2002). Furthermore, we prove that this algorithm is oblivious and translation invariant.
episciences.org
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
2015-06-09
2008-01-01
2008-01-01
en
journal article
https://hal.science/hal-00972334v1
1365-8050
https://dmtcs.episciences.org/443/pdf
VoR
application/pdf
Discrete Mathematics & Theoretical Computer Science
Vol. 10 no. 3
Distributed Computing and Networking
Researchers
Students