Temat: congestion control - Prolib Integro

Skocz do pozycji: 1.

Tytuł:: An adaptive LQG TCP congestion controller for the Internet
Autorzy:: White, L. B.
Chiera, B. A.
Tematy:: TCP
congestion control
LQG
adaptive control; Pokaż więcej
Data publikacji:: 2006
Powiązania:: https://bibliotekanauki.pl/articles/309088.pdf Link otwiera się w nowym oknie
Źródło:: Journal of Telecommunications and Information Technology; 2006, 1; 30-37
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Opis:: This paper addresses the problem of congestion control for transmission control protocol (TCP) traffic in the Internet. The method proposed builds on the ideas of TCP Vegas, a true feedback control approach to congestion management of TCP traffic. The new method is based on an adaptive linear quadratic Gaussian (LQG) formulation which uses an extended least squares system identification algorithm combined with optimal LQG control. Simulation experiments indicate that the new technique inherits good equilibrium properties from TCP Vegas, but has much superior transient responses which, the paper argues, is important for good dynamic congestion control.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 2.

Tytuł:: On the optimization of the inter - flow fairness in the Internet
O poprawie sprawiedliwości podziału pasma pomiędzy przepływy w Internecie
Autorzy:: Adamczyk, B.
Chydziński, A.
Tematy:: fairness
active queue management
congestion control; Pokaż więcej
Data publikacji:: 2012
Powiązania:: https://bibliotekanauki.pl/articles/375671.pdf Link otwiera się w nowym oknie
Źródło:: Theoretical and Applied Informatics; 2012, 24, 3; 205-225
1896-5334
Pojawia się w:: Theoretical and Applied Informatics
Opis:: All known active queue management algorithms invented to provide fair bandwidth allocation between TCP flows are designed to cooperate with the classic TCP congestion control (New Reno). However, some new congestion control schemes are becoming more and more popular nowadays (e.g. the Cubic algorithm). Therefore, the following question arises: will these fair queue management algorithms work well in the presence of a new congestion control scheme? To answer this questions, we present a comprehensive study of the performance of seven fair queue management algorithms in the presence of seven TCP variants. In particular, the fairness index, queue size and throughput were measured in scenarios with diversified RTTs, traffic patterns and congestion levels. Not only do the results allow us to answer the aforementioned question, but also to formulate recommendation on how to provide the best cross-layer fairness optimization in the Internet.
Wszystkie znane z literatury algorytmy aktywnego zarządzania kolejkami (AQM) ukierunkowane na zapewnienie sprawiedliwego podziału pasma pomiędzy przepływy w Internecie były opracowywane z myślą o współpracy z (klasycznym dziś) algorytmem kontroli zatłoczenia TCP, tzn. New Reno. W ostatnich latach można zauważyć w Internecie istotne zwiększanie się udziału nowych algorytmów kontroli zatłoczenia TCP (jak np. algorytmu Cubic). Dlatego te˙z pojawia się naturalne pytanie: czy algorytmy sprawiedliwego podziału pasma zaprojektowane dla New Reno bedą równie dobrze działać w obecnosci tych nowych wariantów TCP? Aby uzyskać odpowiedź na to pytanie, przeprowadzone zostały szeroko zakrojone studia symulacyjne. Studia te uwzględniały siedem najważniejszych algorytmów AQM do sprawiedliwego podziału pasma, siedem wersji TCP (w tym najnowocześniejsze warianty), różne scenariusze zatłoczenia sieci oraz czasy RTT połączeń TCP. Uzyskane wyniki pozwoliły nie tylko udzielić odpowiedzi na sformułowane powyżej pytanie, ale także wskazać, które wersje TCP i AQM najlepiej realizują ideę optymalizacji międzywarstwowej w celu zapewnienia sprawiedliwego podziału pasma pomiędzy przepływy w Internecie.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 3.

