Differences between revisions 14 and 15
⇤ ← Revision 14 as of 2008-12-18 12:02:13 →
Size: 2844
Editor: alpt
Comment:
← Revision 15 as of 2008-12-18 12:03:19 → ⇥
Size: 3110
Editor: alpt
Comment:
Deletions are marked like this. Additions are marked like this.
Line 28: Line 28:
  entry in the routing table of a neighbouring node, injecting false information about links in the network. The attack would just create a temporary local damage, thanks to the distributed nature of the QSPN. However the optimal solution is to prevent these attacks using a cryptographic signature scheme   entry in the routing table of a neighbouring node, injecting false information about links in the network. The attack would just create a temporary local damage, thanks to the distributed nature of the QSPN. However the optimal solution is to prevent these attacks using a cryptographic signature scheme. See http://netsukuku.freaknet.org/doc/main_doc/qspn.pdf
Line 34: Line 34:
  a small load on the interested nodes   a small load on the interested nodes. See http://netsukuku.freaknet.org/doc/main_doc/ntk_rfc/Ntk_caustic_routing
Line 36: Line 36:
 * software implementation of Viphilama, an Internet tunnelling system that connects nodes which aren't physically linked  * software implementation of Viphilama, an Internet tunnelling system that connects nodes which aren't physically linked. See http://netsukuku.freaknet.org/doc/main_doc/ntk_rfc/Ntk_viphilama
Line 39: Line 39:
  nodes which are sharing their connection.   nodes which are sharing their connection. See http://netsukuku.freaknet.org/doc/main_doc/ntk_rfc/Ntk_IGS

TODO

  • accurate study, tests and enhancement of the performance of the Netsukuku addressing system:
    • the hierarchical topology of Netsukuku is dependent on the addresses associated to each node. Since the network is dynamic, the addresses can change over time, thus the topology must be updated. When the topology changes, other parts of the network must be updated too, f.e. the routing tables of the affected nodes. Therefore, an efficient minimisation of the number of topology updates is critical for the success and scalability of the Netsukuku network.

      See http://netsukuku.freaknet.org/doc/main_doc/topology.pdf

  • addressing algorithms that minimise the measurement inaccuracies:
    • the hierarchical topology helps to organise a large number of nodes, however this structure hides some information about the routes; as a consequence, the routing table known by a node is an approximation of the best absolute routing table available to it. The approximation is dependent on the particular addresses assigned to each node, therefore it is possible to develop methods that minimise it.

      See http://netsukuku.freaknet.org/doc/main_doc/topology.pdf

  • software implementation of ANDNA:
  • secure QSPN:
    • a node could easily forge an

      entry in the routing table of a neighbouring node, injecting false information about links in the network. The attack would just create a temporary local damage, thanks to the distributed nature of the QSPN. However the optimal solution is to prevent these attacks using a cryptographic signature scheme. See http://netsukuku.freaknet.org/doc/main_doc/qspn.pdf

  • improvement, test and implementation of the Caustic Routing:
  • stable implementation of the Netsukuku software

  • software implementation of Viphilama, an Internet tunnelling system that connects nodes which aren't physically linked. See http://netsukuku.freaknet.org/doc/main_doc/ntk_rfc/Ntk_viphilama

  • software implementation of a system of distributed Internet connections through Netsukuku:
  • experimental tests

  • Ultimate the incomplete RFCs: Netsukuku_RFC

  • Translate the documentation

Ntk_TODO (last edited 2009-09-18 18:23:05 by alpt)