|
|
Vivaldi algorithm for Internet nodes localization
Handl, Tomáš ; Jelínek, Mojmír (referee) ; Komosný, Dan (advisor)
Diploma thesis deals with usage of artificial coordinate systems used for localization of a station on the internet and prediction of delay between the stations. There are described and compared basic properties of centralized and decentralized algorithms providing station localization on the internet and RTT prediction. More in depth are presented main representatives of both types of algorithms such as GNP, IDMAPS or Lighthouse. Central part of thesis is aimed at getting to know Vivaldi distributed algorithm. Basic principle of the algorithm for constant and variable time step, using two dimensional coordinate system with 3rd parameter height, is here outlined. Further more implementation of this algorithm as a library Vivaldi-lib in the environment of Java is implemented. Part of the thesis are simulations of behaviour of this algorithm for both variations realized on artificial networks and data obtained from PlanetLab experimental network, using simulation created program VIVALDIMONITOR.
|
|
|
Internet nodes localization using synthetic coordinate systems
Švéda, Jaroslav ; Jelínek, Mojmír (referee) ; Komosný, Dan (advisor)
This thesis deals with predicting the latency between two network nodes, such as the two stations, two servers or server and station. The main reason for adoption of effective latency prediction techniques is the elimination of network load caused by unnecessary repeated transmissios or by direct measurement of the latency. Of the many proposed methods of latency estimation, this thesis is focused on methods using artificial coordinate systems with primary focus on the Vivaldi algorithm. Characteristics of the latency prediction methods and properties of various coordinate systems used in practice are evaluated. The issue of the number of dimensions of space defined only by the latency matrix between nodes is also mentioned. Furthermore, some other systems, based on logical clustering of nearby nodes, are mentioned. Description of simulation software VivaldiMonitor developed as part of the thesis is included. The primary purpose is analysis of the behavior of overlay networks implementing Vivaldi algorithm with less than a few hundred nodes. The Vivaldi algorithm is assessed by several simulations carried out using the aforementioned software.
|
|
|
Localization of nodes in Internet using Vivaldi system with adaptive time step
Mašín, Jan ; Balej, Jiří (referee) ; Komosný, Dan (advisor)
The aim of this thesis was to identification with the principles of logical evaluation of the position of stations on the Internet. Read up on the localization algorithm called Vivaldi with adaptive time step and subsequently to its implementation in the operating system GNU/Linux CentOS distribution. Do one's homework the PlanetLab experimental network (http://www.planet-lab.org/). At selected stations from the network transfer created by the application and verify its function on the real servers located at various places around the globe and assess the accuracy achieved by estimating the distance between stations on the PlanetLab network. In this scope of activity, the application was created to measure the delay prediction using Vivaldi algorithm with adaptive time step which is on principle of operation a client-server where the client performs the steps of the algorithm, Vivaldi and the server only listens, collects the resulting data Vivaldi algorithm and stores them neatly file. Furthermore, the application was developed for direct measurement of the delay, which also functions as a client-server. These applications have been transferred to the selected nodes from the PlanetLab experimental network. Subsequently, these nodes were running, to carry out the necessary measurements. The resulting values were work into tables of using Microsoft Excel. These values were then compared with direct measurements and competitive positioning by the King. Vivaldi localization methods with adaptive time step and the King, were compared based on calculated estimates of both real estate errors and measurement using distribution function of the relative errors of both methods. All this information was evaluated to compare accuracy of both the localization methods and direct measurements.
|
|
|
Localization of nodes in Internet using Vivaldi system with adaptive time step
Mašín, Jan ; Balej, Jiří (referee) ; Komosný, Dan (advisor)
The aim of this thesis was to identification with the principles of logical evaluation of the position of stations on the Internet. Read up on the localization algorithm called Vivaldi with adaptive time step and subsequently to its implementation in the operating system GNU/Linux CentOS distribution. Do one's homework the PlanetLab experimental network (http://www.planet-lab.org/). At selected stations from the network transfer created by the application and verify its function on the real servers located at various places around the globe and assess the accuracy achieved by estimating the distance between stations on the PlanetLab network. In this scope of activity, the application was created to measure the delay prediction using Vivaldi algorithm with adaptive time step which is on principle of operation a client-server where the client performs the steps of the algorithm, Vivaldi and the server only listens, collects the resulting data Vivaldi algorithm and stores them neatly file. Furthermore, the application was developed for direct measurement of the delay, which also functions as a client-server. These applications have been transferred to the selected nodes from the PlanetLab experimental network. Subsequently, these nodes were running, to carry out the necessary measurements. The resulting values were work into tables of using Microsoft Excel. These values were then compared with direct measurements and competitive positioning by the King. Vivaldi localization methods with adaptive time step and the King, were compared based on calculated estimates of both real estate errors and measurement using distribution function of the relative errors of both methods. All this information was evaluated to compare accuracy of both the localization methods and direct measurements.
|
|
|
Vivaldi algorithm for Internet nodes localization
Handl, Tomáš ; Jelínek, Mojmír (referee) ; Komosný, Dan (advisor)
Diploma thesis deals with usage of artificial coordinate systems used for localization of a station on the internet and prediction of delay between the stations. There are described and compared basic properties of centralized and decentralized algorithms providing station localization on the internet and RTT prediction. More in depth are presented main representatives of both types of algorithms such as GNP, IDMAPS or Lighthouse. Central part of thesis is aimed at getting to know Vivaldi distributed algorithm. Basic principle of the algorithm for constant and variable time step, using two dimensional coordinate system with 3rd parameter height, is here outlined. Further more implementation of this algorithm as a library Vivaldi-lib in the environment of Java is implemented. Part of the thesis are simulations of behaviour of this algorithm for both variations realized on artificial networks and data obtained from PlanetLab experimental network, using simulation created program VIVALDIMONITOR.
|
|
|
Internet nodes localization using synthetic coordinate systems
Švéda, Jaroslav ; Jelínek, Mojmír (referee) ; Komosný, Dan (advisor)
This thesis deals with predicting the latency between two network nodes, such as the two stations, two servers or server and station. The main reason for adoption of effective latency prediction techniques is the elimination of network load caused by unnecessary repeated transmissios or by direct measurement of the latency. Of the many proposed methods of latency estimation, this thesis is focused on methods using artificial coordinate systems with primary focus on the Vivaldi algorithm. Characteristics of the latency prediction methods and properties of various coordinate systems used in practice are evaluated. The issue of the number of dimensions of space defined only by the latency matrix between nodes is also mentioned. Furthermore, some other systems, based on logical clustering of nearby nodes, are mentioned. Description of simulation software VivaldiMonitor developed as part of the thesis is included. The primary purpose is analysis of the behavior of overlay networks implementing Vivaldi algorithm with less than a few hundred nodes. The Vivaldi algorithm is assessed by several simulations carried out using the aforementioned software.
|
guest ::
