Hey guys, First of all the disclaimer: I'm a programmer, not a P2P programmer, just a simple day2day programmer. I'm a complete ignorant about NAT traversal and all of the UDP schemes. I've always been interested in P2P but never had real time to investigate all the theory behind all the DHT and etc.
My proposal: Imagine a sphere, and a point that is the center of the sphere. The point that is the centre of the sphere will be address 0,0,0. The bootstrap server. The sphere will be the first level of clients. Every client will have an address of <level>, <x-axis>, <y-axis>. There are 8 parallels and 8 meridians. Clients on the poles link to the next sphere(level). Searches are executed counter-clock wise on a parallel and upon returning to the same client go up one meridian. Special cases are the poles that send the search one level and invert the search order. The bootstrap server decides addresses from equator to poles, first up and then down. Once all positions are filled the north pole point takes care of address assignment (still needs some thinking not sure if it works if one client has already a known client somewhere in the crowd). What has made me think about this 3D scenario is easy routing once you know the opposite node you want to send message. It also has every client connected to 4 other clients, excluding poles and server. Please insert all the rest of the needs of a P2P network and if it fits or not. Please do not be condescendant and hit me real hard with your views. Thanks Gustavo Carreno --- http://batxman.wordpress.com < If you know Red Hat you know Red Hat, If you know Slackware you know Linux > _______________________________________________ p2p-hackers mailing list [email protected] http://lists.zooko.com/mailman/listinfo/p2p-hackers
