{"docId":443,"paperId":443,"url":"https:\/\/dmtcs.episciences.org\/443","doi":"10.46298\/dmtcs.443","journalName":"Discrete Mathematics & Theoretical Computer Science","issn":"","eissn":"1365-8050","volume":[{"vid":85,"name":"Vol. 10 no. 3"}],"section":[{"sid":8,"title":"Distributed Computing and Networking","description":[]}],"repositoryName":"Hal","repositoryIdentifier":"hal-00972334","repositoryVersion":1,"repositoryLink":"https:\/\/hal.science\/hal-00972334v1","dateSubmitted":"2015-03-26 16:20:12","dateAccepted":"2015-06-09 14:47:02","datePublished":"2008-01-01 08:00:00","titles":{"en":"An optimal permutation routing algorithm on full-duplex hexagonal networks"},"authors":["Sau, Ignasi","\u017derovnik, Janez"],"abstracts":{"0":"Distributed Computing and Networking","en":"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."},"keywords":["[INFO.INFO-DM] Computer Science [cs]\/Discrete Mathematics [cs.DM]"]}