IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v63y2016i1d10.1007_s11235-015-9969-9.html
   My bibliography  Save this article

On the deterministic approach to active queue management

Author

Listed:
  • Lukasz Chrost

    (Silesian University of Technology)

  • Andrzej Chydzinski

    (Silesian University of Technology)

Abstract

Virtually all known active queue management (AQM) algorithms, except for the two-category classifier (TCC), operate by calculating packet dropping probabilities. The probabilistic approach involves the necessity of using a type of random number generation upon every packet arrival at the router. Even if the generation of a single random value does not involve high computational complexity, the overhead becomes significant, considering the number of packets in a typical Internet environment. We propose a new AQM algorithm based on the deterministic approach. The algorithm offers a high throughput and a low loss ratio while maintaining a short and stable queue size. At the same time, the algorithm is of low computation complexity, which allows for energy-efficient implementations in routers. In addition to that, the proposed algorithm is universal—it provides high performance in a variety of distinct networking scenarios (diversified round-trip times, congestion levels, traffic types, etc.). Contrary to the TCC algorithm, the proposed algorithm does not make the decision whether to accept or drop the packet upon each packet arrival—the computation process is involved less frequently.

Suggested Citation

  • Lukasz Chrost & Andrzej Chydzinski, 2016. "On the deterministic approach to active queue management," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 63(1), pages 27-44, September.
    • Handle: RePEc:spr:telsys:v:63:y:2016:i:1:d:10.1007_s11235-015-9969-9
    DOI: 10.1007/s11235-015-9969-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-015-9969-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-015-9969-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chydzinski, Andrzej, 2022. "Per-flow structure of losses in a finite-buffer queue," Applied Mathematics and Computation, Elsevier, vol. 428(C).
    2. Andrzej Chydzinski & Pawel Mrozowski, 2016. "Queues with Dropping Functions and General Arrival Processes," PLOS ONE, Public Library of Science, vol. 11(3), pages 1-23, March.
    3. Marek Barczyk & Andrzej Chydzinski, 2022. "AQM based on the queue length: A real-network study," PLOS ONE, Public Library of Science, vol. 17(2), pages 1-21, February.
    4. Lina He & Hairui Zhou, 2017. "Robust Lyapunov–Krasovskii based design for explicit control protocol against heterogeneous delays," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 66(3), pages 377-392, November.
    5. Andrzej Chydzinski & Blazej Adamczyk, 2019. "Queues with the dropping function and general service time," PLOS ONE, Public Library of Science, vol. 14(7), pages 1-21, July.
    6. Andrzej Chydzinski, 2021. "On the stability of queues with the dropping function," PLOS ONE, Public Library of Science, vol. 16(11), pages 1-16, November.
    7. Ghasem Kahe & Amir Hossein Jahangir, 2019. "A self-tuning controller for queuing delay regulation in TCP/AQM networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 71(2), pages 215-229, June.
    8. Chydzinski, Andrzej & Adamczyk, Blazej, 2020. "Response time of the queue with the dropping function," Applied Mathematics and Computation, Elsevier, vol. 377(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:63:y:2016:i:1:d:10.1007_s11235-015-9969-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.