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.

Application-Aware Distribution Trees for Application-Level Multicast

Author(s): Jürgen Vogel, Jörg Widmer, Dirk Farin, Martin Mauve.
Title: Application-Aware Distribution Trees for Application-Level Multicast
Published: Technical Report TR-02-010, Department for Mathematics and Computer Science, University of Mannheim, 2002
Keyword(s): Application-Level Multicast, Overlay Network, Multicast Routing, Distribution Tree, Distributed Interactive Applications
Abstract: In this paper, we present an algorithm to construct application-aware distribution trees for application-level multicast. Unlike existing approaches, the distribution trees do not solely depend on network characteristics but also on the application semantics of the transmitted packets. In the presented algorithm, the application may specify an individual priority for each packet-receiver pair. The distribution tree is then constructed such that the higher the priority, the more direct the path from the sender to the packet's destination. This 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 multicast distribution tree. Our algorithm takes this tradeoff into account and constructs efficient application-aware distribution trees. We demonstrate the performance and characteristics of the algorithm through extensive simulation.
Bib entry: [XML] [BibTeX]
Download: [PDF]
Verantwortlich für den Inhalt: E-Mail sendenWE Informatik