| 1 |
Anand A , Muthukrishnan A , Ramjee A R . Redundancy in network traffic: findings and implications. Proceedings of ACM SIGMETRICS, Seattle,WA,USA, 2009:37～48
|
| 2 |
Squid web proxy cache.
|
| 3 |
PeerApp:P2P and media caching.
|
| 4 |
Ziv J , Lempel A . A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 1977,23(3):337～343
|
| 5 |
Gupta A , Akella A , Seshan S , et al. Understanding and Exploiting Network Traffic Redundancy. Technical Report #1592, University of Wisconsin, 2007
|
| 6 |
Halepovic E , Williamson C , Ghaderi M . Low-overhead dynamic samplingforredundanttrafficelimination. JournalofCommunications, 2012,7(1):28～38
|
| 7 |
Aronovich L , Asher R , Bachmat E , et al. The design of a similarity based reduplication system. Proceedings of the Israeli Experimental Systems Conference, Israel, 2009:1～14
|
| 8 |
Spring N , Wetherall D . A protocol-independent technique for eliminating redundant network traffic. Proceedings of ACM SIGCOMM, Stockholm, Sweden, 2008:87～95
|
| 9 |
Bjorner N , Blass A , Gurevich Y . Content-Dependent Chunking for Differential Compression, the Local Maximum Approac. Technical Report 109,Microsoft Research, 2007
|
| 10 |
Halepovic E , Williamson C , Ghaderi M . Enhancing redundant network traffic elimination. Computer Networks, 2012,56(2):795～809
|
| 11 |
陈曙辉 ． 基于内容分析的高速网络协议识别技术研究. 国防科学技术大学博士学位论文， 2007
|
| 12 |
Rabin M O . Fingerprinting by Random Polynomials. Technical Report TR-15-81, Department of Computer Science,Harvard University, 1981
|
| 13 |
Rivest R . The MD5 Message-Digest Algorithm, Networking Working Group Requests for Comment. MIT Laboratory for Computer Science and RSA Data Security, Inc, RFC-1321, 1992
|
| 14 |
National Institute of Standards and Technology. Specications for Secure Hash Standard, 1995
|
