2009 | OriginalPaper | Buchkapitel
Brief Annoucement: Distributed Swap Edges Computation for Minimum Routing Cost Spanning Trees
verfasst von : Linda Pagli, Giuseppe Prencipe
Erschienen in: Principles of Distributed Systems
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
Given a weighted graph
G
(
V
G
,
E
G
) representing a communication network, with
n
nodes and
m
edges where the weights are positive integers, its
Spanning Tree
is typically used to route messages. In [1] the
routing cost
of a spanning tree is defined as the sum of the distances over all pairs of vertices of this tree. Hence, the most suitable spanning tree for the routing problem is the one minimizing the routing cost: the
Minimum Routing Cost Spanning Tree
(MRCST).