A distributed dual ascent algorithm for the Hop-constrained Steiner Tree Problem

Operations Research Letters

Volumn 38, Issue 1, 2010, Pages 57-62

  Santos, Marcelo ^a   Drummond, Lúcia M A ^a   Uchoa, Eduardo ^a  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

Distributed algorithms; Multicast routing; Steiner tree

Indexed keywords

ASCENT ALGORITHMS; CONSTRAINED STEINER TREE; DISTRIBUTED ALGORITHM; GRAPH TRANSFORMATION; MODEL APPLICATION; MULTICAST ROUTING; PROBLEM-BASED; QOS REQUIREMENTS; STEINER TREES;

MULTICASTING; PARALLEL ALGORITHMS; QUALITY OF SERVICE;

ROUTING ALGORITHMS;

EID: 70449718778     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2009.09.008     Document Type: Article

References (15)

1. Novak R., Rugelj J., and Kundus G. Steiner tree based distributed multicast routing in networks. Steiner Trees in Industries (2001), Kluwer 327-351
2. Oliveira C., and Pardalos P. A survey of combinatorial optimization problems in multicast routing. Computers and Operations Research 32 (2005) 1953-1981
3. L. Gouveia, L. Simonetti, E. Uchoa, Modelling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs, Mathematical Programming. On-line first, doi:10.1007/s10107-009-0297-2. 2009
4. Drummond L.M.A., Santos M., and Uchoa E. A distributed dual ascent algorithm for Steiner problems in multicast routing. Networks 53 (2009) 170-183
5. Feng G., and Yum T. Efficient multicast routing with delay constraints. International Journal of Communications Systems 12 (1999) 181-195
6. L. Guo, I. Matta, QDMR: an efficient QoS dependent multicast routing algorithm, in: Proceedings of IEEE Real-Time Technology and Applications Symposium RTAS'99, 1999, pp. 213
7. Jia X. A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks. IEEE/ACM Transactions on Networking 6 (1998) 828-837
8. Bauer F., and Varma A. Distributed algorithms for multicast path setup in data networks. IEEE/ACM Transactions on Networking 4 (1996) 181-191
9. Huang T.-L., and Lee D. Comments and an improvement on a distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks. IEEE/ACM Transactions on Networking 13 (2005) 1410-1411
10. Wong R. A dual ascent approach for Steiner tree problems on a directed graph. Mathematical Programming 28 3 (1984) 271-287
11. Poggi de Aragão M., Uchoa E., and Werneck R. Dual heuristics on the exact solution of large Steiner problems. Electronic Notes in Discrete Mathematics 7 (2001) 46-51
12. T. Koch, A. Martin, S. Voss, Steinlib: An updated library on Steiner problems in graphs, Technical Report 00-37, Konrad-Zuse-Zentrum für Informationstechnik Berlin, 2000
13. A. Medina, A. Lakhina, I. Matta, J. Byers, BRITE: An approach to universal topology generation, in: Proc. of the MASCOTS'01, 2001, pp. 346-353
14. T. Bu, D. Towsley, On distinguishing between Internet power law topology generators, in: Proc. of the INFOCOM'02, 2002, pp. 638-647
15. Jin S., and Bestavros A. Small-world characteristics of Internet topologies and implications on multicast scaling. Computer Networks Journal 50 (2006) 648-666