| Title: | An optimal permutation routing algorithm for full-duplex hexagonal mesh networks |
|---|
| Authors: | ID Sau Walls, Ignasi (Author)
ID Žerovnik, Janez (Author) |
|---|
| Files: |  http://www.imfm.si/preprinti/PDF/01017.pdf
|
|---|
| Language: | English |
|---|
| Work type: | Not categorized |
|---|
| Organization: | FS - Faculty of Mechanical Engineering
|
|---|
| Abstract: | 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. |
|---|
| Keywords: | mathematics, hexagonal networks, permutation routing, shortest path, distributed algorithm, communication networks, oblivious algorithm |
|---|
| Year of publishing: | 2006 |
|---|
| Number of pages: | str. 1-15 |
|---|
| Numbering: | Vol. 44, št. 1017 |
|---|
| PID: | 20.500.12556/DKUM-49378  |
|---|
| ISSN: | 1318-4865 |
|---|
| UDC: | 519.1 |
|---|
| COBISS.SI-ID: | 14600281 |
|---|
| NUK URN: | URN:SI:UM:DK:58NYNOYO |
|---|
| Publication date in DKUM: | 10.07.2015 |
|---|
| Views: | 1351 |
|---|
| Downloads: | 47 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
