Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Algorithms for multicast connection under multi-path routing model
Ist Teil von
Information processing letters, 2002-10, Vol.84 (1), p.31-39
Ort / Verlag
Amsterdam: Elsevier B.V
Erscheinungsjahr
2002
Link zum Volltext
Quelle
Alma/SFX Local Collection
Beschreibungen/Notizen
Given a source node and a set of destination nodes in a network, multicast routing problem is usually treated as Steiner tree problem. Unlike this well-known tree based routing model, multicast routing under multi-path model is to find a set of paths rooted at the source node such that in each path at most a fixed number of destination nodes can be designated to receive the data and every destination node must be designated in a path to receive the data. The cost of routing is the total costs of paths found. In this paper we study how to construct a multicast routing of minimal cost under multi-path model. We propose two approximation algorithms for this NP-complete problem with guaranteed performance ratios.