Literature Database Entry

soto2019strengths

I. Soto, O. Amador, M. Urueña and M. Calderon, "Strengths and Weaknesses of the ETSI Adaptive DCC Algorithm: A Proposal for Improvement," IEEE Communications Letters, vol. 23 (5), pp. 802–805, May 2019.

Abstract

This letter studies the adaptive decentralized congestion control (DCC) algorithm defined in the ETSI TS 102 687 V1.2.1 specification. We provide insights on the parameters used in the algorithm and explore the impact of those parameters on its performance. We show how the algorithm achieves good average medium utilization while protecting against congestion, but we also show how the chosen parameters can result in slow speed of convergence and long periods of unfairness in transitory situations. Finally, we propose a modification to the algorithm which results in significant improvements in the speed of convergence and fairness.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

I. Soto
O. Amador
M. Urueña
M. Calderon

BibTeX reference

@article{soto2019strengths,
    author = {Soto, I. and Amador, O. and Urue{\~{n}}a, M. and Calderon, M.},
    doi = {10.1109/LCOMM.2019.2906178},
    title = {{Strengths and Weaknesses of the ETSI Adaptive DCC Algorithm: A Proposal for Improvement}},
    pages = {802--805},
    journal = {IEEE Communications Letters},
    issn = {1558-2558},
    publisher = {IEEE},
    month = {5},
    number = {5},
    volume = {23},
    year = {2019},
   }
   
   

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.