Hi Vania, 1) For storing billions of addresses in few kilobytes we use a hierarchical topology. Read http://netsukuku.freaknet.org/doc/main_doc/topology.pdf You can see in that document's changelog that the term "fractal" is replaced by "hierarchical". As an example, suppose to use the whole addresses domain of IPv4, 32 bits = 4G nodes. We can group the nodes in 8 levels of 16 nodes each. 16^8 = 4G nodes. But each routing table will have only 16*8 = 128 destinations.
As for the chaos theory, I don't know. I joined the project in 2008 and many documents were already written. Perhaps it was used during the study of the theory that is behind the QSPN, but I am not sure. Read http://netsukuku.freaknet.org/doc/main_doc/qspn.pdf 2) The first implementation was written in C. I read somewhere that it was somewhat working. But for sure it was implementing an old version of the theory. I did never try it. The second implementation was written in Python. We used the Stackless Python interpreter. This is complete. It has some known bug and many unknown ones, for sure. I started an experimental deploy and I blogged about it. Read http://pyntk.blogspot.com I am now working on a Vala port, in order to address a couple of issues we have with the python implementation. I started the port around January this year. 3) I am developing on a Ubuntu. Every linux distro should be ok to run the daemon. My aim is to have full support for Debian. I would like to see it included in a Freedombox. --Luca _______________________________________________ Netsukuku mailing list [email protected] http://lists.dyne.org/mailman/listinfo/netsukuku
