A Fault-Tolerant Algorithm For Distributed Resource Allocation
نویسندگان
چکیده
منابع مشابه
Constrained Fault-Tolerant Resource Allocation
We follow [18,25] and give a series of improved results for the Constrained Fault-Tolerant Resource Allocation (FTRA) problem. In FTRA, we are given a set of sites containing facilities as resources, and a set of clients consuming these resources. Specifically, each site i is allowed to open at most Ri facilities with cost fi for each opened facility. Each client j requires an allocation of rj ...
متن کاملUnconstrained and Constrained Fault-Tolerant Resource Allocation
First, we study the Unconstrained Fault-Tolerant Resource Allocation (UFTRA) problem (a.k.a. FTFA problem in [19]). In the problem, we are given a set of sites equipped with an unconstrained number of facilities as resources, and a set of clients with setR as corresponding connection requirements, where every facility belonging to the same site has an identical opening (operating) cost and ever...
متن کاملA Fault Tolerant Coloured Petri Net Resource Allocation
In this paper we introduce the architecture of an allocation and management system capable to deal with the complexity of Flexible Manufacturing Systems (FMS). We show how to obtain the model of an FMS based on Coloured Petri Nets (CPN). This model is independent of a speciic production trajectory (route), based on CPN. The introduction of fault tolerance in the model of such allocation and man...
متن کاملDistributed Dynamic Fault-Tolerant Channel Allocation for Mobile Computing
E cient allocation of communication channels is critical for the performance of wireless mobile computing systems. The centralized channel allocation algorithms proposed in literature are neither robust, nor scalable. Distributed channel allocation schemes proposed in the past are complicated and require active participation of the mobile nodes. These algorithms are unable to dynamically adjust...
متن کاملDistributed Fault-Tolerant Channel Allocation for Mobile Cellular Networks
Distributed channel allocation algorithms have received considerable attention due to their high reliability and scalability. However, in these algorithms, a borrower needs to consult with its interference neighbors in order to borrow a channel. Thus, a borrower fails to borrow channels when it cannot communicate with anyone of its interference neighbors. In real-life networks, under heavy traf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Latin America Transactions
سال: 2017
ISSN: 1548-0992
DOI: 10.1109/tla.2017.8070421