期刊文献+

一种可视化云对等网络模拟器的设计 被引量:2

Design of a visual cloud-to-peer network simulator
下载PDF
导出
摘要 从云计算Iaa S(Infrastructure as a Service)的角度来说,云资源就是提供云计算基础设施服务的物理节点。若使用一致性哈希算法为每个云资源生成一个唯一的资源标识符,该标识符空间便可以把云网络的拓扑结构、云资源索引信息的存储和云资源的定位三者有机地结合起来,从而形成一个结构化P2P覆盖网络。利用此特殊的覆盖网络,可以设计出云资源索引信息的共享方案来解决云资源的快速检索和高效定位问题。为了方便基于对等网络云资源信息共享平台和云资源高效定位算法的深入研究,设计了一个可视化云对等网络模拟器,实验表明该模拟器能够很好地模拟出实际的云环境。 From cloud computing Iaa S( Infrastructure as a Service) perspective,cloud resource is to provide cloud computing infrastructure services,physical node. Each cloud resources generate a unique resource identifier if used consistent hashing algorithm,the identifier space is able to locate the three cloud storage and cloud resources in the network topology,cloud resource index information is organically combined,thereby forming a structured P2 P overlay network. This particular use of the overlay network,sharing scheme can be devised to cloud resource index resolved quickly retrieve information cloud resources and efficient positioning. In order to facilitate efficient localization algorithm based on thorough research and other network information sharing platform cloud resources and cloud resources,this paper designs a visual cloud peer network simulator. The experiments show that the simulator can simulate the actual cloud environment.
出处 《信息技术》 2015年第4期67-70,共4页 Information Technology
基金 国家自然科学基金(61170277) 上海市教委科研创新重点项目(12zz137) 上海市一流学科建设项目(S1201YLXK)
关键词 云资源 对等网络 模拟器 资源定位 多维查找 cloud resources cloud peer-to-peer network simulator resources locating multi-search
  • 相关文献

参考文献14

  • 1王必晴,贺鹏.H-Chord:基于层次划分的Chord路由模型及算法实现[J].计算机工程与应用,2007,43(36):141-143. 被引量:8
  • 2段世惠,王劲林.基于有限范围组播的Chord路由算法[J].计算机应用,2009,29(2):514-517. 被引量:6
  • 3Stoica I,Mmorris R,Karger D,et al.Chord:A Scalable Peer-topeer Lookup Service for Internet Applications[J].IEEE/ACM Trans On Networking,2003,11(1):17-32.
  • 4Rowstron A,Druschel P.Pastry:Scalable,Distributed Object Location and Routing for Large scale Peer-to-Peer Systems[C]∥Lecture Notes in Computer Science,Berlin:Springer-Verlag,2001,2218:329-350.
  • 5Ratnasamy S,Francis P,Handley M,et al.A Scalable Content-Addressable Network[C]∥Proc of ACM SIGCOMM Conference.New York:ACM Press,2001:161-172.
  • 6Malkhi D,Naor M,Rata Jzak D.Viceroy:A scalable and dynamic emulation of the butterfly[M]∥Proc of the 21th annual symposium on Principles of distributed computing.New York:ACM Press,2002:183-192.
  • 7Kleis M,Lua EK,Zhou X.Hierarchical Peer-to-Peer Networks using Lightweight Super Peer Topologies[C]∥Proc of the 10th Symposium on Computers and Communications.Washington DC:IEEE Computer Society,2005:143-148.
  • 8Shen H,Chen G.Cycloid:A constant-degree and lookup-efficient p2p overlay network[C]∥Proc of the 18th International Parallel and Distributed Processing Symposium.Washington DC:IEEE Computer Society,2004:1-10.
  • 9Gupta I,Birman K,Lnga P,et al.Kelips:building an efficient and stable P2P DHT through increased memory and background overhead[C]∥Lecture Notes in Computer Science,Berlin:Springer-Verlag,New York:ACM Press,2003,2735:160-169.
  • 10Gupta A,Liskov B,Rodr Iguser.One-hop lookups for peer-to-peer overlays[C]∥Proc of the 1st Symposium on Networked Systems Design and Implementation.New York:ACM Press,2004:113-126.

二级参考文献19

  • 1张震,王晓明.对等网中Chord资源查找算法研究[J].计算机工程与应用,2006,42(11):147-152. 被引量:16
  • 2Stoica I,Morris R,Karger D,et al.Chord:a scalable Peer-to-Peer lookup service for Intemet application [C]//Proceedings of the 2001 ACM SIGCOMM Conference,2001,149-160.
  • 3Zhao B Y,Kubiatowicz J,Joseph A D.Tapestry:an infrastructure for fault-tolerant wide-area location and routing,CSD-01-1141[R].UC Berkeley, UCB, 2000.
  • 4Fu X D,Shi W S,Akkerman A.CANS:composable,adaptive network services infrastructure[C]//Proceedings of the 3rd USEN IX Symposium lnternet Technologies and Systems,2001.
  • 5Row S A,Druschel P.Pastry:scalable,distributed object location and routing for large-scale peer-to-peer systems[C]//Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms, 2001.
  • 6Ganesan P,Manku G S.Optimal routing in Chord[D].Stanford University, SODA, 2004.
  • 7Gupta A,Liskov B,Rodrigues R.One hop lookups for peer-to-peer overlays [C]//Procedings of the 9th Workshop on Hot Topics in Operating Systems( HotOS-IX), 2003.
  • 8Gupta A,Liskov B,Rodrigues R.Efficient routing for peer-to-peer overlays[C]//Proceedings of the 1st Symposium on Networked Systems Design and Implementation (NSDI'04),San Rancisco, California,2004.
  • 9Saroiu S,Gummadi P K,Gribble S D.A measurement study of peer-to-peer file sharing systems[C]//Proceedings of the Multimedia Computing and Networking Conference,San Jose,California, USA, 2002.
  • 10ROWSTRON A,DRUSCHE P.Pastry:Scalable,distributed object location and routing for large.scale peer.to.peer systems. http://www.research.microsoft.com/~antr/PAST/pastry.ps . 2008

共引文献9

同被引文献9

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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