Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

RMI-DRE: a redundancy-maximizing identification scheme for data redundancy elimination

This is a preview of subscription content, log in to check access.

References

  1. 1

    Shi Y, Qiu X S, Guo S Y. Genetic algorithm-based redundancy optimization method for smart grid communication network. China Commun, 2015, 12: 73–84

  2. 2

    Wang X, Qi Y X, Wang K, et al. Towards efficient security policy lookup on many-core network processing platforms. China Commun, 2015, 12: 146–160

  3. 3

    Halepovic E, Williamson C, Ghaderi M. Low-overhead dynamic sampling for eedundant traffic elimination. J Commun, 2012, 7: 28–38

  4. 4

    Anand A, Muthukrishnan C, Akella A, et al. Redundancy in Network Traffic: Findings and Implications. In: Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems, New York, 2009. 37–48

Download references

Author information

Correspondence to Xiaolong Yang.

Additional information

The authors declare that they have no conflict of interest.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Zhang, N., Yang, X., Zhang, M. et al. RMI-DRE: a redundancy-maximizing identification scheme for data redundancy elimination. Sci. China Inf. Sci. 59, 089301 (2016). https://doi.org/10.1007/s11432-016-5523-y

Download citation

Keywords

  • Storage Overhead
  • Chunk Size
  • Extended Part
  • Table Cache
  • Transmission Interval Time