<?xml version="1.0"?><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:edm="http://www.europeana.eu/schemas/edm/" xmlns:wgs84_pos="http://www.w3.org/2003/01/geo/wgs84_pos" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:rdaGr2="http://rdvocab.info/ElementsGr2" xmlns:oai="http://www.openarchives.org/OAI/2.0/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:ore="http://www.openarchives.org/ore/terms/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:dcterms="http://purl.org/dc/terms/"><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-I2FLWWOO/e7e8ac21-762b-4fbf-85e1-6242492e793d/HTML"><dcterms:extent>28 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-I2FLWWOO/f0e15531-5229-4d8d-9060-937c7c8f2047/PDF"><dcterms:extent>149 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-I2FLWWOO/3b9ebed4-28b7-4a2c-9fca-d70dfe668fd8/TEXT"><dcterms:extent>26 KB</dcterms:extent></edm:WebResource><edm:TimeSpan rdf:about="2006-2025"><edm:begin xml:lang="en">2006</edm:begin><edm:end xml:lang="en">2025</edm:end></edm:TimeSpan><edm:ProvidedCHO rdf:about="URN:NBN:SI:DOC-I2FLWWOO"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/urn:nbn:si:spr-0y5dimiu" /><dcterms:issued>2009</dcterms:issued><dc:creator>Čevnik, Maja</dc:creator><dc:creator>Šilc, Jurij</dc:creator><dc:creator>Žerovnik, Janez</dc:creator><dc:format xml:lang="sl">številka:1/2</dc:format><dc:format xml:lang="sl">6 strani</dc:format><dc:format xml:lang="sl">letnik:76</dc:format><dc:format xml:lang="sl">str. 19-24</dc:format><dc:identifier>ISSN:0013-5852</dc:identifier><dc:identifier>ISSN:2232-3236</dc:identifier><dc:identifier>COBISSID:22659623</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-I2FLWWOO</dc:identifier><dc:language>sl</dc:language><dc:publisher xml:lang="sl">Elektrotehniška zveza Slovenije</dc:publisher><dcterms:isPartOf xml:lang="sl">Elektrotehniški vestnik</dcterms:isPartOf><dc:subject xml:lang="sl">heksagonalno omrežje</dc:subject><dc:subject xml:lang="sl">permutacijsko usmerjanje</dc:subject><dc:subject xml:lang="sl">teorija grafov</dc:subject><dc:subject xml:lang="sl">trikotniške mreže</dc:subject><dc:subject xml:lang="sl">usmerjene zveze</dc:subject><dc:subject rdf:resource="http://www.wikidata.org/entity/Q131476" /><dcterms:temporal rdf:resource="2006-2025" /><dc:title xml:lang="sl">Optimalno permutacijsko usmerjanje v heksagonalnih omrežjih| Optimal permutation routing on hexagonal networks|</dc:title><dc:description xml:lang="sl">At the beginning of the paper we introduce communication networks and data routing in networks. Later we focus on permutation routing, where each base station is the origin of at most one package and at the same time is the destination of no more than one package. The main part of the paper represents the problem of optimal permutation routing in triangular meshes with full-duplex edges. We describe an optimal permutation routing algorithm for full-duplex triangular meshes. The basic idea of the algorithm is that the saturated package should wait any longer because it has already waited as long as it could, otherwise the algorithm becomes suboptimal. Packet ?$p$? is saturated if the number of waiting steps of the packet is ?$l_{max} - l_p$? where ?$l_{max}$? is the maximum length over the shortest paths of the all packets and ?$l_p$? is the length of the shortest path of packet ?$p$?. The algorithm routes every permutation in the ?$l_{max}$? routing steps and is optimal, because ?$l_{max}$? is a lower bound of every permutation routing algorithm in triangular meshes</dc:description><dc:description xml:lang="sl">Najprej vpeljemo komunikacijska omrežja in usmerjanje podatkov v njih, v nadaljevanju pa se osredotočimo na permutacijsko usmerjanje. Osrednji del članka je problem optimalnega permutacijskega usmerjanja na trikotniških mrežah. Predstavlje je optomalni permutacijski usmerjevalni algoritem, ki za usmerjanje vseh permutacij potrebuje ?$l_{max}$?, korakov, kjer je ?$l_{max}$? najdaljša izmed vseh najkrajših poti sporočil</dc:description><edm:type>TEXT</edm:type><dc:type xml:lang="sl">znanstveno časopisje</dc:type><dc:type xml:lang="en">journals</dc:type><dc:type rdf:resource="http://www.wikidata.org/entity/Q361785" /></edm:ProvidedCHO><ore:Aggregation rdf:about="http://www.dlib.si/?URN=URN:NBN:SI:DOC-I2FLWWOO"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:DOC-I2FLWWOO" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:DOC-I2FLWWOO/f0e15531-5229-4d8d-9060-937c7c8f2047/PDF" /><edm:rights rdf:resource="http://rightsstatements.org/vocab/InC/1.0/" /><edm:provider>Slovenian National E-content Aggregator</edm:provider><edm:intermediateProvider xml:lang="en">National and University Library of Slovenia</edm:intermediateProvider><edm:dataProvider xml:lang="sl">Elektrotehniška zveza Slovenije</edm:dataProvider><edm:object rdf:resource="http://www.dlib.si/streamdb/URN:NBN:SI:DOC-I2FLWWOO/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:DOC-I2FLWWOO" /></ore:Aggregation></rdf:RDF>