|
|
Simulation of IP node localization, using Vivaldi and GNP algorithms
Sulík, Peter ; Komosný, Dan (referee) ; Müller, Jakub (advisor)
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.
|
|
|
Host distance measurement using ICMP protocol in IP networks
Fojtová, Lucie ; Komosný, Dan (referee) ; Burget, Radim (advisor)
Current internet more and more often faces the problem of the right definition of distance between the single hosts. The knowledge of this quantity influences the areas of the optimal lay-out of overlay multicast networks, the right selection of peer-to-peer network participant, or the simple decision of the end user: which one of the nearest mirrors to use for downloading datas. The nearest one doesn't have to mean the nearest in geographical point of view - the distance on Internet is usually expressed by quantities as latency or bandwidth. All these examples have got the saving of bandwidth in common and therefore economical saving. The methods of host position prediction in networks work on the basis of measuring latency parameter. The tools for measuring of this parameter will be set up in this thesis and at the same time it will be shown how geographical distance and latency correspond with each other.
|
|
|
Entropic generator of random numbers
Kolář, Michal ; Číž, Radim (referee) ; Burda, Karel (advisor)
This paper is focused on generating random number via entropy generators. There are described sources of entropy on personal computer and described methods of detecting their entropy. There are also described basic operations used for construction and for concept solution this generator under NIST recommendation for personal computer and methods of their testing.
|
|
|
Entropic random number generator
Kukko, Marcel ; Zeman, Václav (referee) ; Burda, Karel (advisor)
The paper is focused on the random number generation by personal computer. It describes the most widely used types of random sequence generators and methods for their testing. The second part is focused on the design of the generator and an analysis of its testing.
|
|
|
Location of hosts in IPTV system
Pokludová, Michaela ; Burget, Radim (referee) ; Müller, Jakub (advisor)
This thesis deals with locating station in the digital television broadcast over the Internet Protocol. The aim of this thesis was to develop a general model for the location of stations in the system of internet TV. This work deals with the five known methods for locating stations in distributed systems, which compares as many criteria, such as coordinates of computation speed, accuracy of results. Based on the evaluation was selected optimal method, which has been incorporated into the simulation program IPTV and tested. The result of this work is the source code of the implemented methods.
|
|
|
Localization of nodes in Internet using Lighthouses system
Smrčka, Lukáš ; Müller, Jakub (referee) ; Komosný, Dan (advisor)
The thesis is focused on the localization of stations in the Internet with the help of artificial coordinate systems. These systems can be used to estimate the delay value of RTT between individual stations. The estimated delay value can e.g. help the station to choose an optimal second station for communication between two stations without the necessity to measure these values, which reduces the load of the net. The first part of the thesis describes systems that predict the delay and explains how the methods Vivaldi, Kings, GNP and Lighthouses work. The next part of the work gives basic information about environment where the chosen method shall be implemented. The final part defines both the Lighthouses method and a program designed to be used in the experimental PlanetLab network and it also evaluates achieved accuracy of the estimation.
|
|
|
Entropic random number generator
Kukko, Marcel ; Zeman, Václav (referee) ; Burda, Karel (advisor)
The paper is focused on the random number generation by personal computer. It describes the most widely used types of random sequence generators and methods for their testing. The second part is focused on the design of the generator and an analysis of its testing.
|
|
|
Localization of nodes in Internet using Lighthouses system
Smrčka, Lukáš ; Müller, Jakub (referee) ; Komosný, Dan (advisor)
The thesis is focused on the localization of stations in the Internet with the help of artificial coordinate systems. These systems can be used to estimate the delay value of RTT between individual stations. The estimated delay value can e.g. help the station to choose an optimal second station for communication between two stations without the necessity to measure these values, which reduces the load of the net. The first part of the thesis describes systems that predict the delay and explains how the methods Vivaldi, Kings, GNP and Lighthouses work. The next part of the work gives basic information about environment where the chosen method shall be implemented. The final part defines both the Lighthouses method and a program designed to be used in the experimental PlanetLab network and it also evaluates achieved accuracy of the estimation.
|
|
|
Entropic generator of random numbers
Kolář, Michal ; Číž, Radim (referee) ; Burda, Karel (advisor)
This paper is focused on generating random number via entropy generators. There are described sources of entropy on personal computer and described methods of detecting their entropy. There are also described basic operations used for construction and for concept solution this generator under NIST recommendation for personal computer and methods of their testing.
|
|
|
Simulation of IP node localization, using Vivaldi and GNP algorithms
Sulík, Peter ; Komosný, Dan (referee) ; Müller, Jakub (advisor)
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.
|
guest ::
