Národní úložiště šedé literatury Nalezeno 2 záznamů.  Hledání trvalo 0.01 vteřin. 
Simulation of IP node localization, using Vivaldi and GNP algorithms
Sulík, Peter ; Komosný, Dan (oponent) ; Müller, Jakub (vedoucí práce)
The work deals with the issues of network coordinate systems. The first chapter is devoted to a brief analysis of this systems and requirements placed on them. Furthermore, it deals with features of Vivaldi algorithm and its three versions: a centralized algorithm, algorithm with constant and adaptive time step. Subsequently it describes the GNP system and eash step of Nelder-Mead method for nodes localization. Next to it a developed simulation library is presented with its own graphical user interface for testing of these algorithms, which is capable of handling RTT responses database amongst individual IP network members. Simulations performed on data from PlanetLab network are evaluated in the conclusion.
Simulation of IP node localization, using Vivaldi and GNP algorithms
Sulík, Peter ; Komosný, Dan (oponent) ; Müller, Jakub (vedoucí práce)
The work deals with the issues of network coordinate systems. The first chapter is devoted to a brief analysis of this systems and requirements placed on them. Furthermore, it deals with features of Vivaldi algorithm and its three versions: a centralized algorithm, algorithm with constant and adaptive time step. Subsequently it describes the GNP system and eash step of Nelder-Mead method for nodes localization. Next to it a developed simulation library is presented with its own graphical user interface for testing of these algorithms, which is capable of handling RTT responses database amongst individual IP network members. Simulations performed on data from PlanetLab network are evaluated in the conclusion.

Chcete být upozorněni, pokud se objeví nové záznamy odpovídající tomuto dotazu?
Přihlásit se k odběru RSS.