期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

面向高效复杂查询的常数度P2P系统构建技术 被引量：1

A Construction Technique of Constant Degree P2P Systems towards Efficient Complex Queries
在线阅读 下载PDF
导出
摘要 常数度P2P系统成为P2P领域的关注热点,但其研究主要集中于拓扑构建与维护,复杂查询研究及其支持优化技术相对较少.P2P系统高层特性很大程度上由底层拓扑决定,常数度拓扑的特点使得经典技术构建的常数度P2P系统数据局部性不佳,从而不支持高效复杂查询.针对这一不足提出了通用的面向高效复杂查询的构建技术,通过在数据层与DHToverlay间添加嵌入变换逻辑层,将拓扑结构信息引入构建过程以改善数据局部性,并采用此技术重构FissionE.分析与实验结果表明,新构建技术在不改变底层DHT的前提下有效确保数据局部性,减少查询综合开销,提高系统应用效率. Constant degree peer-to-peer（P2P）system is turning into the P2P domain＇s promising hotspot due to constant degree digraphs having good propertis.However,it is often hard to convert a stardard constant degree digraph to a DHT schema.Thus,most researches focus on DHT＇s construction and maintenance,while leaving optimization and supporting to complex query behind.Underlying topology affects upper-layers＇ character a lot.For constant degree P2P topologies,their inherent property makes a constant degree P2P system built using classical technique be poor in the data locality,and unfit for efficient,low-cost complex queries.Aiming at this shortage,a general-purpose construction technique towards efficient complex queries is proposed,which adds an embedding transformation layer between data layer and DHT overlay.In this way,adjacent data are stored in overlay＇s adjacent peers and the data locality is improved,so that the number of peers referred in complex queries can be minimized with a limited time overhead.To validate this technology,the first constant degree P2P system based on Kautz digraph FissionE is reconstructed as a typical example,which includes re-allocating of resources,query algorithm and locality maintenance strategies.Experimental results show that this construction technique can ensure data locality,reduce query cost and lead to systems＇ efficiency without changing the underlying DHT layer.
作者 王小海 彭宇行 李东升
机构地区 国防科学技术大学并行与分布处理国防科技重点实验室
出处 《计算机研究与发展》 EI CSCD 北大核心 2011年第3期374-381,共8页 Journal of Computer Research and Development
基金 国家自然科学基金项目(60703072 60903205) 国家"九七三"重点基础研究发展计划基金项目(2005CB321801) 国家"八六三"高技术研究发展计划基金项目(2009AA01Z142) 全国优秀博士学位论文作者专项资金项目(200953) 高等学校博士学科点专项科研基金项目(20094307110008)
关键词 数据局部性 常数度拓扑 P2P 分布式散列表 复杂查询 data locality constant degree topology P2P DHT complex query
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献17

  • 1Ratnasamy S, Shenker S, Stoica I. Routing algorithms for DHTs: Some open questions [C] //Proe of IPTPS 2002. Berlin: Springer, 2002:45-52.
  • 2Li D, Lu X, Wu J. FissionE: A scalable constant degree and low congestion DHT scheme based on Kautz graphs [C] // Proc of IEEE INFOCOM 2005. Piscataway, NJ: IEEE, 2005, 1677-1688.
  • 3Guo D, Wu J, Chen H, et al. Moore: An extendable peer-to-peer network based on incomplete Kautz digraph with constant degree [C] //Proc of IEEE INFOCOM 2007. Los Alamitos, CA: IEEE Computer Society, 2007:821-829.
  • 4ZHANG YiMing LU XiCheng LI DongSheng.SKY:Efficient peer-to-peer networks based on distributed Kautz graphs[J].Science in China(Series F),2009,52(4):588-601. 被引量：4
  • 5Kaashoek F, Karger D. Koorde: A simple degree-optimal distributed hash table [C] // Proc of IPTPS 2003. Berlin: Springer, 2003:98-107.
  • 6Loguinov D, Kumar A, Rai V, et al. Graph-theoretic analysis of structured peer-to-peer systems: Routing distances and fault resilience[C]//Proc of ACM SIGCOMM 2003. New York: ACM, 2003:395-406.
  • 7Kumar A, Merugu S, Xu J, et al. Ulysses: A robust, low- diameter, low-latency peer-to-peer network [C] //Proc Of IEEE ICNP 2003. Piseataway, NJ: IEEE, 2003:258-267.
  • 8Shen H, Xu C, Chen G. Cycloid: A constant-degree and lookup-efficient P2P overlay network [C] //Proc of IEEE IPDPS 2004. Piscataway, NJ: IEEE, 2004, 1: 26a.
  • 9Gupta Abhishek, Agrawal Divyakant, Abbadi Amr El. Approximate range selection queries in peer-to-peer systems [C] //Proc of the First Biennial Conf on Innovative Data Systems Research (CIDR). 2003 [ 2009-10-14 ]. http:// citeseerx, ist. psu. edu/viewdoc/summary? doi: 10. 1. 1. 11. 9880.
  • 10张蓉,钱卫宁,周傲英.一种支持多维数据范围查询的对等计算索引框架[J].计算机研究与发展,2009,46(4):529-540. 被引量：6

