Stability analysis of network-based cooperative resource allocation strategies

Resource allocation involves deciding how to divide a resource of limited availability among multiple demands in a way that optimizes current objectives. In this brief paper we focus on one type of distributed resource allocation problem where via an imperfect communication network multiple processors can share the load presented by multiple task types. We introduce asynchronous “cooperative” resource allocation strategies, and show that they lead to a bounded cumulative demand.