|
|
Localization of IP stations based on model of probability delay measurement
Tropp, Peter ; Komosný, Dan (referee) ; Verner, Lukáš (advisor)
The master thesis is dealing with Internet host localization methods, more exactly with determining geographical position of the unknown Internet host connected to the network using RTT delay measuring. The first part is dealing with description of RTT delays that may occur in the network and tools for their measurement. The next is part of thesis is devoted to description of two kinds of localization methods. Ones that are using existing data to determine the position of Internet host also called passive methods, and others that are using RTT delay measurement, also called active methods. The main part is focused on GeoWeight method which is based on geographical localization estimation of Internet host. It is based on RTT delay measurement using the principles of CBG method, enhanced by introduction of the theory of weights according to the probability of the target Internet host. The last part is describing the application that was made to determine the geographic localization of the target Internet host using GeoWeight method. The application was afterwards tested by measuring RTT delay in PlanetLab experimental network. At the end the final measured results were compared with other localization methods (CBG, Octant, SOI, GeoIP).
|
|
|
Geolocation in Internet using latency measurements
Harth, Petr ; Balej, Jiří (referee) ; Komosný, Dan (advisor)
This diploma thesis is concerned with practical realization of CBG (Constraint-based Geolocation) algorithm, which is one of the IP (Internet Protocol) geolocation technique. IP geolocation determines the localization of a computer workstation location on the basis of on its IP address. The factors causing delays in data transfer are discussed first, followed by discussion of the issue of measuring these delays. The detailed explanation of IP geolocation follows where its contexts as well as the active geolocation techniques (techniques based on delay measurement mentioned above) are described. After that a brief description of PlanetLab experimental network, which was used for geolocation techniques measuring, is presented followed by a section explaining the creation of reference points and targets, which are another necessary prerequisite for practical realization of the method. Then the practical realization is explained in the form of CBGfinder program and its verification on the basis of artificial input data along with an actual example of IP geolocation of a point in the Internet are provided. Last but not least the measurement results of CBG algorithm are introduced, based on the analysis of Bestline parameters of one of the PlanetLab nodes measured in the period of one month, followed by a discussion of the inaccuracy of geological position and the computation speed. The cumulative distribution function as well as the kernel density estimation are also described. Final part of the thesis consists of discussion on measured results compared to results of other geological techniques results implemented by colleagues of the author of this diploma thesis. The results are compared on the basis of average inaccuracy of geological position estimations and its median, computation time, cumulative distribution function and kernel density estimation are also taken into regard.
|
|
| |
|
|
Geolocation in Internet using network topologies
Dvořák, Filip ; Verner, Lukáš (referee) ; Komosný, Dan (advisor)
The thesis discusses about modern geolocation methods and it describes the basic principles of their work. The work is divided into 2 parts - the theoretical one and the practical one. The first part of the thesis is focused on the description of these methods and on the explanation of its basic concepts which are used for determining of the physical position of the station according to its IP address. The second more extensive part of the work focuses on the description of the realization of algorithm in the Octant method in the programming language of Java and its use in the experimental net of PlanetLab. One important thing is to create a set of reference points and targets, which are necessary for the testing of the whole algorithm of the Octant Method. The results of estimated accuracy of target location obtained by the Octant method and their comparison with the results obtained by active methods of CBG, SOI and with the passive method of GeoIP are listed at the end of this work.
|
|
|
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.
|
|
|
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.
|
|
|
Geolocation of Internet hosts
Ingr, Michal ; Müller, Jakub (referee) ; Balej, Jiří (advisor)
This master thesis deals with methods of stations’ geolocation on the Internet, it means the estimation geographic location of unknown station, which is conected to this network. The introductory part describes the methods for determining position, which don‘t need any measeruments of the network. The next section is devoted to points, where delay is invoked, to the causes of latency in the Internet, to their types and some usual values. The following part features ways to measure delays and route, including several tools for this purpose. The penulminate section describes some chosen geolocation techniques based on RTT measurement. The final chapter is devoted to practical demonstration geolocation using the CBG method, when the delay measurement was carried out in an experimental PlanetLab network.
|
|
|
Location of node real position on the Internet
Kopeček, Tomáš ; Müller, Jakub (referee) ; Komosný, Dan (advisor)
In this thesis I focus on finding the position of computers on the Internet. This need for locating computers originated in the last several years through the creation of overlay networks. For this activity there are many algorithms. This paper describes the King method that estimated the distance between communicating stations by using the domain name system. The aim of this work is to verify the accuracy of the King method in experimental PlanetLab network. This network provides access for more than 1000 stations worldwide.
|
|
|
Visualization of relations between computers in the Internet
Cimbálek, Přemysl ; Malý, Jan (referee) ; Komosný, Dan (advisor)
Internet Protocol Television (IPTV) transmits the television signal over the TCP/IP family of protocols. Its advantages are for example that the transmitting is not only one-way as in the “classical” TV broadcasting, but it can provide feedback such as interactivity. There are also some problems which avoids development, for example low channel capacity of access networks. That is why new methods , for example how to get more efficiency in IPTV transmission, are proposed. The main task of this diploma thesis is to visualize tree structure of relations between nodes in the network, based on understanding of principles of the hierarchical summarization and IPTV transmitting. The nodes in the tree structure provide computing and summarizing of the data in back-way channel. There is the data from the end users in this channel. In the first part of this diploma thesis there is explained the principle of IPTV and its differences as compared with classical TV broadcasting. The part is also aimed for the supported services, advantages and disadvantages. There is explained the compressing data with the MPEG-2 and MPEG-4 standards and problems with transport networks called “last mile problem.” To transmitting data IPTV uses Source Specific Multicast – every user connects to the multicast session with requested TV program. Feedback is provided by unicast. Feedback network uses the hierarchical summarization principle to reduce the data. This problem, connected with RTP, RTCP and TTP protocols, is in the work described as well. There is an international experimental network called PlanetLab mentioned in theoretical part of this work. Proposed structure of new protocol and applications including the visualization for IPTV broadcast, is tested in that network. In the practical part of this work there are discussed possibilities and methods for the visualization and data storage. Because of high availability and flexibility, there were chosen web technologies, such as MySQL for data storage. The tree model is executed by Java. The visualization is solved by web technologies, source code for visualization is dynamically generated by scripts in JSP (Java Server Pages). Graphical output is provided by the vector format SVG (Scalable Vector Graphics) which is created for graphical expression on the internet and in the mobile phones. There were created interactive web application thanks its ability to cooperation with Javascript technology. This application visualizes relation-tree structure of nodes. In this work there are explained basics of all used technologies, there are also given reasons for chosen methods and formats. Examples and interesting parts of solution are mentioned as well.
|
|
|
Establishing the physical position of a computer in the Internet
Relovský, Josef ; Kubánková, Anna (referee) ; Komosný, Dan (advisor)
This master‘s thesis is formed as a part of the research project for whose analyse is used the worldwide experimental network called PlanetLab. The whole dilemma is engaged by IPTV technology. IPTV is a protocol that makes possible transfer data of a television content over the Internet to the end user. In the IPTV technology the server is a source. These data are presented as a video and audio signal (streem) which are required to deliver to the end users. Some structure, which presents alternate these computers´connection, has been established, because the technology making use of the big pretention is used. The most patent way between the source and the destination is found. My objective is design this structure in the pursuit. The principle of the signal ramification from one node to several nodes (in group) is called multicast. Rather said from one node to the set of nodes. In the IPTV is presented each one single program for one multicast group. The concrete end users (recipients) are members of one or several obtainable multicast groups. The switch between programs demands a change from one multicast group to other group. For an analyse is used the worldwide experimental network called PlanetLab. This network was created after the floatation of three American´s universities in 2002. Nowadays it takes in more than 800 nodes which are distributed over the world. The PlanetLab is used by multinational company such as the Intel or the Hewlett-Packard. It is created for the testing and the scientific scope. I make the scripts in the Linux for the formation of the interconnecting structure. The main item by the course of the unreeling is response time. I investigate it with a command called “ping”. Everything is created in the Linux because all nodes use the operation system Linux in PlanetLab. By the help of the command “ping” I take the active nodes and response times. According to the response time I make a distance vectors which are used for the finding a location in the face of the references points which were determined before. According to the similarity of these vectors is designated to what end point is put to the point.
|
guest ::
