The persistent‐access‐caching algorithm

Caching is widely recognized as an effective mechanism for improving the performance of the World Wide Web. One of the key components in engineering the Web caching systems is designing document placement/replacement algorithms for updating the collection of cached documents. The main design objectives of such a policy are the high cache hit ratio, ease of implementation, low complexity and adaptability to the fluctuations in access patterns. These objectives are essentially satisfied by the widely used heuristic called the least‐recently‐used (LRU) cache replacement rule. However, in the context of the independent reference model, the LRU policy can significantly underperform the optimal least‐frequently‐used (LFU) algorithm that, on the other hand, has higher implementation complexity and lower adaptability to changes in access frequencies. To alleviate this problem, we introduce a new LRU‐based rule, termed the persistent‐access‐caching (PAC), which essentially preserves all of the desirable attributes of the LRU scheme. For this new heuristic, under the independent reference model and generalized Zipf's law request probabilities, we prove that, for large cache sizes, its performance is arbitrarily close to the optimal LFU algorithm. Furthermore, this near‐optimality of the PAC algorithm is achieved at the expense of a negligible additional complexity for large cache sizes when compared to the ordinary LRU policy, since the PAC algorithm makes the replacement decisions based on the references collected during the preceding interval of fixed length. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2008     

On the use of phase‐type distributions for inventory management with supply disruptions

Maintaining the continuity of operations becomes increasingly important for systems that are subject to disruptions due to various reasons. In this paper, we study an inventory system operating under a (q, r) policy, where the supply can become inaccessible for random durations. The availability of the supply is modeled by assuming a single supplier that goes through ON and OFF periods of stochastic duration, both of which are modeled by phase‐type distributions (PTD). We provide two alternative representations of the state transition probabilities of the system, one with integral and the other employing Kolmogorov differential equations. We then use an efficient formulation for the analytical model that gives the optimal policy parameters and the long‐run average cost. An extensive numerical study is conducted, which shows that OFF time characteristics have a bigger impact on optimal policy parameters. The ON time characteristics are also important for critical goods if disasters can happen. Copyright © 2011 John Wiley & Sons, Ltd.     

On the boundedness of some potential‐type operators with oscillating kernels

We consider a class of multidimensional potential‐type operators with kernels that have singularities at the origin and on the unit sphere and that are oscillating at infinity. We describe some convex sets in the (1/p, 1/q)‐plane for which these operators are bounded from L_p into L_q and indicate domains where they are not bounded. We also reveal some effects which show that oscillation and singularities of the kernels may strongly influence on the picture of boundedness of the operators under consideration. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)