Literature Database Entry


Falko Dressler, "Scalable QoS Measurements in Multicast Networks," Department of Computer Science, Friedrich–Alexander University of Erlangen–Nuremberg (FAU), Poster, May 2003.


The importance of providing quality of service (QoS) in communication networks for various types of real-time applications is widely accepted. QoS measurements in communication networks are required in many representations [1, 6]. Many of the most current multimedia applications use IP multicast for an efficient one-to-many transmission over the network. Thus, the employed measurement tools have to work in multicast environments as well [7]. Unfortunately, all the existing approaches for such measurements show perspicuous drawbacks. Especially the scalability of such tools is an issue. The focus of this work is to describe the a scalable environment for QoS measurements in IP multicast networks. The presented approach, named Multicast Quality Monitor (MQM, [4, 5]), is built on new concepts providing an optimum scalability. First, the so named MQM ping mechanism is a distributed and decentralized mechanism to allow the employment of high-scalable QoS measurements in the internet. Secondly, the so named MQM beacon mechanism focuses on the requirements of individual multimedia services. It was designed to reduce the impact on the network as much as possible by allowing a passive behavior using the multicast capabilities of the network by joining active multicast sessions and by analyzing the received traffic. Additionally, a central control instance is employed to prevent unnecessary and unnecessarily long lasting measurements.

Quick access

Authors' Version PDF (PDF on this web site)
BibTeX BibTeX


Falko Dressler

BibTeX reference

    author = {Dressler, Falko},
    title = {{Scalable QoS Measurements in Multicast Networks}},
    institution = {Department of Computer Science, Friedrich--Alexander University of Erlangen--Nuremberg (FAU)},
    location = {Erlangen, Germany},
    month = {5},
    type = {Poster},
    year = {2003},

Copyright notice

Links to final or draft versions of papers are presented here 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 or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at

This page was automatically generated using BibDB and bib2web.

Last modified: 2024-06-16