期刊文献+

R-Vivaldi:距离范围感知的IP网络坐标系统 被引量:2

R-Vivaldi: distance range-aware IP network coordinate system
下载PDF
导出
摘要 分析发现,对需预测的节点间时延,若选择在该时延范围附近的节点作为锚节点,则能提高该时延预测准确度。基于此,提出了一种距离范围感知的IP网络坐标系统,即R-Vivaldi。其主要思路为:根据需预测的节点间时延的大致取值范围,在与该取值范围相近的一个距离半径的空间内,重新选择锚节点而得到它的一个新取值范围。依照该过程,被预测时延的取值范围更加明晰,并不断地动态调整锚节点的选择,直至节点间时延的预测误差满足一定需要。仿真结果表明,此方案能有效地提高距离预测准确性,而且在一定程度上克服了预测准确度不一致性问题。 The experience showed that the predicted delay's accuracy was improved when the nodes were chosen around the given delay as anchors. Thus a distance range-aware IP network coordinate system(R-Vivaldi) was proposed. The main idea was: according to the approximate range of the predicted delay, the anchors were re-selected in the radius area of the approximate range to compute the new range. In accordance with the above process, the coordinate system con- stantly iterated the network distance and dynamically chose anchors until the prediction accuracy meet the requirement. Experiments show that the approach can not only effectively improve the prediction accuracy of delay but also overcome inconsistencies of the prediction accuracy to a certain extent.
出处 《通信学报》 EI CSCD 北大核心 2012年第2期87-92,共6页 Journal on Communications
基金 国家重点基础研究发展计划("973"计划)基金资助项目(2012CB315905) 国家自然科学基金资助项目(60873263 60932005 61172048 61100184) 四川省青年基金资助项目(09ZQ026-032) 教育部新世纪优秀人才计划基金资助项目(NCET-09-0268)~~
关键词 IP坐标系统 网络距离 距离感知 坐标计算 IP coordinate system Internet distance distance range-aware coordinate computing
  • 相关文献

参考文献11

  • 1NG T, ZHANG H. Predicting Internet network distances with coordinate-based approaches[A]. Proc of IEEE INFOCOM'02[C]. New York, 2002.170-179.
  • 2LEE S, SAHU S. A cluster based approach for network distance embedding[A]. Proc of the 9th International Conference on Communications and Information Technologies[C]. Icheon, 2009.1040-1045.
  • 3ZHANG Y, ZHANG H. A steady network coordinate system for network distance estimating[A]. Proc of the 2009 15th International Conference on Parallel and Distributed Systems[C]. Shenzhen, China, 2009. 860-863.
  • 4DABEK F, COX R, KAASHOEK F, et al. Vivaldi: a decentralized network coordinate system[A]. Proc of ACM SIGCOMM'04[C]. Portland, OR, 2004.15-26.
  • 5SHAVITF Y, TANKEL T. Big-bang simulation for embedding network distances in euclidean space[J]. IEEE/ACM Transactions on Networking, 2004, 12 (6): 993-1006.
  • 6ZHANG R, TANG C, HU Y. Impact of the inaccuracy of distance prediction algorithms on Internet applications--an analytical and comparative study[A]. Proc of the IEEE INFOCOM[C]. Barcelona, 2006. 1-12.
  • 7ZHANG R, HU Y, LIN X, et al. A hierarchical approach to Internet distance prediction[A]. Proc of ICDCS[C]. Lisboa, Portugal, 2006.73.
  • 8CHEN Y, XIONG Y, SHI X. Pharos: a decentralized and hierarchical network coordinate system for Internet distance prediction[A]. Proc IEEE GLOBECOM[C]. Washington, DC, 2007.26-30.
  • 9YE Z, LIU Y, CHEN S. A new hierarchical network coordinate algorithm based on community structure[A]. International Conference on Computational Science and Engineering[C]. Vancouver, 2009. 418-423.
  • 10COSTA M, CASTRO M, ROWSTRON A. PIC: practical Intemetcoordinates for distance estimation[A]. Proc of IEEE ICDCS[C]. Washington, DC, 2004. 178-187.

同被引文献25

  • 1LEDLIE J, GARDNER P, SELTZER M. Network coordinates in the wild[ C ]//Proc of the 4th USENIX Symposium on Networked Systems Design & Implementation. Cambridge : USENIX, 2007 : 299- 311.
  • 2AGARWAL S, LORCH R. Matchmaking for online games and other latency-sensitive P2P systems [ C ]//Proc of ACM SIGCOMM ' 09 Conference. New York : ACM Press, 2009 : 315- 326.
  • 3AGARWAL S, DUNAGAN J, JAIN N, et al. Volley: automated data placement for geo-distributed cloud services [ C ]//Proc of the 7th USENIX Symposium on Networked Systems Design & Implementation. San Jose, CA : USENIX, 2010.
  • 4CHEN Zhuo, CHEN Yang, DING Cong, et al. Pomelo: accurate and decentralized shortest-path distance estimation in social graphs[ C ]// Proc of ACM SIGCOMM' 11 Conference. New York: ACM Press, 2011:406-407.
  • 5KERMARREC A M, LEROY V,TREDAN G. Distributed social graph embedding[ C]//Proc of the 20th ACM International Conference on Information and Knowledge Management. New York: ACM Press, 2011 : 1209-1214.
  • 6DADEK F, COX R, KASSHOEK F, et al. Vivaldi : a decentralized network coordinate system [ C ]//Proc of ACM SIGCOMM' 04 Conference. New York :ACM Press ,2004 : 15-26.
  • 7SHAVITF Y,TANKEL T. Hyperbolic embedding of Intemet graph for distance estimation and overlay construction [ J]. IEEE/ACM Trans on Networking ,2008,16( 1 ) :25-36.
  • 8SHI Xiao-hui, CHEN Yang, DENG Bei-xing, et al. Network distance prediction based on network coordinate system [ C ]//Proc of the 5th International Conference on Grid and Cooperative Computing Workshops. Piscataway : IEEE Press ,2006 : 170-175.
  • 9PATRIK M, DAN K, RADIM B, et al. Study and performance of localization methods in IP based networks : Vivaldi algorithm [ J ]. Journal of Network and Computer Applications,2011,34( 1 ) :351-367.
  • 10WANG Y, BURGENER D, FLORES M,et al. Towards street level client independent IP geolocation [ C ]//Proc of the 8th USENIX Symposium on Networked Systems Design & Implementation, Boston, MA: USENIX,2011 : 1-14.

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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