|
|
Optimization Algorithms Inspired by Nature
Babjarčiková, Lenka ; Zbořil, František (referee) ; Zbořil, František (advisor)
This thesis deals with four optimization algorithms inspired by nature. It describes ant colony optimization algorithm, marriage in honeybees optimization algorithm, grey wolf optimization algorithm and simulated annealing algorithm. The main part of this thesis is the application of these algorithms for solving three optimization problems. One of the problems is travelling salesman problem, which is solved by ant colony optimization, next problem is searching for extreme of function solved by grey wolf optimization and simulated annealing algorithms and the last is boolean satisfiability problem solved by marriage in honeybees optimization algorithm. Thesis contains experiments with these algorithms and reviews gained results.
|
|
|
Creation of new laboratory exercises explaining the principles of communication protocols
Babjarčiková, Lenka ; Jeřábek, Jan (referee) ; Langhammer, Lukáš (advisor)
The aim of this master thesis is to create two laboratory exercises in ns-3 network simulator for chosen communication protocols. The chosen protocols are BGP and ICMPv6. The first part of this thesis contains teoretical knowledge used in order to design laboratory exercise. It contains descriptions of funcionality of both protocols and messages they use. This chapter also includes brief description of three options which were considered for implementation of BGP protocol into ns-3 enviroment. The second chapter consists of actual laboratory exercises which were created as a purpose of this thesis. Exercise for BGP protocol deals with creating neighborhoods between routers at autonomous system level, analyzing the way routers communicate within their neighborhoods and how protocol reacts when the connection between two neighbor routers fails. Exercise created for ICMPv6 protocol is focused on its messages and their usage within multiple protocol funcionalities, such as address configuration, link address resolution and error detection.
|
|
|
Creation of new laboratory exercises explaining the principles of communication protocols
Babjarčiková, Lenka ; Jeřábek, Jan (referee) ; Langhammer, Lukáš (advisor)
The aim of this master thesis is to create two laboratory exercises in ns-3 network simulator for chosen communication protocols. The chosen protocols are BGP and ICMPv6. The first part of this thesis contains teoretical knowledge used in order to design laboratory exercise. It contains descriptions of funcionality of both protocols and messages they use. This chapter also includes brief description of three options which were considered for implementation of BGP protocol into ns-3 enviroment. The second chapter consists of actual laboratory exercises which were created as a purpose of this thesis. Exercise for BGP protocol deals with creating neighborhoods between routers at autonomous system level, analyzing the way routers communicate within their neighborhoods and how protocol reacts when the connection between two neighbor routers fails. Exercise created for ICMPv6 protocol is focused on its messages and their usage within multiple protocol funcionalities, such as address configuration, link address resolution and error detection.
|
|
|
Optimization Algorithms Inspired by Nature
Babjarčiková, Lenka ; Zbořil, František (referee) ; Zbořil, František (advisor)
This thesis deals with four optimization algorithms inspired by nature. It describes ant colony optimization algorithm, marriage in honeybees optimization algorithm, grey wolf optimization algorithm and simulated annealing algorithm. The main part of this thesis is the application of these algorithms for solving three optimization problems. One of the problems is travelling salesman problem, which is solved by ant colony optimization, next problem is searching for extreme of function solved by grey wolf optimization and simulated annealing algorithms and the last is boolean satisfiability problem solved by marriage in honeybees optimization algorithm. Thesis contains experiments with these algorithms and reviews gained results.
|
guest ::
