This paper explores algorithms to optimize networked caching, where requests for files can be handled by a local cache instead of a remote server. Caches work collaboratively to prevent redundant caching, and each new batch of file requests is used to update the entire network. Data is cached in an integral manner, meaning that only discrete files or chunks can be stored, not fractions of them. Bipartite networks are studied, though the proposed model supports arbitrary network topologies. The approach is based upon an Online Mirror Descent (OMD) policy, which has been shown to have sublinear regret in single cache scenarios.