Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
Permutation Routing and (ℓ, k)-Routing on Plane Grids
verfasst von : Ignasi Sau, Janez Žerovnik
Erschienen in: Graphs and Algorithms in Communication Networks
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The
packet routing
packet routing
problem plays an essential role in communication networks. It consists in transferring data from some origins to some destinations within a reasonable amount of time. In the (
ℓ
,
k
)-routing
(l,k)-routing
problem, each node can send at most
ℓ
packets and receive at most
k
packets. Permutation routing is the particular case
ℓ
=
k
= 1. In the
r
-central routing problem, all nodes at distance at most
r
from a fixed node
v
want to send a packet to
v
. Here, we survey the results on permutation routing, the
r
-central routing, and the general (
ℓ
,
k
)-routing problems on regular plane grids, that is, square grids, triangular grids, and hexagonal grids. We assume the
store-and-forward Δ
-port model with synchronous transmission, and we consider both full and half-duplex networks.