二级参考文献21

  • 1LIDongsheng LUXicheng.A novel constant degree and constant congestion DHT scheme for peer-to-peer networks[J].Science in China(Series F),2005,48(4):421-436. 被引量：7
  • 2LU Xicheng,WANG Huaimin,WANG Ji.Internet-based virtual computing environment(iVCE):Concepts and architecture[J].Science in China(Series F),2006,49(6):681-701. 被引量：33
  • 3徐林昊,钱卫宁,周傲英.非结构化对等计算系统中多维范围搜索[J].软件学报,2007,18(6):1443-1455. 被引量：3
  • 4Ratnasamy S, Francis P, Handley M, et al. A scalable eontent-addressable network [C]//Proc of ACM Annual Conf of the Special Interest Group on Data Communication. New York: ACM, 2001:161-172
  • 5Bentley J L. Multidimensional binary search trees used for associative searching [J]. Communications of the ACM, 1975, 18(9): 509-517
  • 6Hinrichs K, Nievergelt J. The grid file: A data structure designed to support proximity queries on spatial objects [C] //Proc of the Int Workshop on Graphtheoretic Concepts in Computer Science. New York: ACM, 1983:100-113
  • 7Tang Chunqiang, Xu Zhichen, Dwarkadas S. Peer-to-peer information retrieval using self-organizing semantic overlay networks [C] //Proc of the ACM SIGCOMM 2003, New York: ACM, 2003:175-186
  • 8Andrzejak A, Xu Zhichen. Scalable, efficient range queries for grid information services [C] //Proc of IEEE P2P. Piscataway, NJ : IEEE, 2002 : 33-40
  • 9Sahin O D, Gupta A, Agrawal D, et al. A peer-to-peer framework for caching range queries [C] //Proc of ICDE. Piscataway, NJ: IEEE, 2004:165-176
  • 10Shu Yanfeng, Tan Klan-Lee, Zhou Aoying. Adapting the content native space for load balanced indexing [G] //LNCS 3367 : Proc of DBISP2P. Berlin:Springer, 2004 : 122-135

共引文献8

同被引文献17

  • 1Swiatek P,Juszczyszyn K,Brzostowski K,et al.Supporting content,context and user awareness in future internet applications[M]//The Future Internet.Springer Berlin Heidelberg,2012:154-165.
  • 2Leonhardt U.Supporting location-awareness in open distributed systems[D].Imperial College,1998.
  • 3Goferman S,Zelnik-Manor L,Tal A.Context-aware saliency detection[J].Pattern Analysis and Machine Intelligence,IEEE Transactions on,2012,34(10):1915-1926.
  • 4Liberal F,Fajardo J O,Koumaras H.Qo E and*-awareness in the Future Internet[C]//Future Internet Assembly,2009:293-302.
  • 5A simple network management protocol(SNMP)[M].Network Information Center,SRI International,1989.
  • 6Perrey R,Lycett M.Service-oriented architecture[C]//Applications and the Internet Workshops,2003.Proceedings.2003 Symposium on.IEEE,2003:116-119.
  • 7Stoica I,Morris R,Karger D,et al.Chord:A scalable peer-to-peer lookup service for internet applications[J].ACM SIGCOMM Computer Communication Review.ACM,2001,31(4):149-160.
  • 8Ratnasamy S,Francis P,Handley M,et al.A scalable content-addressable,network[C]//Proceedings ofthe ACM SIGCOMM Symposiumon Communication,Architecture,and Protocols,ACM SIGCOMM,2001.
  • 9Rowstron A,Druschel P.Pastry:Scalable,decentralized object location,and routing for large-scale peer-to-peer systems[C]//Middleware2001.Springer Berlin Heidelberg,2001:329-350.
  • 10Pitoura T,Ntarmos N,Triantafillou P.Saturn:range queries,load balancing and fault tolerance in DHT data systems[J].Knowledge and Data Engineering,IEEE Transactions on,2012,24(7):1313-1327.

引证文献1

计算机研究与发展
2011年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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