Before revision:  We implement the policy by designing a new linear-time Pipage rounding algorithm. With an additional\texttt{  Strong-Law-type assumption, we show that the total number of file fetches under \texttt{LeadCache} remains almost surely finite .
After revision:  We design two efficient implementations of the\texttt{ Strong-Law-type assumption, we show that the total number of file fetches under \texttt{LeadCache} remains almost surely finite .