>> Matthew Toseland wrote: >> > The main outstanding issue is how frequently we should do path folding. >> > If it is too slow, it will take too long to converge. But if it is too >> > fast, then oskar's routing algorithm won't be able to keep up. Is there >> > any way to determine an optimal time short of alchemy? >>=20 >> If I have understood things correctly, on the new network a node can have >> both darknet connections and opennet connections; in which case, when data >> comes from a darknet node, it should forward it hijacking the source as >> beeing itself, otherwise, it would use the usual algorithm. Being on the >> border of the darknet (giving the darknet a gateway to the opennet) means >> not giving away any info on darknet nodes. Being fully inside the darknet >> means you don't know anything about nodes that you've not been introduced >> to (and none else besides them should try to connect to you either!). > >Correct.
Then what is the implication of border nodes always resetting Source to themselves? I think that would bring to light that they are border-nodes between the open and the closed network. Analysis could be done because those border nodes often route requests with an HTL < maxHTL (because the request went some time through the darknet) although they pretend to be the Source; correlation attacks (border nodes tend to have a higher correlation "randomness" by previous darknet routing steps than nodes requesting the files all by themselves); network harvesting with connection analysis (an harvested opennet node has X routes to other nodes, analysis would reveal that this node has X connections to other nodes; border nodes have X to opennet and Y to darknet, a harvesting would only find the X links but network analysis would reveal X+Y links -> border node, possible entry point into the darknet: now either send Those Guys or disconnect every border node found to separate the smaller darknet from the well-known opennet)
