Abstract
The problem of providing a fair allocation between responsible flows (such as TCP) and non-responsible (such as UDP) is investigated. A core stateless fair queuing algorithm with high throughput is presented. In the algorithm, the same packet loss strategies that are based on the calculated probability p are used to all of the flows without distinction. And it does not make into account the sensitivity of TCP. So this paper proposes a new algorithm VCSFQ do the different packet loss strategy. The algorithm can protect TCP flows against UDP flows and improves the fairness of bandwidth allocation. The algorithm performs better than CSFQ for getting high throughput. Simulation shows that it is effective and efficient.
Sign-in/Register to access full text options 
Free) 
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
