Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
On Bounded Load Routings for Modeling k-Regular Connection Topologies
verfasst von : Adrian Kosowski, Michał Małafiejski, Paweł Żyliński
Erschienen in: Algorithms and Computation
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 paper deals with the problem of modeling a
k
-regular topology over an existing network architecture by establishing virtual point-to-point communication paths, referred to as
k-routing.
We consider the question of the existence and minimisation of edge spread of
k
-routings with bounded edge load in undirected networks. Efficient algorithms are presented for determining minimal
k
-routings with edge load 1 and for certain cases with edge load 2. On the negative side, the problems of finding a 6-routing with load 2 and of minimising a 2-routing with load 2 are proven to be
NP
-hard (though the latter is approximable within 7/6). The results imply the
NP
-hardness of the well known all-to-all routing problem for bounded edge load.