Wydział Fizyki Technicznej, Informatyki i Matematyki Stosowanej / Faculty of Technical Physics, Information Technology and Applied Mathematics / W7

Stały URI zbioruhttp://hdl.handle.net/11652/7

Przeglądaj

Ma przypisane plikisearch.filters.applied.operator.equals: TakTematsearch.filters.applied.operator.equals: search.filters.subject.congestion control

Wyniki wyszukiwania

Teraz wyświetlane 1 - 2 z 2
  • Pozycja
    MPTCP Congestion Control Algorithms for Streaming Applications – Performance Evaluation in Public Networks
    (Wydawnictwo Politechniki Łódzkiej, 2023) Łuczak, Łukasz Piotr; Ignaciuk, Przemysław; Morawski, Michał
    Efficient data transfer for high-quality streaming requires fast speed, low latency, and stable transmission parameters. Utilizing multiple communication paths is a promising solution for improving performance. This paper evaluates the most common MPTCP congestion control algorithms in the context of streaming applications in the open Internet. The results show that the BALIA algorithm is the most effective CC algorithm for multi-path streaming. This algorithm achieves the lowest path delay and Head-of-Line blocking degree with consistent throughput. Conversely, the MPTCP CC algorithm wVegas exhibits the weakest performance.
  • Pozycja
    Active queue management with discrete sliding modes in TCP networks
    (Polska Akademia Nauk, Wydział IV Nauk Technicznych, 2014) Ignaciuk, Przemysław; Karbowańczyk, Michał
    In this paper, a new active queue management (AQM) algorithm for data traffic control in TCP/IP networks is developed. The algorithm design is based on the principles of discrete sliding-mode control. Unlike majority of earlier studies, the design procedure considers the effects of both non-negligible delay in transferring data and feedback information and unpredictable capacity variations. The switching function is selected to incorporate a delay compensation mechanism, which ensures efficient network operation even for large bandwidthdelay product connections. The proposed algorithm, implemented as a packet marking scheme, is tested in discrete event ns-2 simulator. The results show that the algorithm provides fast convergence to steady state after sudden, unanticipated capacity changes. By generating smaller overshoots, the proposed algorithm also allows for reducing buffer space requirements to avoid packet loss as compared to the benchmark AQM solutions.