Literature Database Entry

dressler2001how

Falko Dressler, "How to Measure Reliability and Quality of IP Multicast Services?," Proceedings of IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 2001), Victoria, Canada, August 2001, pp. 401–404.

Abstract

IP multicast is the most often used technique to transport multimedia data over the internet. Due to the low resource requirements when transmitting one multimedia stream to more than just one client, it is deployed in most backbone networks as well as in most campus networks. Typical services are video broadcasts or video conferences. IP multicast like IP does not support to transport real-time data with a specified QoS. It is a best effort transport network, but there are some approaches to put some quality to IP to provide a better quality of service. Also, the network administrators have to find out information about the reliability of their network. For both measurements, there are a lot of tools available and the number of such tools is still growing. The problem is, that you cannot measure the whole internet to apply these data to all possible services (applications). This paper describes an idea how to identify the components required for a particular service. Using this knowledge you can use the available tools to set up measurements for reliability and QoS of your network for this service.

Quick access

Original Version DOI (at publishers web site)
Authors' Version PDF (PDF on this web site)
BibTeX BibTeX

Contact

Falko Dressler

BibTeX reference

@inproceedings{dressler2001how,
    author = {Dressler, Falko},
    doi = {10.1109/PACRIM.2001.953654},
    title = {{How to Measure Reliability and Quality of IP Multicast Services?}},
    pages = {401--404},
    publisher = {IEEE},
    isbn = {978-0-7803-7080-7},
    address = {Victoria, Canada},
    booktitle = {IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 2001)},
    month = {8},
    year = {2001},
   }
   
   

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 permissions@acm.org.

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

This page was automatically generated using BibDB and bib2web.

Last modified: 2025-04-17