Dimensioning Multicast-Enabled Communications Networks

Networks

Volumn 39, Issue 4, 2002, Pages 216-231

  Prytz, Mikael ^a   Forsgren, Anders ^b  

^a ERICSSON RADIO SYSTEMS AB   (Sweden)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Branch and cut; Lagrangian decomposition; Multicast traffic; Network optimization; Telecommunications

Indexed keywords

ALGORITHMS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MULTICASTING; SCHEMATIC DIAGRAMS; TELECOMMUNICATION;

COMMUNICATIONS NETWORK;

COMPUTER NETWORKS;

EID: 0141651928     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10026     Document Type: Article

References (23)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows: Theory, algorithms and applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. I. Andersson, Private communication, Ericsson Radio Systems AB, Stockholm, Sweden, 2000.
3. S. Chen, O. Günlük, and B. Yener, The multicast packing problem, IEEE/ACM Trans Network 8 (2000), 311-318.
4. B.V. Cherkassky and A.V. Goldberg, On implementing the push-relabel method for the maximum flow problem, Algorithmica 19 (1997), 390-410.
5. S. Chopra and MR. Rao, The Steiner tree problem I: Formulations, compositions and extension of facets, Math Program 64 (1994), 209-229.
6. M.S. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman, New York, 1979.
7. M.X. Goemans and D.P. Williamson, "A primal-dual method for approximation algorithms and its application to network design problems," D.S. Hochbaum (Editor), Approximation algorithms for NP-hard problems, PWS, Boston, 1997.
8. M. Guignard and S. Kim, Lagrangean decomposition: A model yielding stronger Lagrangean bounds, Math Program 39 (1987), 215-228.
9. F.K. Hwang, D.S. Richards, and P. Winter, The Steiner tree problem, North-Holland, Amsterdam, The Netherlands, 1992.
10. ILOG CPLEX 6.5 User's manual, ILOG Inc., CPLEX Division, Incline Village, NV, 1999.
11. K.C. Kiwiel, User's guide for NOA 3.0: A Fortran package for convex nondifferentiable optimization, Systems Research Institute, Polish Academy of Sciences, Warsaw, Poland, 1993.
12. T. Koch and A. Martin, Solving Steiner tree problems in graphs to optimality, Networks 32 (1998), 207-232.
13. Y.-W. Leung and B.-T. Yang, Lower bound for multimedia multicast routing, IEE Proc Commun 145 (1998), 87-90.
14. S. Martello and P. Toth, Knapsack problems: Algorithms and computer implementations, Wiley, Chichester, 1990.
15. MATLAB User's Guide, The MathWorks, Inc., Natick, MA, 1998.
16. J. Moy, OSPF version 2, Request for Comments 2328, Internet Engineering Task Force, April 1998.
17. G.L. Nemhauser and L.A. Wolsey, Integer and combinatorial optimization, Wiley, New York, 1988.
18. R.C. Prim, Shortest connection networks and some generalizations, Bell Syst Tech J 36 (1957), 1389-1401.
19. W. Stallings, High-speed Networks, TCP/IP and ATM design principles, Prentice-Hall, Englewood Cliffs, NJ, 1998.
20. H. Takahashi and A. Matsuyama, An approximate solution for the Steiner tree problem in graphs, Math Jpn 24 (1980), 573-577.
21. B. Williamson, Developing IP multicast networks: The definitive guide to designing and deploying CISCO IP multicast networks, Cisco Press, Indianapolis, IN, 2000.
22. D.P. Williamson, M.X. Goemans, M. Mihail, and V.V. Vazirani, A primal-dual approximation algorithm for generalized Steiner network problems, Combinatorica 15 (1995), 435-454.
23. R.T. Wong, A dual ascent approach for Steiner tree problems on a directed graph, Math Program 28 (1984), 271-287.