The current situation in IP networks shows the need for new congestion control algorithms that can be flexible, scalable, and capable of avoiding additional queue delays caused by loading the bottleneck buffers. Most common internet flows use loss-based congestion controls, which can achieve high bottleneck bandwidth utilization and fair resource sharing but cause overload bottleneck buffers. In this paper we present an investigation of the performance of a PID-based congestion control solution for high-speed IP networks. It uses measurements of a round trip time and receiver delivery rate to reach and keep maximum available bottleneck performance and constant node buffer load caused by bottleneck queue on some low level. This algorithm can be effective in high-speed IP networks and delay-sensitive applications. It is designed to be flexible and scalable for different connectivity cases. This algorithm then is investigated on the example of RMDT.


    Access

    Download


    Export, share and cite



    Title :

    Efficiency of a PID-based Congestion Control for High-speed IP-networks


    Contributors:


    Publication date :

    2018




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    Control of Congestion in High-Speed Networks

    Imer, O. C. / Basar, T. | British Library Online Contents | 2001


    Congestion Control by Heuristics in High-Speed Networks Using ANN

    Uma, S. V. / Gurumurthy, K. S. | Springer Verlag | 2013


    Congestion Control in High-Speed Network

    Miyahara, H. | British Library Online Contents | 1998



    Internal model hop-by-hop congestion control for high-speed networks

    Pietrabissa, A. / European Union Control Association; Institution of Electrical Engineers | British Library Conference Proceedings | 2003