Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: kontrola zatorów

Sortuj według:

Ogranicz wyniki do:

Approximation models for the evaluation of TCP/AQM networks

Marek Dariusz, Domański Adam, Domańska Joanna, Szyguła Jakub, Czachórski Tadeusz, Klamka Jerzy, Filus Katarzyna

Bulletin of the Polish Academy of Sciences. Technical Sciences

2022

Vol. 70, nr 4

art. no. e141986

The article proposes a model in which Diffusion Approximation is used to analyse the TCP/AQM transmission mechanism in a multinode computer network. In order to prevent traffic congestion, routers implement AQM (Active Queue Management) algorithms. We investigate the influence of using RED-based AQM mechanisms and the fractional controller PIγ on the transport layer. Additionally, we examine the cases in which the TCP and the UDP flows occur and analyse their mutual influence. Both transport protocols used are independent and work simultaneously. We compare our solution with the Fluid Flow approximation, demonstrating the advantages of Diffusion Approximation.

Exact and approximation algorithms for joint routing and flow rate optimization

Junosza-Szaniawski Konstanty, Nogalski Dariusz

Annals of Computer Science and Information Systems

2019

Vol. 20

29--36

This paper addresses comparison of algorithms for a version of the NUM problem. The joint formulation of routing and transmission rate control within the multi-user and single-path setting is assumed within the NUM. Since problem is NP-hard, the efficient heuristics are designed, implemented and compared experimentally with other existing heuristics and exact linear programming solver. The linear approximation is applied for nonlinear utility function. The results of experiments demonstrate a trade-off between computing time and precision of goal value.

PSO-Vegas: PSO-based enhanced Vegas

Jamali S., Eftekhari A.

Przegląd Elektrotechniczny

2011

R. 87, nr 1

199-203

Biology is hosting many self-organizing processes. These processes can be studied by researchers to employ their principles as an inspirational metaphor to offer new solutions for different scientific problems. We follow such an inspiration here, to improve TCP Vegas algorithm. It has been confirmed that TCP Vegas has higher performance in compare with TCP Reno. However, TCP Vegas has several problems that affect its performance in congestion avoidance phase. Fixed values for α and β are one of the most important weaknesses of TCP Vegas. Ideally, α and β should be function of network conditions. For this purpose, this paper presents a PSO-based modified Vegas algorithm, which adjusts its parameters i.e. α and β to present good performance compared to Vegas. The simulation results show that the performance of the proposed algorithm is much better than TCP Vegas.

W biologii występuje wiele samoorganizujących się procesów. Takie procesy mogą być studiowane jako metoda rozwiązywania wielu różnych problemów naukowych. Artykuł przedstawia ulepszenie algorytmu TCP Vegas. Zostało potwierdzone, że TCP Vegas ma lepsze parametry niż TCP Reno. Jednak samo TCP Vegas ma też słabości - jedną z nich jest stała wartość α i β. W warunkach idealnych α i β powinny być funkcją warunków sieci. W tym celu w pracy przedstawia się zmodyfikowany algorytm Vegas z możliwością ustawiania parametrów α i β. Symulacje wykazały, że nowy algorytm ma lepsze właściwości niż TCP Vegas