首页 | 本学科首页   官方微博 | 高级检索  
     

实现BT数据流控制的集中管理和节点分组算法
引用本文:陶晶,凌力.实现BT数据流控制的集中管理和节点分组算法[J].计算机应用与软件,2009,26(4).
作者姓名:陶晶  凌力
作者单位:复旦大学通信工程系,上海,200433
摘    要:在BitTorrent(简称BT)系统,节点利用"上行"带宽1]来互传文件,然而这种系统中的节点之间连接所产生的数据流却消耗掉大量的主干网带宽,因此提出集中管理和节点分组(CMAPC)策略全局管理这种数据流.通过网络距离的测量,将所有节点与自己临近的节点分在一组,同组节点建立连接.实验结果显示:在不影响BT的其它性能的情况下,CMAPC能较高比例地将数据流限制在本子网中.所以得出结论:把数据流限制在本子网内来减小主干网的负载是一种较好的技术途径.

关 键 词:端对端文件共享系统  本地子网  数据流  主干网过载

TRAFFIC SHAPING OF BT DATA FLOW BY CENTRALIZED MANAGEMENT AND PEER-NODE CLUSTER
Tao Jing,Ling Li.TRAFFIC SHAPING OF BT DATA FLOW BY CENTRALIZED MANAGEMENT AND PEER-NODE CLUSTER[J].Computer Applications and Software,2009,26(4).
Authors:Tao Jing  Ling Li
Affiliation:Department of Communications Science and Engineering;Fudan University;Shanghai 200433;China
Abstract:In BitTorrent(BT) system,file interactive transmission between peer nodes takes advantage of "upstream"1] bandwidth.However large amount of backbone bandwidth in the Internet is consumed by data flow occurred from these ubiquitous peer-to-peer connections.To solve this problem,we propose the Centralized Management and Peer-node Cluster(CMAPC) to globally manage peer-to-peer traffic by intentionally setting up connections within local area networks.Through the network distance measurement,all nodes will be ...
Keywords:BT
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号