Random Walkers, the peer-to-peer improve with chaos.

. Hacktivism

11:07:02 Random Walkers, the peer-to-peer improve with chaos.
The Achilles heel of the peer-to-peer is probably the sharp slowdown in search of data, when the network is home to more than a few tens of thousands of computers. Eliminating a priori the solution Napster (ie the central servers), a team of researchers at Princeton University in New Jersey, the University of California at Berkeley and multinationals AT &T; and Cisco have theorized another chance . According to team members instead of 'drowning' the network of posts would be better to allow a few of them to 'walk' between individual machines. The ideal number of 'walkers' (walkers) would be between sixteen and sixty-four. Also by storing the information in a random way makes the functionality of the network much more efficient, in addition to establishing an optimal number of copies based on the number of requests that the file generates. The team hopes to make the best distribution of computational power for scientific applications in the form of so-called 'distributed supercomputers'. But the same techniques could be applied also by separate networks like Gnutella for dramatically increasing the efficiency of their patterns of operation. The excess traffic generated by the search is precisely the main problem of Gnutella, as this method makes, on the other hand, the more difficult the retrieval of information less common. The research was presented at the Sixteenth ACM International Conference on Supercomputing.