Premium
A distributed dual ascent algorithm for Steiner problems in multicast routing
Author(s) -
Drummond Lúcia M. A.,
Santos Marcelo,
Uchoa Eduardo
Publication year - 2009
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20276
Subject(s) - steiner tree problem , multicast , computer science , heuristics , node (physics) , dual (grammatical number) , routing (electronic design automation) , heuristic , context (archaeology) , undirected graph , mathematical optimization , topology (electrical circuits) , algorithm , mathematics , theoretical computer science , combinatorics , distributed computing , computer network , graph , artificial intelligence , literature , structural engineering , engineering , biology , art , paleontology
Abstract Multicast routing problems are often modeled as Steiner Problems in undirected or directed graphs, the latter case being particularly suitable to cases where most of the traffic has a single source. Sequential Steiner heuristics are not convenient in that context, because one cannot assume that a central node has complete information about the topology and the state of a large wide area network. This article introduces a distributed version of a Dual Ascent primal‐dual heuristic, known for its remarkably good practical results, lower and upper bounds, in both undirected and directed Steiner problems. Complexity analysis and experimental results are also presented, showing the efficiency of the proposed algorithm when compared with the best distributed algorithms in the literature. © 2008 Wiley Periodicals, Inc. NETWORKS, 2009