期刊文献+

Cocast:一种基于传感器的分布式网络距离预测任意播算法

Cocast: A Coordinate-fusion Based Distributed Network Distance Prediction Anycast Algorithm
下载PDF
导出
摘要 针对Internet环境中基于网络坐标估计节点间网络距离的问题,提出了一个利用任意播机制分布式的网络坐标预测算法Cocast:所有用户节点均加入一个结构化Peer-to-Peer对等网;对等网中任意的节点均可以发送网络坐标任意播查询消息,该消息被转发到多个负责坐标计算的用户节点,这些用户节点分布式地预测消息发起节点坐标,最终消息发起节点获得一个综合的坐标位置。Cocast基于网络坐标任意播选择提供位置估计的用户节点,利用层次化网络嵌入预测坐标位置,借助位置融合传感器机制过滤恶意节点的影响。实验表明Cocast具有可扩展、快速收敛、渐增精度、抗恶意节点破坏等优点。 According to the network-coordinate based network distance estimation problem in an Intemet-wide environment, an anycast algorithm named Cocast for cooperative network coordinate estimation is presented. All peers join a structured Peer-to-Peer overlay, and any peer in the overlay, i.e., a requestor, may send a network coordinated anycast message, then the anycast message is forwarded to a set of peers in charge of network coordinate estimation, and each of these peers makes responses from a network coordinate to the requestor, finally the requestor gets a synthetical network coordinate. Based on three novel mechanisms, i.e., an anycast service to select peers for network coordinate estimation, a hierarchical network embedding mechanism to compute the network coordinates, and a coordinate-fusion sensor approach to filter malicious peers' fake-coordinate effects, Cocast owns a fast convergence speed in network coordinate estimation and is more stable. Simulation results confirm that Cocast is sealable, fast-convergent, incrementally accurate and resilient.
出处 《国防科技大学学报》 EI CAS CSCD 北大核心 2007年第6期59-64,共6页 Journal of National University of Defense Technology
基金 国家部委基金资助项目 高等学校全国优秀博士学位论文作者专项资金项目(200141)
关键词 网络距离预测 网络坐标 网络嵌入 P2P对等网 network distance estimation network coordinate network embedding Peer-to-Peer overlay
  • 相关文献

参考文献11

  • 1Su A,Choffnes D,Kuzmanovic A,et al.Drafting hehind Akamai(Travelocity-based Detouring)[C]//Proc.ACM SIGCOMM,2006.
  • 2Ramasubramanisn V, Sirr E G. The Design and Implementation of a Next Generation Name Service for the Internet[C]//Proc. ACM SIC-COMM,2004.
  • 3Rowstron A I T, Druschel P. Pastry: Sealable Decentralized Object Location, and Routing for Large-scale Peer-to-peer Systems[C]//IFIP/ACM International Conference on Distributed Systems Platforms, Heidelberg, Germarry,2001.
  • 4Ng T S E,Zhang H.Predicting Internet Networking Distance with Coordinates-based Approaches[C]//Proceedings of IEEE INFOCOM,June 2002.
  • 5Lee S,Zhang Z L,Sahu S,et al.On Suitability of Euclidean Embedding of Internet Hosts[C]//Proceedings of ACM SigMetrics,2006.
  • 6Dabek F,Cox R,Kaashoek F,et al.Vivaldi:A Decentralized Network Coordinate System[C]//Proceedings of ACM SIGCOMM 2004,Portland,OR,August 2004.
  • 7Zheng H, Lua E K, Pias M, et al. Internet Routing Policies and Round-trip-times[C]//The 6th Anuual Passive and Active Meastwement Workshop, Boston, MA, March 2005.
  • 8Nelder J A, Mead R. A Simplex Method for Function Minimization[ J]. Computer Journal, 1965, 7:308- 313.
  • 9Gu T, Li J, Kasshoek F, et al. Peer-to-peer Simulator[CP]. http://pdos.lcs.mit.edu/p2psim, 2003.
  • 10Medina A, Lakhina A, Matta I, et al. BRITE: An Approsch to Universal Topology Generation[ C]//Proceedings of MASCOTS 2001, Cincinnati, OH, August 2001.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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