|
|
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.
|
|
|
Node localization on the Internet using domain name system
Dvořák, Petr ; Müller, Jakub (referee) ; Komosný, Dan (advisor)
This paper describes various systems that are used to predict delay among nodes . It focuses on systems using for prediction delay artificial coordinate systems, and on the systems, which use physical measurements of delay. Primarily, however, it deals with the King method, which uses the system for translation of domain names - DNS (Domain Name System) to predict the delay. Next, the principle of the King method is outlined in detail. Practical part includes a description of the two created simulations in program Matlab. The first application described simulates the King method principle. The second simulation is then tasked with creating 2D geometric space in which nodes and DNS servers are randomly generated. The result is dependence of RTT prediction accuracy on the number of randomly generated DNS servers. Based on this dependency the method King is compared with other methods in the end.
|
|
|
Node localization on the Internet using domain name system
Dvořák, Petr ; Müller, Jakub (referee) ; Komosný, Dan (advisor)
This paper describes various systems that are used to predict delay among nodes . It focuses on systems using for prediction delay artificial coordinate systems, and on the systems, which use physical measurements of delay. Primarily, however, it deals with the King method, which uses the system for translation of domain names - DNS (Domain Name System) to predict the delay. Next, the principle of the King method is outlined in detail. Practical part includes a description of the two created simulations in program Matlab. The first application described simulates the King method principle. The second simulation is then tasked with creating 2D geometric space in which nodes and DNS servers are randomly generated. The result is dependence of RTT prediction accuracy on the number of randomly generated DNS servers. Based on this dependency the method King is compared with other methods in the end.
|
|
|
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 ::
