BitTorrent系统中瞬间拥挤阶段建模与分析  

Modeling and Analyzing Flash-crowd Phase in BitTorrent System

作　　者：闫清泉[1] 吴刚[1] 奚宏生[1] 王嵩[1] 谭小彬[1] 

机构地区：[1]中国科学技术大学自动化系,安徽合肥230027

出　　处：《小型微型计算机系统》2008年第10期1807-1810,共4页Journal of Chinese Computer Systems

基　　金：安徽省优秀青年科技基金(08040106910)资助

摘　　要：BitTorrent是目前最流行的P2P内容分发系统之一.使用Kermack-Mckendrick模型对BitTorrent系统中瞬间拥挤(Flash-Crowd)阶段进行建模,研究了系统节点数及服务能力在瞬间拥挤阶段的发展演化过程.与原有模型相比,Kermack-Mckendrick模型能更好的吻合观测数据.最后结合BitTorrent系统的实际特点,给出提高BitTorrent系统处理瞬间拥挤能力的可行方案,如增加初始种子数量,减少文件段的大小,增加激励策略等.BitTorrent is one of the most popular P2P Content Distribution systems. In this paper, we use the Kermaek-Mckendrick model to model the Flash-Crowd phase, studying the evolvement of the number of nodes and the service capacity of Flash-Crowd phase in BitTorrent system. Comparing with other models ; our Kermack-Mckendrick model matches the observed data best. At last, we give some advice on improving service capacity of BitTorrent system, e.g. increasing the initial seed count, decreasing the size of file pieces and adding stimulating strategy.

关 键 词：P2P系统 BITTORRENT系统 SIR模型 瞬间拥挤 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]