Istituto di Informatica e Telematica     
Galdi C., Kaklamis C., Montangero M., Persiano G. Station Placement in Networks. In: Parallel Processing Letters, vol. 1 pp. 117 - 129. World Scientific, 2005.
In this paper we study the Station Placement problem on directed graphs, a problem that has applications to efficient multicasting in circuit-switched networks. We first argue that the problem on general directed graphs can be efficiently reduced to computing bounded depth Steiner tree on complete weighted directed graphs. Then, we concentrate on the case in which the graph is a directed tree and we give polynomial time algorithms to solve the problem and a natural variant of the problem.
DOI: 10.1142/S0129626405002106
Subject Multicasting
Distributed Systems
Steiner Tree

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional