期刊文献+

一种基于位向量的位置索引压缩方法

Novel location-index compression mechanism based on bit vector
在线阅读 下载PDF
导出
摘要 为了缓解大规模分布式系统中共享资源位置索引信息带来的存储压力,提出一种基于位向量的信息压缩方法。该方法建立在区/站/节点三级分层和区间对等的混合覆盖网结构上,通过在两级代理节点的有序子节点集和一定位数的位向量间建立映射关系,进而把冗余资源的位置索引信息汇聚到一条记录,逆向的位向量查询则可获取副本的分布信息。实验表明,该压缩方法达到了较高的记录压缩比,同时对提高副本定位效率起到了一定的作用。 To reduce the stress brought by shared resource in large-scale distributed system,tlis paper put forward a kind of novel location-index compression mechanism based on bit vector.It established on hybrid overlay network that was composed with three levels of district/site/node and peer-to-peer district level.After mapping sub nodes of district and site level agent nodes to corresponding bit vector,the location-index of many same replicas could be compressed to one record by bottom-up location-index publish and aggregating.Meanwhile,replicas in system could be located by query on corresponding bit vector.Application and experimental results indicate that this method can achieve high record compression ratio and improve the replica location efficiency.
出处 《计算机应用研究》 CSCD 北大核心 2011年第5期1761-1763,共3页 Application Research of Computers
基金 四川省应用基础研究资助项目(2008JY0070-2) 西南民族大学中央高校基本科研业务费专项资助项目(10NZYZJ04)
关键词 位置索引压缩 位向量 副本定位 索引汇聚 记录压缩比 location-index compression bit vector replica location index aggregating record compression ratio
  • 相关文献

参考文献7

  • 1CHERVENAK A L, SCHULER R, RIPEANU M, et al. The globus replica location service: design and experience[J]. IEEE Trans on Parallel and Distributed Systems, 2009, 20 (9) : 1260-1272.
  • 2CHERVENAK A L, CAI M. Applying peer-to-peer techniques to grid replica location services[J]. Journal of Grid Computing, 2006, 4 (1): 49-69.
  • 3IAMNITCHI A, FOSTER I, NURMI D C. A peer-to-peer approach to resource location in grid environments [ C ]//Proc of the 11th Symposium on High Performance Distributed Computing. Norwall, MA:Kluwer Academic,2002:413-419.
  • 4蒋海,李军,李忠诚.混合内容分发网络及其性能分析模型[J].计算机学报,2009,32(3):473-482. 被引量:22
  • 5陈建英,刘心松.数字有机体数据库系统搜索机制[J].计算机工程,2008,34(4):45-47. 被引量:2
  • 6LI Zhi, MOHAPAIRA P. The impact of topology on overlay muting service [ C ]//Proc of the 23rd Annual Joint Conference of IEEE Computer and Communications Societies. Piscataway : IEEE, 2004 : 408-418.
  • 7RATNASAMY S, STOICA I, SHENKER S. Routing algorithms for DHTs: some open questions[J]. Computer Science, 2002, 2429 (2002) : 45-52.

二级参考文献33

  • 1Pallis G, Vakali A. Insight and perspectives for content delivery networks. Communications of the ACM, 2006, 49 (1) : 101-106.
  • 2Li Jin. On peer-to-peer (P2P) content delivery. Peer-to-Peer Networking and Applications, 2008, 1(1) : 45-63.
  • 3Gadde S, Chase J, Rabinovich M. Web caching and content distribution: A view from the interior. Computer Communications, 2001, 24(2).. 222-231.
  • 4Tim Wauters, Jan Coppens et al. Replica placement in ring based content delivery networks. Computer Communications, 2006, 29(16).. 3313-3326.
  • 5Shaikh A, Tewari R et al. On the effectiveness of DNS-based server selection//Proceedings of the IEEE INFOCOMM. Anchorage, AK, USA, 2001:1801-1810.
  • 6Fei Zong-Ming, Yang Meng-Kun. A segment-based finegrained peer sharing technique for delivering large media files in content distributed networks. IEEE Transactions on Multimedia, 2006, 8(4): 824-829.
  • 7Cahill Adrian J, Sreenan Cormae J. An efficient CDN placement algorithm for high-quality TV content//Proceedings of the 9th IASTED International Conference on Internet and Multimedia Systems and Applications (EurolMSA). Switzerland, 2005:364-369.
  • 8Day M, Cain B, Tomlinson Get al. A model for content internetworking (CDI). IETF RFC3466, 2003.
  • 9Stephanos Androutsellis-Theotokis, Diomidis Spinellis. A survey of peer-to-peer content distribution technologies. ACM Computing Surveys (CSUR), 2004, 36(4): 335-371.
  • 10Pourebrahimi B, Bertels K, Vassiliadis S. A survey of peer to-peer networks//Proceedings of the 16th Annual Workshop on Circuits, Systems and Signal Processing. Veldhoven, Netherlands, 2005.

共引文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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