Literature Database Entry

dressler2003scalable


Falko Dressler, "A Scalable Environment for Quality of Service Measurements in the Internet," Proceedings of 2nd IASTED International Conference on Communications, Internet, and Information Technology (CIIT 2003), Scottsdale, AZ, November 2003, pp. 307–312.


Abstract

The goal of this paper is to describe a scalable environment for quality of service (QoS) measurements in the internet. Since the early beginnings of communication networks, measurements of the QoS in the network have been developed and performed for several reasons. First, it was necessary to identify the capabilities of the different types of data networks and to compare them with analytical examinations. Secondly, with the evolving appearance of real-time applications such as multimedia transmissions or remote controls, the demands on the service quality of current network topologies and protocols have rapidly increased. This paper summarizes the available measurement techniques, especially in the case of IP multicast and proposes a measurement environment which builds a base for any kind of quality of service measurements in the internet, either unicast or multicast. The focus of this approach is on the scalability of such measurements which have to coexist with the standard applications in the same networking environment.

Quick access

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

Contact

Falko Dressler

BibTeX reference

@inproceedings{dressler2003scalable,
    author = {Dressler, Falko},
    title = {{A Scalable Environment for Quality of Service Measurements in the Internet}},
    pages = {307--312},
    editor = {Hamza, M. H.},
    publisher = {ACTA Press},
    isbn = {978-0-88986-398-9},
    address = {Scottsdale, AZ},
    booktitle = {2nd IASTED International Conference on Communications, Internet, and Information Technology (CIIT 2003)},
    month = {11},
    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 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: 2024-03-29