| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:An optimal permutation routing algorithm on full-duplex hexagonal networks
Authors:ID Sau Walls, Ignasi (Author)
ID Žerovnik, Janez (Author)
Files:.pdf Discrete_Mathematics_&_Theoretical_Computer_Science_2008_Sau,_Zerovnik_An_optimal_permutation_routing_algorithm_for_full-duplex_hexagona.pdf (535,46 KB)
MD5: C6DF6D1670CCF47A77E7FAAA80D19908
 
URL http://dmtcs.episciences.org/443
 
Language:English
Work type:Scientific work
Typology:1.01 - Original Scientific Article
Organization:FS - Faculty of Mechanical Engineering
Abstract: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 for full-duplex hexagonal networks, using the addressing scheme described by Nocetti et al. 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
Publication status:Published
Publication version:Version of Record
Year of publishing:2008
Number of pages:str. 49-62
Numbering:Letn. 10, št. 3
PID:20.500.12556/DKUM-51751 New window
ISSN:1365-8050
UDC:519.17
ISSN on article:1365-8050
COBISS.SI-ID:14899801 New window
NUK URN:URN:SI:UM:DK:0UYRUQPC
Publication date in DKUM:10.07.2015
Views:1355
Downloads:227
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Discrete mathematics & theoretical computer science
Shortened title:Discret. math. theor. comput. sci.
Publisher:DMTCS
ISSN:1365-8050
COBISS.SI-ID:8089433 New window

Document is financed by a project

Funder:ARRS - Slovenian Research Agency
Project number:L2-7207
Name:Hevristike: teorija in aplikacija 3

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.
Licensing start date:10.07.2015

Secondary language

Language:Slovenian
Title:Optimalni algoritem za permutacijsko usmerjanje na heksagonalnih mrežah
Abstract:Zahtevnost permutacijskega usmerjanja je standarden test za primernost topologije za komunikacijsko omrežje. V članku je pokazano, da je mogoče na heksagonalnih mrežah vsako permutacijsko usmerjanje opraviti v optimalnem številu komunikacijskih korakov, to je v številu korakov, ki so potrebni za najdaljšo med najkrajšimi potmi, ki so potrebne za prenos informacijskih paketov. Dokaz je konstruktiven, uporabljeni algoritem pa porazdeljen, saj ne potrebuje nobene globalne informacije. Vsako vozlišče potrebuje samo podatek o svoji lokaciji, vsak od paketov pa s seboj nosi naslov cilja.
Keywords:matematika, heksagonalne mreže, permutacijsko usmerjanje, najkrajše poti, porazdeljen algoritem, komunikacijsko omrežje, pozabljiv algoritem


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica