Generator of IPv6 Tables

The increasing number of IPv6 prefixes in routing tables require creation of efficient lookup algorithms, which are adapted to the length of prefixes. To create and to test these algorithm,s it is necessary to have extensive tables, which currently do not exist. This thesis is about design and implementation of generator of such tables. Many series of analysis were performed before the implementation. These series were about observing properties of real and generated IPv6 sets of prefixes. The final application was implemented in the way that it corresponds as much as possible to real sets. The correctness of the generator was tested by comparing the bit values of generated and real IPv6 sets