Date Added: Mar 2012
The authors consider architecture of Data Center Networks (DCN), which adds wireless network card to each router. Existing Redundancy Elimination (RE) mechanisms reduce link loads and increase network capacity in several environments by removing strings that have appeared in earlier packets through encoding and decode them several hops downstream. This paper is the first to explore RE mechanisms in large-scale DCNs, and the first to exploit cooperative RE among servers. They describe a centralized REDaCeN (RE in DCNs) algorithm, which greedily and repeatedly selects to cache data unit with the largest caching utility among routers with remaining capacity. They show that approximation ratio of REDaCeN is high through their simulation.