Tytuł:: Quantity-based flow control strategy for connection-oriented communication networks
Autorzy:: Karbowańczyk, M.
Żuk, J.
Tematy:: telecommunication networks
congestion control
Smith predictor; Pokaż więcej
Data publikacji:: 2012
Powiązania:: https://bibliotekanauki.pl/articles/201349.pdf Link otwiera się w nowym oknie
Źródło:: Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 2; 293-300
0239-7528
Pojawia się w:: Bulletin of the Polish Academy of Sciences. Technical Sciences
Opis:: In this paper a new flow control strategy for connection-oriented communication networks is presented. It utilises methods of control theory, in particular the Smith predictor and dead-beat control, to achieve desirable dynamics of the considered network. In contrast to a number of earlier proposals in which the controller command is interpreted as the rate transmission, in our solution it is interpreted as the quantity of data that the controlled node is expected to send. This allows us to model a single virtual connection with non-persistent data source as a time-delay system in which the delay may temporarily exceed its assumed boundary. Favourable properties of the proposed control strategy are formulated as mathematical theorems and thoroughly discussed.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 4.

Tytuł:: KFOA: K-mean Clustering, Firefly Based Data Rate Optimization and ACO Routing for Congestion Control in WSN
Autorzy:: Jadhav, Savita Sandeep
Jadhav, Sangeeta
Tematy:: congestion control
WSN
rate optimization
clustering
routing; Pokaż więcej
Data publikacji:: 2022
Powiązania:: https://bibliotekanauki.pl/articles/2200678.pdf Link otwiera się w nowym oknie
Źródło:: International Journal of Electronics and Telecommunications; 2022, 68, 4; 659--665
2300-1933
Pojawia się w:: International Journal of Electronics and Telecommunications
Opis:: Wireless sensor network (WSN) is assortment of sensor nodes proficient in environmental information sensing, refining it and transmitting it to base station in sovereign manner. The minute sensors communicate themselves to sense and monitor the environment. The main challenges are limited power, short communication range, low bandwidth and limited processing. The power source of these sensor nodes are the main hurdle in design of energy efficient network. The main objective of the proposed clustering and data transmission algorithm is to augment network performance by using swarm intelligence approach. This technique is based on K-mean based clustering, data rate optimization using firefly optimization algorithm and Ant colony optimization based data forwarding. The KFOA is divided in three parts: (1) Clustering of sensor nodes using K-mean technique and (2) data rate optimization for controlling congestion and (3) using shortest path for data transmission based on Ant colony optimization (ACO) technique. The performance is analyzed based on two scenarios as with rate optimization and without rate optimization. The first scenario consists of two operations as k-mean clustering and ACO based routing. The second scenario consists of three operations as mentioned in KFOA. The performance is evaluated in terms of throughput, packet delivery ratio, energy dissipation and residual energy analysis. The simulation results show improvement in performance by using with rate optimization technique.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 5.

Tytuł:: Sared: self-adaptive active queue management scheme for improving quality of service in network systems
Autorzy:: Adamu, Aminu
Surajo, Yusuf
Jafar, Muhammad T.
Tematy:: congestion control
AQM
RED
SARED
network systems
QoS; Pokaż więcej
Data publikacji:: 2021
Powiązania:: https://bibliotekanauki.pl/articles/2097975.pdf Link otwiera się w nowym oknie
Źródło:: Computer Science; 2021, 22 (2); 251-266
1508-2806
2300-7036
Pojawia się w:: Computer Science
Opis:: Considering the phenomenal growth of network systems, congestion remains a threat to the quality of the service provided in such systems; hence, research on congestion control is still relevant. The Internet research community regards active queue management (AQM) as an effective approach for addressing congestion in network systems. Most of the existing AQM schemes possess static drop patterns and lack a self-adaptation mechanism; as such they do not work well for networks where the traffic load fluctuates. This paper proposes a self-adaptive random early detection (SARED) scheme that smartly adapts its drop pattern based on a current network’s traffic load in order to maintain improved and stable performance. Under light- to moderate-load conditions, SARED operates in nonlinear modes in order to maximize utilization and throughput, while it switches to a linear mode in order to avoid forced drops and congestion under high-load conditions. Our conducted experiments revealed that SARED provides optimal performance regardless of the condition of the traffic load.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 6.

