Netsukuku is a mesh network, sort of like P2P, that generates and sustains itself autonomously. It is designed to handle an unlimited number of nodes with minimal CPU and memory resources. It can be used to build a worldwide network, separated from the Internet, without the support of any servers, ISPs or authority controls. A peer-to-peer (or P2P) computer network is a network that relies on the computing power and bandwidth of the participants in the network rather than concentrating it in a relatively few servers. ...

Netsukuku replaces the level 3 of the model iso/osi with another routing protocol.

This is a physical network, and not built upon any other existing net. There must be computers linked physically to each other, then Netsukuku will build the routes.

Sounds like the future of P2P, but users of the protocol are required.

QSPN

The QSPN is the routing algorithm used by Netsukuku to find the best routes in the network. It is optimised to run on a real network, i.e. you cannot use it on a map without simulating the nodes which send each other the QSPN packets.

ANDNA

ANDNA is the distributed, non hierarchical and decentralised system of hostname management in Netsukuku. It substitutes the DNS. The ANDNA database is scattered inside all the Netsukuku and the worst of cases every node will have to use about 355 Kb of memory. ANDNA is the distributed, non hierarchical and decentralised system of hostname management in Netsukuku. ...

ANDNA works basically in the following way: in order to resolve a hostname we just have to calculate its hash. The hash is nothing more than a number and we consider this number as an ip and the node related to that ip is called andna_hash_node. Practically the hash_node will keep a small database, which associates all the hostnames related to it with the ip of the node, which has registered the same hostnames.

See also

• Netsukuku main site
• Netsukuku documentation