Abstract
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 = 104 nodes with computational resources distributed either uniformly in a given interval, or exponentially in R+.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
