| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Iskanje po katalogu digitalne knjižnice Pomoč

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 6 / 6
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
An optimal permutation routing algorithm on full-duplex hexagonal networks
Ignasi Sau Walls, Janez Žerovnik, 2008, izvirni znanstveni članek

Opis: 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.
Ključne besede: mathematics, hexagonal networks, permutation routing, shortest path, distributed algorithm, communication networks, oblivious algorithm
Objavljeno v DKUM: 10.07.2015; Ogledov: 799; Prenosov: 137
.pdf Celotno besedilo (535,46 KB)
Gradivo ima več datotek! Več...

2.
3.
4.
An optimal permutation routing algorithm for full-duplex hexagonal mesh networks
Ignasi Sau Walls, Janez Žerovnik, 2006

Opis: 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.
Ključne besede: mathematics, hexagonal networks, permutation routing, shortest path, distributed algorithm, communication networks, oblivious algorithm
Objavljeno v DKUM: 10.07.2015; Ogledov: 766; Prenosov: 35
URL Povezava na celotno besedilo

5.
6.
Advanced modelling and simulation methods for communication networks
Jože Mohorko, Matjaž Fras, Saša Klampfer, 2008, izvirni znanstveni članek

Opis: This paper contains a brief overview of suitable simulation tools available for education and research on network technologies and protocols. Among the mentioned tools we present advanced methods for network simulations using the OPNET modeler simulation tool. This is one of the most widespread simulation tools for network simulations, appropriate for both for teaching and also for the researching procedures of new internet devices and protocols. The basic package is intended for simulating communication networks and for protocols and devices development. There are also additional specific modules, such as a module assigned to the simulation of wireless networks, an ACE module for application analyzing, 3DNV module for visualizing networks on virtual terrain and the "System in the loop" module for simulating networks with real communication equipment in the loop, in real-time.
Ključne besede: network simulation, simulation tools, modelling, communication networks, OPNET
Objavljeno v DKUM: 31.05.2012; Ogledov: 1649; Prenosov: 44
URL Povezava na celotno besedilo

Iskanje izvedeno v 0.1 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici