What is meant by proximity Routing ? How is it different from Proximity Neighbour Selection?
Can you please explain it with a definition or an example..
One is only the selection of the neighbours and the other is routing - obvious :) - ok some more details based on an example with a Distributed Hash Table (DHT):
In a DHT you need to establish connections with your neighbours. Usually this is done random, however with Proximity Neighbour Selection, you will take the location of the other Neighbours into account. This could be done by measuring the latency between them or similar. Additionally to establishing the connection only with your neighbours you also connect to one or two neighbours which are further away. This way you will create a Small-World network. Proximate / local neighbours could be for instance:
After you have your neighbours you can start proximity routing...
Performing Proximity Neighbour Selection initially isn't necessary, but makes life easier. In a DHT proximity routing is, when you don't forward the request to the possibly best node (you know of - that's why establishing the connections first) but instead consider two things:
This way, you might not always get optimal solutions in terms of hops, but higher throughput since you have a higher bandwidth between proximate neighbours. A very good example for proximate routing is Microsoft`s Pastry