Title

Multi-resource Allocation with Unknown Participants

Document Type

Conference Proceeding

Publication Date

11-30-2011

Publication Title

2nd International Conference on Networking and Computing

Volume

2011

First page number:

200

Last page number:

206

Abstract

We define the problem of multi-resource allocation, which is an extension of the dining philosophers problem. We apply this problem to systems where participants (here called clients) are unknown. We propose a solution for 2-resource allocation in static networks, then, explain how to modify our protocol to handle client dynamicity. Extend our solution to handle larger resource requests is let as a future work.

Language

english

UNLV article access

Share

COinS