@inproceedings {Simula.ND.33,
	title = {Dynamic Group Membership Management for Distributed Interactive Applications},
	journal = {32nd IEEE Conference on Local Computer Networks (LCN)},
	year = {2007},
	month = {October},
	pages = {141-148},
	publisher = {IEEE},
	type = {Conference},
	abstract = {Distributed interactive applications have become increasingly popular, making it important to address their communication needs, where, one of the needs is group communication. In this paper, we consider the applications in which it is at any given time possible to divide its users into groups. The group membership changes over time and the group division is unrelated to the physical proximity. As a way of enabling the group communication in distributed interactive applications we choose application layer multicast. We use simulation to evaluate several dynamic algorithms for managing overlay multicast trees. They are compared with respect to four metrics that can be relevant for a distributed interactive application. These are total tree cost, diameter, reconfiguration time and stability. We demonstrate algorithms that perform well for these metrics although they do not consider all users during reconfiguration.},
	isbn = {978-0-7695-3000-0},
	author = {Vik, Knut-Helge and Griwodz, Carsten and Halvorsen, P{\r a}l},
	editor = {Christensen, Ken and Frank, Matthias}
}
@inproceedings {Pedersen.2006.1,
	title = {Considerations for SCTP Retransmission Delays for Thin Streams},
	journal = {Local Computer Networks (LCN 2006)},
	year = {2006},
	note = {(best paper award)},
	month = {Nov},
	pages = {135 - 142},
	publisher = {IEEE},
	type = {Annual},
	abstract = {The popularity of distributed interactive applications has exploded in the last few years. For example, massive multi-player online games have become a fast growing, multi-million industry with a very high user mass supporting hundreds or thousands of concurrent players. Today, such games are usually client-server applications that use TCP for time-dependent communication. Similar multimedia applications also choose TCP frequently. Very thin data streams are sent over each of these TCP connections, which means that they consume very little bandwidth. TCP has several shortcomings with respect to the latency requirements of such thin streams because of its retransmission handling. An alternative to TCP may be SCTP which was developed to answer the requirements for signaling transport. SCTP has subsequently also been considered more appropriate than TCP for congestion controlled streaming of other time-dependent data. Important reasons are its maintenance of packet boundaries and partial reliability. In this paper, we evaluate the performance of the Linux SCTP implementation for thin streams. Like others before, we identify latency challenges. We also propose some enhancements for reducing the latency compared to the original Linux implementation. We argue for separate handling of thin and thick data streams in SCTP.},
	isbn = {1-4244-0419-3},
	author = {Pedersen, Jon and Griwodz, Carsten and Halvorsen, P{\r a}l},
	editor = {Christensen, Ken and Frank, Matthias}
}
