Geo-routing systems and finding the shortest distance?

Question

Network routing

A system is needed to find the detailed shortest path between geo-points.
Criteria: accuracy and speed, taking into account that it will have to be calculated throughout Eurasia.
I look in the direction of pgRouting , but the speed is not yet satisfactory - 10 seconds between Moscow and Magadan. Perhaps because I haven’t looked at the possibility of optimizing the database yet.
Ideally, I would like something comparable in speed to Cloudmade routing .
So far the options seem to be:

• database optimization, transfer to the "cloud"
  
• search for another tool or service (the aforementioned Cloudmade does not suit due to the rather high intensity and specificity of requests)
  
• implementation of your own (what the hell is not joking) tool using the optimal and fast calculation algorithm (hence the question - which one)
  

Does the habra community have advice and experience in solving such problems?

Answer 1

take it to the cloud, do it according to the map-reduce scheme and divide the load between servers
i.e. you will need a lot of refinement graphs, and some sort of weighting algorithm to choose which graph to start the search from