Autor: Karbowski, A. - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Direct method of hierarchical nonlinear optimization - reassessment after 30 years
Autorzy:: Karbowski, A.
Powiązania:: https://bibliotekanauki.pl/articles/308864.pdf
Data publikacji:: 2004
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: hierarchical optimization
decomposition
direct method
Benders method
cutting plane method
distributed computations
Opis:: We consider the optimization problems which may be solved by the direct decomposition method. It is possible when the performance index is a monotone function of other performance indices, which depend on two subsets of decision variables: an individual for every inner performance index and a common one for all. Such problems may be treated as a generalization of separable problems with the additive cost and constraints functions. In the paper both the underlying theory and the basic numerical techniques are presented and compared. A special attention is paid to the guarantees of convergence in different classes of problems and to the effectiveness of calculations.
Źródło:: Journal of Telecommunications and Information Technology; 2004, 3; 3-11
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Distributed, asynchronous algorithms for network control with contracted flow rates - a review
Autorzy:: Karbowski, A.
Powiązania:: https://bibliotekanauki.pl/articles/308928.pdf
Data publikacji:: 2006
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: computer networks
asynchronous algorithms
distributed optimization
routing
service level agreement
service quality
Opis:: The paper reviews current algorithms for distributed, asynchronous control of networks when the customer is guaranteed to get some predetermined (e.g., as a part of a service level agreement - SLA) values of flow. Two cases are considered - both with single and multiple commodity. It is assumed, that the flow cost functions are convex with special attention devoted to linear and strictly convex cases.
Źródło:: Journal of Telecommunications and Information Technology; 2006, 4; 46-52
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: On the connections between optimal control, regulation and dynamic network routing
Autorzy:: Karbowski, A.
Powiązania:: https://bibliotekanauki.pl/articles/307694.pdf
Data publikacji:: 2003
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: stabilization
nonlinear control
optimal control
dynamic programming
data networks
routing algorithms
Opis:: The paper is devoted to studying general features of dynamic network routing problems. It is shown that these problems may be interpreted as receding horizon optimal control problems or simply regulation problems. In the basic formulation it is assumed, that the nodes have no dynamics and the only goal of the optimization mechanism is to find the shortest paths from the source to the destination nodes. In this problem the optimization mechanism (i.e. the Bellman-Ford algorithm) may be interpreted as a receding horizon optimal control routine. Moreover, there is one-toone correspondence between the Bellman optimal cost-to-go function in the shortest path problem and the Lyapunov function in the regulation problem. At the end some results of the application of the routing optimization algorithm to an inverted pendulum regulation problem are presented.
Źródło:: Journal of Telecommunications and Information Technology; 2003, 3; 67-72
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

Tytuł:: Distributed asynchronous algorithms in the Internet - new routing and traffic control methods
Autorzy:: Karbowski, A.
Powiązania:: https://bibliotekanauki.pl/articles/309014.pdf
Data publikacji:: 2005
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: computer networks
optimization
shortest path
traffic control
decomposition
distributed computations
asynchronous algorithms
Opis:: The paper presents several new algorithms concerning the third (network) and the fourth (transport) layer of ISO/OSI network model. For the third layer two classes of the shortest paths algorithms - label correcting and auction algorithms - are proposed. For the fourth layer an application of price decomposition to network optimization and Internet congestion control is suggested.
Źródło:: Journal of Telecommunications and Information Technology; 2005, 3; 29-36
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 5.

Tytuł:: New Developments in a Two-criteria Approach to Dynamic Power Management in Energy-aware Computer Networks
Autorzy:: Karbowski, A.
Jaskóła, P.
Powiązania:: https://bibliotekanauki.pl/articles/309427.pdf
Data publikacji:: 2016
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: data-intensive computing
energy-aware network
energy-aware routing
dynamic power management
MIQP problems
traffic engineering
Opis:: In the paper authors continue the development of a model of dynamic power management in energy-aware computer networks, where two criteria: energy consumption and the quality of service are considered. This approach is appropriate when the routing problem with fixed demands is inadmissible. The formulation introducing edge indices is modified and tests on problems of different sizes are performed.
Źródło:: Journal of Telecommunications and Information Technology; 2016, 2; 21-25
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja