Wyniki wyszukiwania - BazTech

1

Active queue management with discrete sliding modes in TCP networks

Ignaciuk P., Karbowańczyk M.

Bulletin of the Polish Academy of Sciences. Technical Sciences

|

2014

|

Vol. 62, nr 4

701--711

EN

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.

2

Congestion Control Based on Distributed Statistical QoS-Aware Routing Management

Barabas M., Boanea G., Rus A. B., Dobrota V.

Przegląd Elektrotechniczny

|

2013

|

R. 89, nr 2b

251--256

EN

In this paper a distributed routing management solution is described that takes into consideration statistical Quality of Service (QoS) information about the state of network links. The goal is to offer dynamic metrics to the routing algorithm based on the current resource utilization, i.e. the routing metrics will depend on the traffic load and the delay measured on individual links in real-time. Identification of congested areas allows situation-aware path selection, enhancing the global capacity of the network by determining optimal routes.

PL

W artykule przedstawiono sposób zarządzania routowaniem, w którym wzięto pod uwagę parameter QoS na temat stanu linków w sieci. Głównym celem było zastosowanie dynamicznej metryki do algorytmu routowania, opartej na informacji o bieżącym wykorzystaniu zasobów. Identyfikacja rejonów przeciążenia pozwala na polepszenie działania i pojemności sieci poprzez optymalizację ścieżki routowania.

3

ABR traffic control over multi-source single-bottleneck ATM networks

Bartoszewicz A., Molik T.

International Journal of Applied Mathematics and Computer Science

|

2004

|

Vol. 14, no 1

43-51

EN

The problem of flow control in fast, connection-oriented communication networks supporting the traffic generated by multiple sources is considered. A novel sampled time strategy governing the behaviour of the sources is proposed. The strategy combines the Smith principle with the conventional sampled time proportional controller. It guarantees an equal resource allocation between various users, full bottleneck link utilisation and no cell loss in the controlled network. Consequently, the need for cell retransmission is eliminated and a high throughput is ensured. Furthermore, transmission rates generated by the algorithm are limited. This property permits a direct implementation of the proposed strategy in the network environment. A simulation example confirms favourable performances of the proposed control scheme.