Articles Weblogs Books School Short Cuts Podcasts  
P2P Memebag

Sorted network

Ordering (or sorting) a collection of datums is one of the most common operations in computer science, because it can greatly increase the utility of the collection. In fact there are many uses of a collection of datums that are impossible if the data is not sorted. In that networks are a collection of special purpose datums called nodes, sorting the nodes can greatly increase the utility of a network. This is far more difficult with nodes than other data types because the nodes themselves may well not be interested in being sorted. The Yoid project (www.aciri.org/yoid ) is an example of a sorted network, as is Freenet. Freenet is considered sortable but not searchable, while Gnutella is considered searchable but not sortable

Back to Index