System availability is an important subject in the design field of industrial system as the system structure becomes more complicated. While improving the system’s reliability, the cost is also on the upswing. The availability is increased by a redundancy system. Redundancy Allocation Problem (RAP) of a series-parallel system is traditionally resolved by experienced system designers. We propose...

Peer-to-peer architectures can be used to build a robust, fault tolerant infrastructure for important services. One example is a peer-to-peer data replication system, in which digital collections are protected from failure by being replicated at multiple peers. We argue that such community-based redundancy, in which multiple sites contribute resources to build a fault-tolerant system, is an imp...

the task of optimally assigning military ordinance to enemy targets, often termed weapon target allocation (wta) problem, has become a major focus of modern military thought where a cost effective allocation is required without degrading the required kill performance. the paper presents three main weapon allocation techniques namely uniform weapon allocation, first-in-first weapon allocation an...

This work presents a methodology to assess maintenance teams in the determination of the degree of redundancy that an active component must have in order to minimize its system life-cycle cost and in the definition of the corresponding maintenance plan schedule. The minimal required data are three average costs and one reliability function. It is useful in a system’s design phase, since in this...

In this paper, the duality of erasures and defects will be investigated by comparing the binary erasure channel (BEC) and the binary defect channel (BDC). The duality holds for channel capacities, capacity achieving schemes, minimum distances, and upper bounds on the probability of failure to retrieve the original message. Also, the binary defect and erasure channel (BDEC) will be introduced by...

We develop a bicriteria model for the resource allocation problem in PERT networks, in which the total direct costs of the project as the first objective, and the mean of project completion time as the second objective are minimized. The activity durations are assumed to be independent random variables with either exponential or Erlang distributions, in which the mean of each activity duration ...

An algorithm for register promotion is presented based on the observation that the circumstances for promoting a memory location's value to register coincide with situations where the program exhibits partial redundancy between accesses to the memory location. The recent SSAPRE algorithm for eliminating partial redundancy using a sparse SSA representation forms the foundation for the present al...

This paper treats the file redundancy issue in distributed database systems asking what is the optimal number of file copies, given the ratio r of the frequencies of query and update requests. To draw a general conclusion applicable to a wide variety of practical distributed database systems, simplified network models are constructed , and optimal number of file copies, as well as their locatio...

Recently, erasure networks have received significant attention in the literature [1–7] as they are used to model both wireless and wireline packet-switched networks. Many packetswitched data networks like wireless mesh networks [8–10], the Internet [11–13], and Peerto-peer networks [14] can be modeled as erasure networks. The reason is that each packet contains an internal error detection code,...