Publications

Disclaimer:

IEEE Copyright Notice

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

ACM Copyright Notice

These are the authors' versions of the work. The copyright is with ACM. They are posted here by permission of ACM for your personal use. Not for redistribution. See individual publication details for information on the publication of the definitive versions.

Springer-Verlag LNCS Copyright Notice

The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.

Work that appeared before the 1st of September 2003 was published while the authors were with the Lehrstuhl Praktische Informatik IV at the University of Mannheim.

Priority-Based Distribution Trees for Application-Level Multicast

Author(s): Jürgen Vogel, Jörg Widmer, Dirk Farin, Martin Mauve, Wolfgang Effelsberg.
Title: Priority-Based Distribution Trees for Application-Level Multicast
Published: Proc. of NetGames 2003, pp. 148-157, Redwood City, CA, USA, May 2003
Keyword(s): Application-Level Multicast, Multicast Routing, Distribution Tree
Abstract: In this paper, we propose a novel multicast routing algorithm that is based on application-level priorities and network characteristics: The application may specify an individual priority for each packet-receiver pair. The multicast distribution tree is then constructed such that the higher the priority, the more direct the path from the sender to the packet's destination and the lower the resulting end-to-end delay. This algorithm can be used to realize application-level multicast for delay-sensitive applications such as networked computer games. However, optimizing the multicast tree with respect to the end-to-end delay comes at the cost of an increase in link stress -- the more direct a path, the less likely it is that it can be integrated efficiently into an overlay distribution tree. Our algorithm takes this tradeoff into account and constructs efficient priority-based multicast trees. We demonstrate the performance and characteristics of the algorithm through simulation.
Bib entry: [XML] [BibTeX]
Download: [PDF]
Responsible for the content: E-MailWE Informatik