Patent ID: 7756631
Filing Date: 2010-07-13
Classification: G01C

Abstract:
1. A method for computing an absolutely optimal routing or a quasi-optimal routing for a first plurality of resources m, m>1, to be routed to a second plurality of resource destinations n, n>1, depending on a count of said first plurality of resources m and said second plurality of resource destinations n, the method comprising: using a first algorithm for computing said absolutely optimal routing for a first count of said first plurality of resources m>1 and said second plurality of resource destinations n>1; using a second algorithm for computing said quasi-optimal routing for a second count of said first plurality of resources m and said second plurality of resource destinations n, where said second count is more numerous than said first count; and using a third algorithm for computing said quasi-optimal routing for a third count of said first plurality of resources m and said second plurality of resource destinations n, where said third count is more numerous than said second count and at least twice as numerous as said first count.