Network Redundancy Elimination by Dynamic Buffer Allocation

Network redundancy elimination (RE) is an attractive approach to improve network performance for mobile devices. Most of the past research have explored how to eliminate redundant transfers from network links and improve network efficiency. Several of these systems operate at the application layer, while the more recent systems operate on individual packets. Those research have two common aspects. One is that they apply to fixed buffer size and each user will have the same size of buffer. The other is that they do not realize what kinds of chunks are contributing so that they should not be flushed by their simple first in first out(FIFO) buffer algorithm. In this paper, we collect real traces from over five hundreds WiFi anonymous users in enterprise. Through intensive data analysis, we find that 20 percents redundancy blocks contribute to 60 percent of redundancy of the traffic. Then we propose a new RE scheme which forecast the appearance of those contributing redundancy chunks, keep those contributing chunks in buffers and give different size of buffers to users based on the number of those contributing chunks. The simulation results show that our scheme is feasible and can achieve 20% more traffic saving than the state-of-art methods on average.