Literature Database Entry


Falko Dressler, Andreas Klenk, Cornelia Kappler, Ali Fessi and Georg Carle, "Path-coupled Signaling for Dynamic Metering Configuration in IP-based Networks," Proceedings of IFIP Networking and Electronic Commerce Research Conference (NAEC 2005), Riva Del Garda, Italy, October 2005, pp. 388–399.


Metering for accounting, charging, and QoS measurements is an important functionality of modern IP-based networks. Many approaches have been published and some of the outcomes have been already deployed. So far, the configuration of the metering entities is based on centralized management systems. These systems usually have no knowledge about the ongoing routing decisions, and as a consequence do not allow to choose the metering entities based on algorithms that depend on the currently chosen data path. However, some scenarios require a path-dependent metering configuration functionality, e.g. for load-balancing between multiple meters. In this paper we present a path-coupled metering configuration that allows for sophisticated configuration options. Based on three different application scenarios, we discuss the requirements on a configuration signaling method, and present a path-coupled signaling approach which meets the identified requirements. Subsequently, we use the same application scenarios successfully assessing the approach.

Quick access

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


Falko Dressler
Andreas Klenk
Cornelia Kappler
Ali Fessi
Georg Carle

BibTeX reference

    author = {Dressler, Falko and Klenk, Andreas and Kappler, Cornelia and Fessi, Ali and Carle, Georg},
    title = {{Path-coupled Signaling for Dynamic Metering Configuration in IP-based Networks}},
    pages = {388--399},
    publisher = {International Federation for Information Processing (IFIP)},
    address = {Riva Del Garda, Italy},
    booktitle = {IFIP Networking and Electronic Commerce Research Conference (NAEC 2005)},
    month = {10},
    year = {2005},

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-07-21