A Cache Protocol For Data Center Network With Fat-tree Topology

In today’s data centers, it is very important to leverage the network bandwidth effciently. Redundancy elimination(RE) is a very effective mechanism to improve the network bandwidth utilization ratio. RE is a method to remove duplicate content of a packet thus reducing the traffc between switches. In this paper, we propose an effcient cache protocol to resolve this problem. In our protocol each packet is identified by an exclusive 128-bit integer id computed by MD5 algorithm. We then implement RE by caching hot packets in the switches of a data center. The switches check for local cache and remote caches to see whether the packet is cached somewhere along the routing path whenever a packet comes. We leverage Bloom Filter to share local cache information between different switches and the cache information is periodically updated. We also use another Bloom Filter bit array in each switch to reduce false positive ratio.We build a FatTree data center with k=16 to simulate the cache protocol. The simulation results show that our proposed protocol is very effcient in reducing the redundant traffc.