$(b)$ $\rho=2$, $q_1=4, q_2=4, q_3=0$ (best topology (for successive transmissions), worst topology (for parallel transmissions)).
  ----------------------------------------------------------------------------------------------------------------------------------------------------------

  --------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
   ![Examples of different network topologies for $P=3$ and $K=4$ with $\rho=2$.[]{data-label="fig:f1"}](fig2c1.PNG "fig:"){width="22.00000%"}\[fig:f13\] ![Examples of different network topologies for $P=3$ and $K=4$ with $\rho=2$.[]{data-label="fig:f1"}](fig2c2.PNG "fig:"){width="22.00000%"}\[fig:f1\]
                                                                                         $(c)$ $\rho=2, q_1=3, q_2=3, q_3=2$ (worst topology (for successive transmissions), best topology (for parallel transmissions))
  --------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

In this work, we combine distributed storage at the SBSs, similar to the “femtocaching” framework [@femtocaching], with cache storage at the users, and consider coded delivery over error-free shared broadcast links [@nmital]. We consider a library of $N$ files stored across $P$ SBSs, each equipped with a limited-capacity storage space (see Fig. \[fig:f1\]). Unlike the existing literature, we consider a random connectivity model: during the delivery phase, each user connects only to a random subset of $\rho$ SBSs, where $\rho \leq P$. This may be due to physical variations in the channel, or due to resource constraints. Most importantly, the connections that form the network topology are not known in advance during the placement phase; therefore, the cache placement cannot be designed for a particular network topology. Storing the files across multiple SBSs, and allowing users to connect randomly to a subset of 