Hello, I'm reading the Netsukuku documentation
I have some comments on the QSPN.pdf paper :) 1) Is there any document where the packet structure of the TP messages is defined? I believe it would help the comprehension of the section three "tracer packet", in the Quantum Shortest Path Netsukuku Paper. First of all it is not clear if the same packet structure is shared by TP, ATP, and CTP floods. 2) Also it is not very clear how the CTP (continuos tracer packet) does not collapse. If a CTP is a TP flood which will never ends seems like having packets looping in the network forever. Is the expiring of the packets completely regualted only by the Interesting Information Rule? 3) Moreover what is the maximum size of a TP packet ?? (this answer is straightforward to the definition in the paper of the TP packet) 4) The last concern is about the use of RSA to sign the routes containted in the TP, isn't the validation of the signature a too heavy operation in terms of computational burden for a node that needs to scan many TP packets? Better crypto schemes different than RSA exist based on public key cryptography. For instance sensor networks that are oriented on low CPU consumption are adopting elliptic curves public key crypto systems. Thanks for your time :) I'm looking forward to meet the Netsukuku team at the Hackmeeting in Pisa :) Saverio Proto _______________________________________________ Netsukuku mailing list [email protected] http://lists.dyne.org/mailman/listinfo/netsukuku
