Evaluating Steiner-tree heuristics and diameter variations for application layer multicast

Computer Networks

Volumn 52, Issue 15, 2008, Pages 2872-2893

  Vik, Knut Helge ^a   Halvorsen, Pål ^a   Griwodz, Carsten ^a  

^a UNIVERSITY OF OSLO   (Norway)

Author keywords

Distributed interactive applications; Overlay multicast; Steiner tree heuristics; Tree diameter

Indexed keywords

ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS; HEURISTIC PROGRAMMING; MULTICASTING; OPTIMIZATION; TELECOMMUNICATION NETWORKS;

APPLICATION LAYER; APPLICATION-LAYER MULTICAST; CLIENT NODES; DIAMETER VARIATIONS; DISTRIBUTED INTERACTIVE APPLICATIONS; GRAPH ALGORITHMS; GROUP MANAGEMENT; GROUP MEMBERS; LATENCY REDUCTION; OVERLAY MULTICAST; OVERLAY NETWORKS; PRUNING ALGORITHMS; ROUTING TABLE; SHORTEST PATHS; SPANNING TREE ALGORITHMS; SPANNING TREE PROBLEMS; SPANNING TREES; STEINER-TREE HEURISTICS; TREE ALGORITHMS; TREE CONSTRUCTION; TREE STRUCTURES; TREE-DIAMETER; USER GROUPS;

TREES (MATHEMATICS);

EID: 52049087333     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2008.06.003     Document Type: Article

References (40)

