期刊文献+

虚拟计算环境中的DHT拓扑构建技术研究综述

Survey of DHT topology construction techniques in virtual computing environments
原文传递
导出
摘要 基于互联网的虚拟计算环境(iVCE)是一种新型网络计算平台.互联网资源的成长性、自治性和多样性等自然特性给iVCE中的资源共享带来巨大的挑战.DHT覆盖网(简称DHT)具有可扩展、延迟低、可靠性高等优点,是iVCE实现资源有效共享的重要途径之一.拓扑构建是DHT的基础性关键技术,实现了DHT的动态维护与消息路由等基本功能.本文首先概述传统DHT的拓扑构建技术,主要包括各种典型DHT的动态维护机制与消息路由算法、支持复杂查询的DHT索引构建技术,以及支持管理域匹配的DHT分组构建技术等;进而针对互联网资源的特点,综述在iVCE中DHT拓扑构建技术的最新研究进展.本文在最后对DHT拓扑构建技术的未来发展方向进行探讨. The Internet-based virtual computing environment(iVCE) is a novel network computing platform.The characteristics of growth,autonomy,and diversity of Internet resources present great challenges to resource sharing in iVCE.The DHT overlay(DHT for short) technique has various advantages such as high scalability,low latency,and desirable availability,and is thus an important approach to realizing effcient resource sharing.Topology construction is a key technique for structured overlays that realizes basic overlay functions including dynamic maintenance and message routing.In this paper,we first introduce the traditional techniques of DHT topology construction,focusing mainly on dynamic maintenance and message routing of typical DHTs,DHT indexing techniques for complex queries,and DHT grouping techniques for matching domain structures.We then present recent advances in DHT topology construction techniques in iVCE taking advantage of the characteristics of Internet resources.Finally,we discuss the future of DHT topology construction techniques.
出处 《中国科学:信息科学》 CSCD 2011年第9期1037-1053,共17页 Scientia Sinica(Informationis)
基金 国家重点基础研究发展计划(批准号:2011CB302601) 国家自然科学基金(批准号:60903205) 博士点基金(批准号:200943-07110008) 全国优秀博士学位论文作者专项资金(批准号:200953)资助项目
关键词 虚拟计算环境 DHT覆盖网 拓扑构建 分布式索引 灵活路由 virtual computing environments; DHT overlays; topology construction; distributed indexing; flexible routing;
  • 相关文献

参考文献66

  • 1张一鸣,李东升,卢锡城.虚拟计算环境中的可扩展分布式资源信息服务[J].软件学报,2007,18(8):1933-1942. 被引量:10
  • 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
  • 3Zhang Y M.Tag-Based path diversity in structured peer-to-peer networks. . 2010 被引量:1
  • 4Xu J,Kumar A,Yu X X.On the fundamental tradeoffs between routing table size and network diameter in peer-to-peernetworks. IEEE Journal of Selected Areas in Communications . 2004 被引量:1
  • 5Zhang Y M,Liu L,Li D S,et al.Distributed line graphs:a universal framework for building DHTs based on arbitraryconstant-degree graphs. IEEE ICDCS . 2008 被引量:1
  • 6Oppenheimer D,Albrecht J,Patterson D,et al.Distributed resource discovery on planetlab with SWORD. Proceedings of the1st Workshop on Real Large Distributed Systems (WORLDS’’04) . 2004 被引量:1
  • 7Jagadish H V,Ooi B C,Vu Q H.Baton:a balanced tree structure for peer-to-peer networks. Proceedings of VLDB2005 . 2005 被引量:1
  • 8Jagadish H V,Ooi B C,Tan K L,et al.Speeding up search in peer-to-peer networks with a multi-way tree structure. Proceedings of SIGMOD2006 . 2006 被引量:1
  • 9Albrecht K,Arnold R,Gahwiler M,et al.Aggregating information in peer-to-peer systems for improved join and leave. Proceedings of P2P Computing2004 . 2004 被引量:1
  • 10Yalagandula P,Dahlin M.A scalable distributed information management system. Proceedings of SIGCOMM2004 . 2004 被引量:1

二级参考文献17

  • 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
  • 2Yalagandula P,Dahlin M.A scalable distributed information management system.In:Proc.of the ACM SIGCOMM 2004.Portland:ACM Press,2004.379-390. 被引量:1
  • 3Oppenheimer D,Albrecht J,Patterson D,Vahdat A.Design and implementation tradeoffs for wide-area resource discovery.In:Proc.of the HPDC 2005.Washington:IEEE Computer Society,2005.113-124. 被引量:1
  • 4Li JY,Stribling J,Morris R,Kaashoek FM.Bandwidth-Efficient management of DHT routing tables.In:Proc.of the NSDI 2005.2005.99-114. 被引量:1
  • 5Li DS,Lu XC,Wu J.FISSIONE:A scalable constant degree and low congestion DHT scheme based on Kautz graphs.In:Proc.of the IEEE INFOCOM 2005.Miami:IEEE Press,2005.1677-1688. 被引量:1
  • 6Ratnasamy S,Francis P,Handley M,Karp R,Shenker S.A scalable content-addressable network.In:Proc.of the ACM SIGCOMM 2001.San Diego:ACM Press,2001.161-172. 被引量:1
  • 7Kaashoek FM,Karger DR.Koorde:A simple degree-optimal distributed hash table.In:Proc.of the IPTPS 2003.Berkeley:Springer-Verlag,2003.98-107. 被引量:1
  • 8Kleinberg J.The small-world phenomenon:An algorithmic perspective.In:Proc.of the STOC 2000.Portland:ACM Press,2000.820-828. 被引量:1
  • 9Godfrey BP,Shenker S,Stoica I.Minimizing churn in distributed systems.In:Proc.of the ACM SIGCOMM 2006.Pisa:ACM Press,2006.147-158. 被引量:1
  • 10Rhea S,Geels D,Roscoe T,Kubiatowicz J.Handling churn in a DHT.In:Proc.of the USENIX Annual Technical Conf.Boston:USENIX Association Press,2004.127-140. 被引量:1

共引文献38

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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