On Wednesday 06 August 2003 12:27 pm, Some Guy wrote: > > > Ambience: > > > Consider a random peice of data sitting on my > > > > node. > > > > > None of my 100 neighbors know it's there. Now > > > > imagine > > > > > if one of my neighbors, who specialises in that > > > > key's > > > > > area, gets a request for it. What are the odds > > > > it's > > > > > going to ask me? 1 percent! That's pretty poor. > > > > No, most of the data stored on your node will be > > close to your > > specialization. So there is a good chance that the > > neighbour will route > > to you, if the datum is in your specialization area. > > Please read the > > papers. > > I did. Though I haven't read the code. Yes I > understand how the system is supposed to work in > theory. Most of my store should be full of things in > my specialization, because I will have collected them > while handling requests. > > Still the stuff I personally(or close neighbors) > request will be from all over the key space. > > Consider this: for every item I have if I just picked > my first choice to route to in finding that key and > made sure he knew about it, he'd have a way better way > of knowing to ask me than if he had to guess just > based on previous requests. Maybe I got the data from > a node he doesn't know about, which died after. > > OK, I know that that kind of a one hop solution would > break security, but just consider it from a routing > point of view. > > Perhaps my idea is just part of a bigger suggestion: > Instead of letting my neighbors learn of my > specialization the hard way, why not just tell them > about it? Theoretically I could send them a summary > of my specialization, if it's not too big. This would > be especially useful for giving new Nodes something to > start with.
If your talking about one idle node sending advertisements to another idle node, why not just exchange data? Then the data could be moved to a place where it is more likely to be requested. It could work like this: If a node has been idle for a while, it looks in it's store, picks the key furthest from it's specialization and sends it to the node that it would request that data from if it were to do so. (Unless it thinks that node is busy) Then that node, can ether reject the data, or store it, and return it's least recently accessed data in return. _______________________________________________ devl mailing list [EMAIL PROTECTED] http://hawk.freenetproject.org:8080/cgi-bin/mailman/listinfo/devl