1. The Entertainment Software Association, ESAs 2006 essential facts about the computer and video game industry, January 2008 .
2. B.S. Woodcock, An analysis of mmog subscription growth, January 2008 .
3. Claypool M. The effect of latency on user performance in real-time strategy games. Elsevier Computer Networks 49 1 (2005) 52-70
4. Claypool M., and Claypool K. Latency and player actions in online games. Communications of the ACM 49 11 (2005) 40-45
5. F. Dabek, R. Cox, F. Kaashoek, R. Morris, Vivaldi: a decentralized network coordinate system, in: Proceedings of the ACM International Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), 2004, pp. 15-26.
6. Takahashi H., and Matsuyama A. An approximate solution for the Steiner problem in graphs. Mathematica Japonica 24 6 (1990) 573-577
7. Kou L., Markowsky G., and Berman L. A fast algorithm for Steiner trees. Acta Informatica 15 (1981) 141-145
8. Rayward-Smith V., and Clare A. The computation of nearly minimal Steiner trees in graphs. International Journal of Mathematical Education in Science and Technology 14 1 (1983) 8
9. Goodrich M., and Tamassia R. Algorithm Design: Foundations, Analysis and Internet Examples (2002), John Wiley and Sons, New York
10. A. Abdalla, N. Deo, P. Gupta, Random-tree diameter and the diameter-constrained MST, Tech. Rep. CS-TR-00-02, University of Central Florida, Orlando, FL, USA, 2000. http://citeseer.ist.psu.edu/abdalla00randomtree.html.
11. International Telecommunication Union (ITU-T), One-way Transmission Time, ITU-T Recommendation G. 114 (2003).
12. Griwodz C., and Halvorsen P. The fun of using TCP for an MMORPG. International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV) (2006), ACM Press, New York 1-7
13. G. Kortsarz, D. Peleg, Approximating shallow-light trees, in: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'97, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1997, pp. 103-110.
14. Karaman A., and Hassanein H.S. Core-selection algorithms in multicast routing - comparative and complexity analysis. Computer Communications 29 8 (2006) 998-1014
15. Wu B.Y., and Chao K.-M. Spanning Trees and Opitmization Problems (2004), Chapman and Hall/CRC, London
16. Oellermann O.R. On steiner centers and steiner medians of graphs. Networks 34 4 (1999) 258-263
17. K.-H. Vik, C. Griwodz, P. Halvorsen. Applicability of group communication for increased scalability in MMOGs, in: Proceedings of the Workshop on Network and System Support for Games (NETGAMES), ACM Press, Singapore, 2006.
18. A. Young, C. Jiang, M. Zheng, A. Krishnamurthy, L. Peterson, R. Wang, Overlay mesh construction using interleaved spanning trees, March 2004.
19. Winter P. Steiner problem in networks: a survey. Networks 17 2 (1987) 129-167
20. Voss S. Steiner's problem in graphs: heuristic methods. Discrete Applied Mathematics 40 1 (1992) 45-72
21. F. Bauer, A. Varma, ARIES: A rearrangeable inexpensive edge-based online Steiner algorithm, in: Proceedings of the Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 1996.
22. Hassin R., and Levin A. Minimum restricted diameter spanning trees. Discrete Applied Mathematics 137 3 (2004) 343-357
23. S. Aggarwal, M. Limaye, A. Netravali, K. Sabnani, Constrained diameter Steiner trees for multicast conferences in overlay networks, in: QSHINE'04: Proceedings of the First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE'04), IEEE Computer Society, Washington, DC, USA, 2004, pp. 262-271.
24. Q. Zhu, W. Dai, Delay bounded minimum Steiner tree algorithms for performance-driven routing, 1993 .
25. E. Brosh, Approximation and heuristic algorithms for minimum delay application-layer multicast trees, 2003 .
26. Ho J.M., Lee D.T., Chang C.H., and Wong C.K. Bounded diameter minimum spanning trees and related problems. SCG'89: Proceedings of the fifth annual symposium on Computational geometry (1989), ACM Press, New York, NY, USA 276-282
27. Waxman B.M. Dynamic Steiner tree problem. SIAM Journal of Discrete Mathematics 4 (1991) 364-384
28. K.-H. Vik, P. Halvorsen, C. Griwodz, Multicast tree diameter for dynamic distributed interactive applications, in: The 27th Conference on Computer Communications, INFOCOM, 2008, pp. 1597-1605. doi:10.1109/INFOCOM.2008.220.
29. Narula S.C., and Ho C.A. Degree-constrained minimum spanning trees. Computers and Operations Research 7 (1980) 239-249
30. G.R. Raidl, B.A. Julstrom, Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem, in: SAC'03: Proceedings of the 2003 ACM Symposium on Applied Computing, 2003, pp. 747-752.
31. A. Medina, A. Lakhina, I. Matta, J. Byers, BRITE: Universal topology generation from a user's perspective, Tech. Rep. BUCS-TR-2001-003, Computer Science Department, Boston University, April 2001 .
32. Peer-to-peer information from wikipedia .
33. M. Kwon, S. Fahmy, Topology-aware overlay networks for group communication, 2002 .
34. P. Francis, S. Ratnasamy, R. Govindan, C. Alaettinoglu, Yoid project, 2000 .
35. S. Banerjee, B. Bhattacharjee, Analysis of the NICE application layer multicast protocol, Tech. Rep. UMIACSTR 2002-60 and CS-TR 4380, Department of Computer Science, University of Maryland, College Park, June 2002.
36. G. Fox, S. Pallickara, The Narada event brokering system: Overview and extensions, in: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA), 2002, pp. 353-359.
37. D. Pendarakis, S. Shi, D. Verma, M. Waldvogel, ALMI: An application level multicast infrastructure, in: Proceedings of the USENIX Symposium on Internet Technologies and Systems (USITS), 2001, pp. 49-60 .
38. S.Y. Shi, J. Turner, M. Waldvogel, Dimensioning server access bandwidth and multicast routing in overlay networks, in: Proceedings of the International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV), 2001, pp. 83-92.
39. L.S. Liu, R. Zimmermann, Immersive peer-to-peer audio streaming platform for massive online games, in: Proceedings of the International Conference (NIME), 2006.
40. K.-H. Vik, C. Griwodz, P. Halvorsen, Dynamic group membership management for distributed interactive applications, in: Proceedings of the 32nd IEEE Conference on Local Computer Networks (LCN), 2007, pp. 141-148.