Temat: distributed computations - Katalog OPAC zbiorów

Skocz do pozycji: 1.

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: 2.

Tytuł:: A Java-based secure platform for distributed computation
Autorzy:: Glebov, A.
Powiązania:: https://bibliotekanauki.pl/articles/115751.pdf
Data publikacji:: 2010
Wydawca:: Fundacja na Rzecz Młodych Naukowców
Tematy:: distributed computations
Java RMI
remote method invocation security
authentication and encryption overhead.
Opis:: We present a platform for distributed computation that employs Java RMI as the underlying communication technology, making use of its remote class-loading features. The platform permits dynamic connection of executor nodes and guarantees that executors are properly released. Security is reinforced by authentication based on X.509 certifi cates and SSL encryption. We show that the overhead associated with authentication and encryption is negligible in practically important cases.
Źródło:: Challenges of Modern Technology; 2010, 1, 1; 76-78
2082-2863
2353-4419
Pojawia się w:: Challenges of Modern Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

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ł

Informacja