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

Wyniki wyszukiwania

Teraz wyświetlane 1 - 4 z 4
  • 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
    Dynamic Mutation Control in Continuous Genetic Algorithms
    (Wydawnictwo Politechniki Łódzkiej, 2023) Wieczorek, Łukasz; Ignaciuk, Przemysław
    In this paper the adaptability of the mutation operation in continuous genetic algorithms (CGAs) is taken into consideration from an analytical perspective. For this purpose, based on the notation that has previously been used to analyze the classical, binary genetic algorithm, a dynamic system model of CGA has been created. In order to adapt the mutation probability in successive generations, a linear controller has been applied. It allows one to accelerate the evolution process. As a result, faster convergence is obtained, as required in computationally intensive optimization problems.
  • Pozycja
    BBO in solving complex optimization problems– bullwhip effect reduction in logistics networks
    (Wydawnictwo Politechniki Łódzkiej, 2021) Dziomdziora, Adam; Ignaciuk, Przemysław
    This chapter addresses Biogeography-Based Optimization (BBO) implementation for counteracting the bullwhip effect in logistic systems influenced by uncertain demand. The considered class of systems comprises two types of actors – controlled nodes and external sources – connected by unidirectional links. In this paper, the application of BBO is proposed to support the optimization problem of proper channel allocation in transportation links. BBO allows one to perform simulation-based optimization and provide desirable operating conditions to answer a priori unknown, timevarying demand. The effectiveness of the goods distribution process governed under a base-stock policy includes the objective function of mitigating the bullwhip effect and minimizing transportation costs. The introduced optimization problem is solved using BBO to find an optimal channel allocation matrix for a given topology. The results are verified in extensive simulations of a real-world logistic network.
  • 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.