Quantum Shortest Path Netsukuku
| dc.creator | Pumo, Andrea Lo | |
| dc.date | 2007-05-06 | |
| dc.date.accessioned | 2026-07-07T07:59:43Z | |
| dc.date.available | 2026-07-07T07:59:43Z | |
| dc.description | This document describes the QSPN, the routing discovery algorithm used by Netsukuku. Through a deductive analysis the main proprieties of the QSPN are shown. Moreover, a second version of the algorithm, is presented. | |
| dc.identifier | https://arxiv.org/abs/0705.0817 | |
| dc.identifier | http://arxiv.org/abs/0705.0817 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/128476 | |
| dc.subject | Networking and Internet Architecture | |
| dc.title | Quantum Shortest Path Netsukuku | |
| dc.type | text |