@inproceedings {Simula.ND.221,
	title = {Constructing Low-Latency Overlay Networks: Tree Vs. Mesh Algorithms},
	journal = {Proceedings of IEEE Conference on Local Computer Networks (LCN)},
	year = {2008},
	month = {October},
	pages = {36-43},
	publisher = {IEEE},
	type = {Conference},
	abstract = {Distributed interactive applications may have stringent latency requirements and dynamic user groups. These applications may benefit from a group communication system, and to improve the system support for such applications, we investigate graph algorithms that construct low-latency overlay networks for application-layer multicast. In particular, we focus on reducing the diameter and the pair-wise latencies in the overlay. The overlay construction time is also considered, as it is often time-dependent in our dynamic target applications. Here, we have implemented and experimentally analyzed spanning-tree heuristics and mesh construction heuristics, and compared their performance and applicability to distributed interactive applications. We found that trees are faster to construct and save considerable amounts of resources in the network. Meshes, on the other hand, yield lower pair-wise latencies and increases the fault tolerance, but at the expense of increased resource consumption.},
	isbn = {978-1-4244-2412-2},
	doi = {10.1109/LCN.2008.4664149},
	author = {Vik, Knut-Helge and Griwodz, Carsten and Halvorsen, P{\r a}l},
	editor = {Elmallah, Ehab and Younis, Mohamed and Chun Tung {Chou}}
}
@inproceedings {Simula.ND.159,
	title = {TCP Mechanisms for Improving the User Experience for Time-Dependent Thin-Stream Applications},
	journal = {The 33rd Annual IEEE Conference on Local Computer Networks (LCN)},
	year = {2008},
	publisher = {IEEE},
	type = {Conference},
	abstract = {A wide range of Internet-based services that use reliable transport protocols display what we call thin-stream properties. This means that the application sends data with such a low rate that the retransmission mechanisms of the transport protocol are not fully effective. In time-dependent scenarios where the user experience depends on the data delivery latency, packet loss can be devastating for the service quality. In order to reduce application-layer latency when packets are lost, we have implemented modifications to the TCP retransmission mechanisms in the Linux kernel. The changes are only active when thin-stream properties are detected, thus not affecting TCP behaviour when the stream is not thin. In this paper, we show the latency improvements from these thin-stream modifications. We have tested several thin-stream applications like remote terminals (SSH) and audio conferencing (Skype), and we evaluate the user experience with and without the TCP modifications. Our experimental results show that our modifications allow TCP to recover earlier from packet loss. Furthermore, user surveys indicate that the majority of users easily detect improvements in the perceived quality of the tested applications.},
	isbn = {978-1-4244-2412-2},
	author = {Petlund, Andreas and Griwodz, Carsten and Halvorsen, P{\r a}l},
	editor = {Elmallah, Ehab and Younis, Mohamed and Chun Tung {Chou}}
}
