Abstract
Multicast routing problems are often modeled as Steiner Problems in undirected or directed graphs, the later case being particularly suitable to cases where most of the traffic has a single source. Sequential Steiner heuristics are not convenient in that context, since one cannot assume that a central node has complete information about the topology and the state of a large wide area network. This paper introduces a distributed version of a primal-dual heuristic (known as Dual Ascent), known for its remarkable good practical results, lower and upper bounds, in both undirected and directed Steiner problems. Experimental results and complexity analysis are also presented, showing the efficiency of the proposed algorithm when compared with the best distributed algorithms in the literature.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bauer, F., Varma, A.: Distributed algorithms for multicast path setup in data networks. IEEE/ACM Transactions on Networking 4, 181–191 (1996)
Chen, G., Houle, M., Kuo, M.: The Steiner problem in distributed computing systems. Information Sciences 74, 73–96 (1993)
Gatani, L., Lo Re, G., Gaglio, S.: An efficient distributed algorithm for generating multicast distribution trees. In: Proc. of 34th ICPP - Workshop on Performance Evalution of Networks for Parallel, Cluster and Grid Computer Systems, pp. 477– 484 (2005)
Goemans, M., Williamson, D.: The primal-dual method for approximation algorithms and its application to network design. In: Approximation Algorithms, 144–191 (1997)
Grandoni, F., Könemann, J., Panconesi, A., Sozio, M.: Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. In: Proc. of the 24th ACM SIGACT-SIGOPS, pp. 839–848. ACM Press, New York (2005)
Koch, T., Martin, A., Voss, S.: SteinLib: an updated library on Steiner Problems in Graphs, ZIB-Report 00-37 (2000), http://elib.zib.de/steinlib
Novak, R., Rugelj, J., Kundus, G.: Steiner tree based distributed multicast routing in networks. In: Steiner Trees in Industries, pp. 327–352. Kluwer, Dordrecht (2001)
Novak, R., Rugelj, J., Kundus, G.: A note on distributed multicast routing in point-to-point networks. Computers and Operations Research 26, 1149–1164 (2001)
Oliveira, C., Pardalos, P.: A survey of combinatorial optimization problems in multicast routing, Computers and Operations Research, 32, 1953–1981(2005)
de Aragão, M.P., Uchoa, E., Werneck, R.: Dual heuristics on the exact solution of Large Steiner Problems. ENDM 7, 46–51 (2001)
de Aragão, M.P., Werneck, R.: On the implementation of MST-based heuristics for the Steiner problem in graphs. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol. 2409, pp. 1–15. Springer, Heidelberg (2002)
Polzin, T., Vahdati, S.: Improved algorithms for the Steiner problem in networks. Discrete Applied Mathematics 112, 263–300 (2001)
Rugelj, J., Klavzar, S.: Distributed multicast routing in point-to-point networks. Computers and Operations Research 24, 521–527 (1997)
Segall, A.: Distributed network protocols. IEEE Trans. on Information Theory 29, 23–35 (1983)
Singh, G., Vellanki, K.: A distributed protocol for constructing multicast trees. In: Proc. of the 2nd International Conference on Priciples of Distributes Systems pp. 61–76 (1998)
Voss, S.: Steiner’s problem in graphs: heuristic methods. Discrete Applied Mathematics 40, 45–72 (1992)
Werneck, R.: Steiner Problem in Graphs: primal, dual, and exact algorithms, Master’s Thesis, Catholic University of Rio de Janeiro (2001)
Wong, R.: A dual ascent approach for Steiner Tree Problems on a directed graph. Mathematical Programming 28, 271–287 (1984)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Santos, M., Drummond, L.M.A., Uchoa, E. (2007). A Distributed Primal-Dual Heuristic for Steiner Problems in Networks. In: Demetrescu, C. (eds) Experimental Algorithms. WEA 2007. Lecture Notes in Computer Science, vol 4525. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72845-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-72845-0_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72844-3
Online ISBN: 978-3-540-72845-0
eBook Packages: Computer ScienceComputer Science (R0)