Optimal routing policy

We investigate the problem of resource allocation in heterogeneous networks of computational resources. We provide an explicit analytical solution for a situation where the computational environment can be described by M/M/l queueing theory. We illustrate the quality of our solution by comparing results with those obtained via a simple ad hoc resource allocation in large heterogeneous networks consisting of N = 10⁴ nodes with computational resources distributed either uniformly in a given interval, or exponentially in R⁺.