TL;DR
The paper introduces the Quantum Shortest Path Network (QSPN), a routing discovery algorithm for Netsukuku, analyzing its properties and presenting an improved version.
Contribution
It provides a deductive analysis of QSPN's properties and introduces a second, enhanced version of the algorithm.
Findings
Analysis of QSPN's main properties
Introduction of an improved QSPN version
Potential implications for decentralized routing
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCholinesterase and Neurodegenerative Diseases · Computational Drug Discovery Methods · Enzyme Catalysis and Immobilization