针对p2p流量的SFQ算法改进

With the emergence of p2p application, the current situation of Internet has changed very greatly, p2p file-sharing produce flow become the largest single flow of Internet. The SFQ queue have a large number of p2p connection, and that a lot of p2p connections only corresponds to a handful of p2p users, so a small amount of p2p user will occupies a larger bandwidth because of the effects of SFQ algorithm. In order to solve this problem, this paper proposes an improved SFQ algorithm was presented, and give the mathematical deduction.