You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

Ntk_features_list 3.6KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100
  1. == Netsukuku features list ==
  2. {{{
  3. - The Netsukuku mesh network is: distributed, not hierarchic, and higly
  4. scalable. The design of Netsukuku prioritises the stability of net.
  5. For this reason, it isn't specifically suitable for mobile nodes.
  6. However if the mobile nodes are inside an area covered by static Netsukuku
  7. nodes, there aren't any problems. It is also possible to use other mesh
  8. network protocols designed for mobility in conjunction with Netsukuku (f.e.
  9. see olsrd.org), in the same way they are used in conjunction with the
  10. Internet.
  11. - Scalability: Netsukuku is specifically designed to handle an unlimited
  12. number of nodes with minimal CPU and memory resources.
  13. - The net isn't overloaded with discoveries packet
  14. - The size of the maps is fixed: about 4Kb for the int_map and 16Kb
  15. for the ext_map.
  16. - Not all the nodes sends a broadcast discovery.
  17. - There are few floods for each discovery.
  18. - When a node receives a flood it has already the routes that can be
  19. used to reach all the nodes traversed by the flood. It doesn't need
  20. to calculate anything about them.
  21. - A flood is synchronized: the same flood starts at the same time for
  22. all the nodes.
  23. - http://lab.dyne.org/Netsukuku_scalability
  24. - zeroconf: the network builds itself, without need of human intervention
  25. - ANDNA: distributed and not hierarchic DNS
  26. - When the net becomes larger, ANDNA scales more because its DB will
  27. be distributed among the nodes.
  28. - Any node can register up to 256 hostnames.
  29. - The registration is secure: it is based on asymmetric cryptography,
  30. thus it is very difficult to take hostnames which has been already
  31. registered by other nodes.
  32. - Each hostname can be a string of maximum 512 bytes.
  33. - DNS compatibility: all the network programs are already compatible
  34. with ANDNA, because NetsukukuD comes with a DNS wrapper which
  35. converts DNS queries to ANDNA requests.
  36. - All the resolved hostnames are kept, in the "resolved hostnames
  37. cache" to speed up the resolution process.
  38. The rhcache is synchronized with ANDNA, therefore its stored
  39. entries will expire exactly when the registered hostnames expire
  40. in ANDNA.
  41. - Scattered Name Service Disgregation
  42. http://lab.dyne.org/Ntk_SNSD
  43. The SNSD is the ANDNA equivalent of the SRV Record of the Internet
  44. Domain Name System, which is defined here:
  45. http://www.ietf.org/rfc/rfc2782.txt
  46. SNSD isn't the same of the "SRV Record", in fact, it has its own
  47. unique features.
  48. - Internet compatibility
  49. - internet sharing
  50. * Multi-inet-gateways.
  51. The Netsukuku nodes will now automatically use multiple
  52. inet-gateways to connect to the Internet, therefore their
  53. Internet connection will be effectively load-balanced.
  54. * Anti-loop multi-igw shield.
  55. The nodes which share their Internet connection will also
  56. automatically use the shared connection of the other nodes.
  57. Through a simple marking system, death loops are avoided.
  58. * Traffic shaping.
  59. The nodes which share their Internet connection can now
  60. shape it, in this way they'll prioritize their local
  61. outgoingtraffic and the lowdelay one (f.e. SSH).
  62. - Routes based on bandwidth and latency
  63. http://lab.dyne.org/Ntk_bandwidth_measurement
  64. - NetsukukuD:
  65. - low memory and CPU usage
  66. - it can run smoothly on a small Access Point
  67. - Support for multipath routes: to reach a destination node, the
  68. packets will use, at the same time, more than one route.
  69. - support for multi network interfaces
  70. - Multi interfaces multipath: if the node can reach a rnode trough
  71. multiple interfaces, it uses them all with a multipath route.
  72. }}}