期刊文献+

一种网络冗余流量消除算法 被引量:2

An Algorithm for Redundant Traffic Elimination
在线阅读 下载PDF
导出
摘要 针对大量数据片段冗余传输造成网络带宽浪费严重的问题,提出了一种基于动态查找表的冗余流量消除(DYNATABLE)算法。该算法动态统计流量中以不同字节值开头的数据块的冗余率,在保证目标块抽样率的情况下,选取冗余率高的数据块的首字节值为标识,实时更新查找表,根据查找表中的标识从数据包中选出数据块,对已经传输过的冗余数据块进行简单编码,用编码数据替换原冗余数据片段,再对消除冗余流量的数据包进行传输。对比基于最大值选择和基于静态查找表选择等冗余流量消除算法,DYNATABLE算法能跟踪网络数据的动态变化,带来更高的字节节省,平均字节节省率提高到21.8%。 A dynamic lookup table algorithm for redundant traffic elimination,DYNATABLE in short,is proposed to avoid serious waste of network bandwidth from redundant traffic.DYNATABLE dynamically counts repeat times of data chunks begun with different byte values and uses them as redundancy rates of different byte vales.DYNATABLE selects the values of bytes with higher redundancy rate as markers,and update them in the lookup table.Then chunk selection algorithms select data chunks according to the markers in the lookup table.DYNATABLE encodes the redundant blocks in short form,and then transfers the data from which redundant blocks have been eliminated.Comparisons with the MAXP and the SAMPLEBYTE show that the DYNATABLE gets a high byte saving,and improves the average byte saving rate to 21.8%.
出处 《西安交通大学学报》 EI CAS CSCD 北大核心 2013年第4期22-27,共6页 Journal of Xi'an Jiaotong University
基金 国家科技支撑计划资助项目(2011BAH11B04) 国家高技术研究发展计划资助项目(2011AA01A102) 中国科学院战略性先导科技专项子课题(XDA06010302)
关键词 网络 冗余流量 消除 块选择算法 抽样 network redundancy traffic elimination sampling
作者简介 脱立恒(1984-),男,博士生; 倪宏(通信作者),男,教授,博士生导师。
  • 相关文献

参考文献9

  • 1GREVERS T,CHRISTNER J.Application acceleration and wan optimization fundamentals [M].Indianapolis,IN,USA: Cisco Press,2007: 170-205.
  • 2SPRING N T,WETHERALL D.A protocolindependent technique for eliminating redundant network traffic[J].ACM SIGCOMM Computer Communication Review,2000,30(4): 87-95.
  • 3ANAND A,MUTHUKRISHNAN C,AKELLA A,et al.Redundancy in network traffic: findings and implications [C]∥Proceedings of the Eleventh International Joint Conference on Measurement and Modeling of Computer Systems.New York,USA: ACM,2009: 37-48.
  • 4AGGARWAL B,AKELLA A,ANAND A,et al.EndRE: an endsystem redundancy elimination service for enterprises [C]∥Proceedings of the 7th USENIX conference on Networked Systems Design and Implementation.Berkeley,CA,USA: USENIX Association,2010: 18-28.
  • 5RABIN M O.Fingerprinting by random polynomials,technical report: TR1581 [R].Cambridge,MA,USA: Harvard University.Center for Research in Computing Technology,1981: 18-51.
  • 6敖莉,舒继武,李明强.重复数据删除技术[J].软件学报,2010,21(5):916-929. 被引量:119
  • 7HALEPOVIC E,WILLIAMSON C,GHADERI M.DYNABYTE: a dynamic sampling algorithm for redundant content detection [C]∥Proceedings of 20th International Conference on Computer Communications and Networks.Piscataway,NJ,USA: IEEE,2011: 1-8.
  • 8ANAND A,SEKAR V,AKELLA A.SmartRE: an architecture for coordinated networkwide redundancy elimination[J].ACM SIGCOMM Computer Communication Review,2009,39(4): 87-98.
  • 9BLOOM B H.Space/time tradeoffs in hash coding with allowable errors[J].Communications of the ACM,1970,13(7): 422-426.

二级参考文献42

  • 1Bhagwat D,Pollack K,Long DDE,Schwarz T,Miller EL,P-ris JF.Providing high reliability in a minimum redundancy archival storage system.In:Proc.of the 14th Int'l Symp.on Modeling,Analysis,and Simulation of Computer and Telecommunication Systems (MASCOTS 2006).Washington:IEEE Computer Society Press,2006.413-421.
  • 2Zhu B,Li K.Avoiding the disk bottleneck in the data domain deduplication file system.In:Proc.of the 6th Usenix Conf.on File and Storage Technologies (FAST 2008).Berkeley:USENIX Association,2008.269-282.
  • 3Bhagwat D,Eshghi K,Mehra P.Content-Based document routing and index partitioning for scalable similarity-based searches in a large corpus.In:Berkhin P,Caruana R,Wu XD,Gaffney S,eds.Proc.of the 13th ACM SIGKDD Int'l Conf.on Knowledge Discovery and Data Mining (KDD 2007).New York:ACM Press,2007.105-112.
  • 4You LL,Pollack KT,Long DDE.Deep store:An archival storage system architecture.In:Proc.of the 21st Int'l Conf.on Data Engineering (ICDE 2005).Washington:IEEE Computer Society Press,2005.804-815.
  • 5Quinlan S,Dorward S.Venti:A new approach to archival storage.In:Proc.of the 1st Usenix Conf.on File and Storage Technologies (FAST 2002).Berkeley:USENIX Association,2002.89-102.
  • 6Sapuntzakis CP,Chandra R,Pfaff B,Chow J,Lam MS,Rosenblum M.Optimizing the migration of virtual computers.In:Proc.of the 5th Symp.on Operating Systems Design and Implementation (OSDI 2002).New York:ACM Press,2002.377-390.
  • 7Rabin MO.Fingerprinting by random polynomials.Technical Report,CRCT TR-15-81,Harvard University,1981.
  • 8Rivest R.The MD5 message-digest algorithm.1992.http://www.python.org/doc/current/lib/module-md5.html.
  • 9U.S.National Institute of Standards and Technology (NIST).Federal Information Processing Standards (FIPS) Publication 180-1:Secure Hash Standard.1995.http://www.itl.nist.gov/fipspubs/fip180-1.htm.
  • 10U.S.National Institute of Standards and Technology (NIST).Federal Information Processing Standards (FIPS) Publication 180-2:Secure Hash Standard.2002.http://csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf.

共引文献118

同被引文献11

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部