Flow Control In Connection Oriented Communication Networks with Variable Number of Virtual Connections

• Autorzy: Molik T. , Bartoszewicz A.
• Języki publikacji: EN

Abstrakty

EN

The paper presents a new discrete time flow control algorithm for connection oriented communication networks. The algorithm effectively exploits the Smith predictor, the discrete time proportional controller with saturation and the feed-forward compensation. The proposed control strategy helps avoid the bottleneck node buffer overflow and ensures full utilisation of the available bandwidth. The algorithm maintains its favourable properties even if the number of data sources, and virtual connections, changes during the network operation.

Słowa kluczowe

EN

flow control; Smith predictor; Smith principle

PL

predyktor Smitha

• Wydawca: Wydawnictwo Politechniki Łódzkiej
• Czasopismo: Journal of Applied Computer Science
• Rocznik: 2005
• Tom: Vol. 13, nr 2
• Strony: 79--93
• Opis fizyczny: Bibliogr. 13 poz.

Twórcy

autor

Molik T.

• Technical University of Lodz, Institute of Automatic Control, 18/22 Stefanowskiego St., 90-924 Łódź, Poland

autor

Bartoszewicz A.

• Technical University of Lodz, Institute of Automatic Control, 18/22 Stefanowskiego St., 90-924 Łódź, Poland

Bibliografia

• [1] Bartoszewicz A., Karbowańczyk M.: Sampled Time Flow Control Algorithm For Fast Connection Oriented Communication Networks. Journal of Applied Computer Science, 2003, vol. 11, pp. 5-16.
• [2] Bartoszewicz A., Molik T.: ABR traffic control over multi-source single-bottleneck ATM networks. Journal of Applied Mathematics and Computer Science, 2004, vol. 14, pp. 101-109.
• [3] Chong S., Nagarajan R., Wang Y.: First-order rate-based flow control with dynamic queue threshold for high-speed wide-area ATM networks. Computer Networks and ISDN Systems, 1998, vol. 29, pp. 2201-2212.
• [4] De-Hui Sun, Qiu-Hong Zhang, Zhi-Chun Mu: Single parametric fuzzy adaptive PID control and robustness analysis based on the queue size of network node. Proceedings of 2004 International Conference on Machine Learning and Cybernetics, 2004, vol. 1, pp. 397-400.
• [5] Gomez-Stern F., Fornés J., Rubio F.: Dead-time compensation for ABR traffic control over ATM networks. Control Engineering Practice, 2002, vol. 10, pp. 481-491.
• [6] Grzech A.: Sterowanie ruchem w sieciach teleinformatycznych. Oficyna Wydawnicza Politechniki Wrocławskiej, Wrocław, 2002.
• [7] Imer O., Compans S., Basar T., Srikant R.: Available bit rate congestion control in ATM networks. IEEE Control Systems Magazine, 2001, pp. 38-56.
• [8] Jagannathan S., Talluri J.: Predictive congestion control of ATM networks: multiple sources/single buffer scenario. Automatica, 2002, vol. 38, pp. 815-820.
• [9] Laberteaux K., Rohrs Ch., Antsaklis P.: A practical controller for explicit rate congestion control. IEEE Transactions on Automatic Control, 2002, vol. 47, pp. 960-978.
• [10] Lengliz I., Kamoun F.: A rate-based flow control method for ABR service in ATM networks. Computer Networks, 2000, vol. 34, pp. 129-138.
• [11] Mascolo S.: Smith's principle for congestion control in high speed ATM networks. Proceedings of the 36th IEEE Conference on Decision and Control, San Diego, 1997, pp. 4595-4600.
• [12] Mascolo S.: Congestion control in high-speed communication networks using the Smith principle. Automatica, 1999, vol. 35, pp. 1921-1935.
• [13] Mascolo S.: Smith's principle for congestion control in high-speed data networks. IEEE Transactions on Automatic Control, 2000, vol. 45, pp. 358-364.