Flow control in connection-oriented networks: a time-varying sampling period system case study

Title:

Flow control in connection-oriented networks: a time-varying sampling period system case study

Creator:

Ignaciuk, Przemysław and Bartoszewicz, Andrzej

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:2baea76f-8260-4325-8539-b6d1e06d350c
uuid:2baea76f-8260-4325-8539-b6d1e06d350c

Subject:

congestion control, connection-oriented networks, sampled data systems, and variable sampling period

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

In this paper congestion control problem in connection-oriented communication network with multiple data sources is addressed. In the considered network the feedback necessary for the flow regulation is provided by means of management units, which are sent by each source once every data packets. The management units, carrying the information about the current network state, return to their origin round trip time after they were sent. Since the source rate is adjusted only at the instant of the control units arrival, the period between the transfer speed modifications depends on the flow rate earlier, and consequently varies with time. A new, nonlinear algorithm combining the Smith principle with the proportional controller with saturation is proposed. Conditions for data loss elimination and full resource utilisation are formulated and strictly proved with explicit consideration of irregularities in the feedback information availability. Subsequently, the algorithm robustness with respect to imprecise propagation time estimation is demonstrated. Finally, a modified strategy implementing the feed-forward compensation is proposed. The strategy not only eliminates packet loss and guarantees the maximum resource utilisation, but also decreases the influence of the available bandwidth on the queue length. In this way the data transfer delay jitter is reduced, which helps to obtain the desirable Quality of Service (QoS) in the network.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

[336]-359

Source:

Kybernetika | 2008 Volume:44 | Number:3

Harvested from:

CDK

Metadata only:

false