@inproceedings {Simula.ND.73,
	title = {Multicast Tree Diameter for Dynamic Distributed Interactive Applications},
	journal = {IEEE International Conference on Computer Communications - IEEE INFOCOM},
	year = {2008},
	month = {April},
	pages = {1597-1605},
	publisher = {IEEE},
	type = {Annual},
	edition = {27th},
	abstract = {Considerable attention has been given to latency reduction in distributed interactive applications. Such applications may have stringent latency requirements and dynamic user groups. In this paper, our focus has been on using application layer multicast with a centralized approach to the group management. The groups are organized in overlay networks that are created using graph algorithms. We investigate many spanning tree problems with particular focus on reducing the diameter of a tree, i.e., the maximum pairwise latency between users. In addition, we focus on reducing the time it takes to execute membership changes. In that context, we use core selection heuristics to find well located group nodes, and edge pruning algorithms to reduce the number of edges in an otherwise fully meshed overlay. Our edge pruning algorithms strongly connect well located group nodes to the remaining group members, to create new and pruned group graphs. Such that, when a tree algorithm is given a pruned group graph, it is manipulated into creating trees with lower diameter. In the investigation presented here, we have implemented and experimentally analyzed spanning tree heuristics, core selection heuristics and edge pruning algorithms. We find that faster heuristics that do not explicitly optimize the diameter are able to compete with slower heuristics that optimize the diameter.},
	doi = {10.1109/INFOCOM.2008.220},
	author = {Vik, Knut-Helge and Halvorsen, P{\r a}l and Griwodz, Carsten},
	editor = {Merill, Douglas and Saha, Debanjan and Jennifer C. {Hou} and Kalyanaraman, Shivkumar and Sivalingam, Krishna}
}
