Abstract

PDF HTML阅读 XML下载 导出引用 引用提醒 基于自适应随机行走的可扩展无偏抽样方法 DOI: 作者: 作者单位: 作者简介: 通讯作者: 中图分类号: 基金项目: Supported by the National Natural Science Foundation of China under Grant Nos.60873215, 60621003 (国家自然科学基金); theNational Basic Research Program of China under Grant No.2005CB321801 (国家重点基础研究发展计划(973)); the SpecializedResearch Fund for the Doctoral Program of Higher Education of China No.200899980003 (高等学校博士学科点专项科研基金); theFoundation for the Author of National Excellent Doctoral Dissertation of China under Grant No.200141 (高等学校全国优秀博士学位论文作者专项); the Graduate Research Innovation Fund of NUDT of China under Grant No.B080602 (国防科学技术大学优秀研究生创新资助) A Scalable Unbiased Sampling Method Based on Multi-Peer Adaptive Random Walk Author: Affiliation: Fund Project: 摘要 | 图/表 | 访问统计 | 参考文献 | 相似文献 | 引证文献 | 资源附件 | 文章评论 摘要:针对非结构化P2P 系统中可扩展的快速无偏抽样问题,提出了一种基于多个peer 自适应随机行走的抽样方法SMARW.在该方法中,基于代理随机行走选择一组临时的peer 执行抽样过程,一次产生一组可调数目的抽样节点,提高了抽样速度,选择每次产生的抽样节点作为临时peer 进行新的抽样过程,这种简单的方法可以保证系统具有近似最优的系统负载均衡程度.同时,SMARW 利用自适应的分布式随机行走修正过程提高抽样过程的收敛速度.理论分析和模拟测试表明,SMARW 方法具有较高的无偏抽样能力以及近似最优的系统负载均衡程度. Abstract:To deal with the scalable and fast unbiased sampling problems in unstructured P2P systems, a sampling method based on multi-peer adaptive random walk (SMARW) is proposed. In the method, based on the multi-peerrandom walk process, a set of provisional peers are selected as agents which start the sampling processes, by whichthe sampling process is speeded up with receiving a set of tunable number samples each time; Meanwhile, afterreceiving new samples earlier agents are replaced with these new samples which repeat the sampling process. Withthis simple replacement, it can be guaranteed with high probability that the system can reach the optimal loadbalance; furthermore, SMARW adopts an adaptive distributed random walk adjustment process to increase theconvergence rate of the sampling process. A detailed theorical analysis and performance evaluation confirm thatSMARW has a high level of unbiased sampling and near-optimal load balancing capability. 参考文献 相似文献 引证文献

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.