摘要
为减少对主干网络带宽的消耗,提出了一套数据流量优化方法。首先通过把Peer间的邻居关系明确划分为物理邻居关系和逻辑邻居关系,并用探路者算法来发现Peer的物理邻居,实现拓扑匹配;然后在数据调度算法中,引入通报/退避机制,把大部分数据传输控制在城域网络内部。通过建立模拟仿真环境进行实验分析,证实了该方法可以减少90%以上的网络数据流量。
At present,too much network bandwidth has been occupied by a variety of P2P applications that greatly affect the backbone of the network.A scheme for data flow optimization is presented to reduce the consumption of the network bandwidth.In the scheme,the peers relationship is divided into physical and logical neighbors,the pathfinder algorithm is used to determine the relationship between peers and achieve topology matching,and the notice/drawback mechanism is introduced in the data scheduling algorithms to make most data transmission under the control of metropolitan area network.The experiment results of a simulation environment prove that the scheme mentioned above is an effect way of reducing the network traffic by 90%.
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
2011年第1期111-115,共5页
Journal of University of Electronic Science and Technology of China
基金
国家自然科学基金(61073181)
关键词
邻居
优化
P2P
调度算法
拓扑
neighbor
optimization
P2P
scheduling algorithms
topology
