To optimize the multimedia proxy server effectively, this paper proposes a gain-based cache replacement policy by using the multimedia proxy server gain model. The performance of the proposed gain-based policy is evaluated by simulation experiments.

In the literature on replacement/maintenance policies for systems of stochastically failing machines, it is generally assumed that the failure time parameters are known and the objective is to find a replacement policy that minimizes expected cost per unit of time. In practice, however, the variability of costs can be an important consideration. In addition, most managers would want to adapt to...

Condition-based maintenance is rapidly gaining favor as a way to prevent the failures of capital-intensive assets and to maintain them in good operating condition with minimum cost. A valuable and increasingly prevalent way to incorporate condition information into risk estimation is by the proportional hazards model (PHM), which explicitly includes both the age and the condition information in...

In this paper, we study N-policy for a finite population Bernoulli feedback queueing model for machine repair problem with degraded failure. The running times of the machines between breakdowns have an exponential distribution. The repair times of the machines are independent and identically distributed random variables. If at any time a machine fails, it is sent to the repairman for repairing,...

Caching is a key technique in mobile computing environment for improving the data retrieval performance. Due to cache size limitations, cache replacement algorithms are used to find a suitable subset of items for eviction from the cache. It has been observed that cached items in a client are related to each other and therefore replacement of a data item which is highly associated may lead to se...

Data caching in mobile clients is an important technique to enhance data availability and improve data access time. Due to cache size limitations, cache replacement policies are used to find a suitable subset of items for eviction from the cache. In this paper, the authors study the issues of cache replacement for location-dependent data under a geometric location model and propose a new cache ...

This paper presents the effects of a free-repair warranty on the periodic replacement policy in discrete time process. Consider a repairable product that should be operating at the time over an indefinitely long operation cycle n (     , 2 , 1 n ); under the discrete-time periodic replacement policy, a product is preventively replaced at pre-specified operation cycles    , 3 , 2 , N N N ...

With the ever-growing performance gap between memory systems and disks, and rapidly improving CPU performance, virtual memory (VM) management becomes increasingly important for overall system performance. However, one of its critical components, the page replacement policy, is still dominated by CLOCK, a replacement policy developed almost 40 years ago. While pure LRU has an unaffordable cost i...

This paper describes the design and use of a synthetic Web proxy workload generator called ProWGen to investigate the sensitivity of Web proxy cache replacement policies to five selected Web workload characteristics. Three representative cache replacement policies are considered in the simulation study: a recency-based policy called Least-Recently-Used (LRU), a frequency-based policy called Lea...

Replacement policies for general caching applications and Web caching in particular have been discussed extensively in the literature. Many ad-hoc policies have been proposed that attempt to take adavantage of the retrieval latency of documents, their size, the popularity of references and temporal locality of requested documents. However, the problem of finding optimal replacement policies und...