20.500.12556/DKUM-49378 An optimal permutation routing algorithm for full-duplex hexagonal mesh networks In the permutation routing problem, each processor is the origin of at most one packet and each processor is the destination of no more than one packet. We study this problem in an hexagonal network (that is, a finite convex subgraph of a triangular grid), a widely used network in practical applications. We use the addressing scheme described by F.G. Nocetti, I. Stojmenovic and J. Zhang (2002, IEEE Trans. on Parallel and Distrib. Systems). In this paper, a distributed optimal routing algorithm for full-duplex hexagonal mesh networks is presented. Furthermore, we prove that this algorithm is oblivious and translation invariant. mathematics hexagonal networks permutation routing shortest path distributed algorithm communication networks oblivious algorithm true false false Angleški jezik Neznan jezik Delo ni kategorizirano 2015-07-10 12:00:50 2015-07-10 12:00:50 2022-05-27 03:09:28 2019-07-10 21:28:28 2006 0 0 str. 1-15 št. 1017 Vol. 44 2006 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 1318-4865 519.1 44310272 14600281 URN:SI:UM:DK:58NYNOYO http://www.imfm.si/preprinti/PDF/01017.pdf 1 https://dk.um.si/Dokument.php?lang=slv&id=73937 Fakulteta za strojništvo 0 0 0