Tytuł:: Robust Flow Controllers for a Single Virtual Circuit in Data Transmission Networks with Lossy Links
Autorzy:: Bartoszewicz, A.
Leśniewski, P.
Tematy:: data transmission networks
congestion control
sliding-mode control
discrete-time systems; Pokaż więcej
Data publikacji:: 2012
Powiązania:: https://bibliotekanauki.pl/articles/108780.pdf Link otwiera się w nowym oknie
Źródło:: Journal of Applied Computer Science Methods; 2012, 4 No. 1; 5-20
1689-9636
Pojawia się w:: Journal of Applied Computer Science Methods
Opis:: The paper concerns an application of regulation theory methods to modeling and effective control of connection-oriented data transmission networks. In particular the problem of congestion control in a single virtual circuit of such a network is considered and new discrete-time sliding mode data flow rate controllers are proposed. The controllers are designed in such a way that packet losses are explicitly accounted for. The closed-loop system stability and finitetime error convergence are proved. Moreover, a number of favorable properties of the proposed controllers are stated as theorems, formally proved and verified in a simulation example. It is demonstrated that the proposed controllers guarantee full utilization of the available bandwidth and eliminates the risk of bottleneck node buffer overflow. Application of time-varying sliding hyperplanes helps avoid excessive transmission rates at the beginning of the control process.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 7.

Tytuł:: Fractional order PI controllers for TCP packet flow ensuring given modulus margins
Autorzy:: Krajewski, W.
Viaro, U.
Tematy:: fractional-order PI controllers
robust control
TCP congestion control
delayed systems; Pokaż więcej
Data publikacji:: 2014
Powiązania:: https://bibliotekanauki.pl/articles/205939.pdf Link otwiera się w nowym oknie
Źródło:: Control and Cybernetics; 2014, 43, 4; 493-505
0324-8569
Pojawia się w:: Control and Cybernetics
Opis:: An Active Queue Management (AQM) robust control strategy for Traffic Control Protocol (TCP) data transfer is proposed. To this purpose, the TCP behaviour is first approximated by a second–order model with delayed input obtained from the linearization of an efficient and commonly used nonlinear fluid–based model. The adopted feedback control structure uses a fractional– order PI controller. To ensure the desired robustness, the parameter regions where such a controller guarantees a given modulus margin (inverse of the H1 norm of the sensitivity function) are derived. An example commonly used in the literature is worked out to show that the suggested graphically–based design technique is simple to apply while it limits the effects of disturbances and of the unmodelled dynamics.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 8.

Tytuł:: Price Method and Network Congestion Control
Autorzy:: Malinowski, K.
Niewiadomska-Szynkiewicz, E.
Jaskóła, P.
Tematy:: computer network
congestion control
coordination strategy
price
price instruments
retail pricing problem; Pokaż więcej
Data publikacji:: 2010
Powiązania:: https://bibliotekanauki.pl/articles/309158.pdf Link otwiera się w nowym oknie
Źródło:: Journal of Telecommunications and Information Technology; 2010, 2; 73-77
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Opis:: Price instruments are useful in achieving market balance conditions in various markets. Those instruments can be also used for control of other composite systems. The formulation and basic properties of the Price Method are reviewed and then the congestion control by price instruments in a computer network is described and tested.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 9.

Tytuł:: New challenges in dynamical systems: the networked case
Autorzy:: Bauer, P. H.
Tematy:: kontrola przeciążeń
sieć komputerowa
sieć sensorowa
synchronizacja
networked systems
sensor networks
swarms
congestion control
synchronization; Pokaż więcej
Data publikacji:: 2008
Powiązania:: https://bibliotekanauki.pl/articles/907913.pdf Link otwiera się w nowym oknie
Źródło:: International Journal of Applied Mathematics and Computer Science; 2008, 18, 3; 271-277
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Opis:: This paper describes new technical challenges that arise from networking dynamical systems. In particular, the paper takes a look at the underlying phenomena and the resulting modeling problems that arise in such systems. Special emphasis is placed on the problem of synchronization, since this problem has not received as much attention in the literature as the phenomena of packet drop, delays, etc. The paper then discusses challenges arising in prominent areas such as congestion control, sensor networks, as well as vehicle networks and swarms.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 10.

Tytuł:: Active queue management with discrete sliding modes in TCP networks
Autorzy:: Ignaciuk, P.
Karbowańczyk, M.
Tematy:: sliding-mode control
congestion control
active queue management
AQM
discrete-time control systems
kontrola przeciążenia
aktywne zarządzanie kolejką
dyskretne systemy kontroli; Pokaż więcej
Data publikacji:: 2014
Powiązania:: https://bibliotekanauki.pl/articles/201360.pdf Link otwiera się w nowym oknie
Źródło:: Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 4; 701-711
0239-7528
Pojawia się w:: Bulletin of the Polish Academy of Sciences. Technical Sciences
Opis:: 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.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Informacja

Wyszukujesz frazę "congestion control" wg kryterium: Temat