|
|
Web application for getting location of IP nodes
Modrák, Zdeněk ; Kubánková, Anna (referee) ; Komosný, Dan (advisor)
Thesis deal with geolocation in internet network. There are described possibilities of geolocation and thesis is mainly focused on passive geolocation methods. Under passive geolocation belongs location databases which there are described as in theoretical way as used in practical part of thesis. In practical part there is created complex system for geolocation in internet environment which used paid and free geolocation databases. Another used database is WHOIS. Data from paid databases is processed and accuracy of databases is evaluated.
|
|
|
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.
|
|
|
Location estimation of Internet nodes
Němeček, Ladislav ; Balej, Jiří (referee) ; Komosný, Dan (advisor)
This paper deals with methods of stations’ IP geolocation. It’s describes the methods of passive and active geolocation and it’s more focused on active searching methods, which usees measuring the latency in network. The factors causing delays in data transfer are discussed first, followed by discussion of the issue of measuring these delays. After that a brief description of PlanetLab experimental network, which nodes were used for delay measurment. Main topic is practical implementation of method Constraint-based Geolocation in Java programming language. Last but not least the measurement results of CBG algorithm are tested.
|
|
| |
|
|
Registration database for IP nodes
Smrčka, Lukáš ; Vlček, Lukáš (referee) ; Komosný, Dan (advisor)
This thesis is focused on finding the physical location of stations by the passive geolocation techniques, particularly using the registration database of IP addresses. The first two part are focused on a theoretical analysis of this problem, the next two parts of this thesis deal with the solution of this problem and discussion of the results.
|
|
|
Monitoring of communication properties in Internet
Iľko, Pavol ; Červenka, Vladimír (referee) ; Komosný, Dan (advisor)
This thesis deals with measuring transmission parameters of the Internet network, in particular latency of ping, SSH protocol and bandwidth. The thesis is divided into a theoretical and a practical part. Theoretical part describes PlanetLab network, its brief history and contemporary projects. At the same time, tools for data mining from web pages are described. These information obtained from the theoretical part are used for creating PlanetLab nodes list and for programming applications which measure the network transmission parameters. Applications, list of nodes and obtained data are attached on DVD disc.
|
|
|
Asterisk VoIP private branch exchange and its distributions
Melichar, Ondřej ; Komosný, Dan (referee) ; Papež, Nikola (advisor)
This master’s thesis delves into the possibilities of the open-source Private Branch Exchange Asterisk, elaborates on its features and compares it with several other distros. The term SIP stack is explained here with the mention of two of its representatives. Further in the thesis, the security risks of the VoIP technology are explained, and specific attacks are described and then realized. As a part of the testing process, the possibilities of a custom module and its following implementation are explored, as well as the portability between the individual distros and its proper functioning.
|
|
|
TTP protocol for managing hierarchy trees of RTCP feedback channel
Müller, Jakub ; Komosný, Dan (referee) ; Burget, Radim (advisor)
TTP protocol for managing hierarchy trees of the RTCP feedback channel represents the mechanism for transferring the big amount of data from end users via the “narrow” feedback channel. We are not speaking about thousands of users but about millions of users, which are using services like IPTV. The method of a data summarization is used for this purpose in selected network nodes. The summarized message is transferred and summarized again in higher levels of the hierarchical tree. Both methods allow reducing the amount of data and help to increase information content transferred via the feedback channel. Finding of the correct end user position in a network is also very important aspect. The user must be able to find the closest summarization node with this information and starts sending out the messages to this node for processing. There are several methods for constructing and managing the asynchronous feedback channel that are introduced in this work.
|
|
|
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.
|
|
|
Kernel module definition and networking server configuration for Linux operating system
Pecho, Ladislav ; Matocha, Tomáš (referee) ; Komosný, Dan (advisor)
The goal of my work is to create two computer labs lessons. The first one is a guide in writing a simple Linux kernel module, and in making a file inside the procfs filesystem. The content of the file can be decided as late as at the moment of reading. The second lesson describes the configuration of a server which allows a computer to boot over network. DHCP server is used with a TFTP server for file transfers which are both handled by the dnsmasq program. The example configuration will display a menu on the client station. It is possible to select to boot either a Linux kernel, floppy disk image, Linux network installer, diagnostic tool Memtest, or a text mode game Grub Invaders. The chosen bootloader is pxelinux from the syslinux project.
|
guest ::
