Talk:Round-robin scheduling

From Wikipedia, the free encyclopedia

Someone needs to expand on this

- I completely agree with you. —Preceding unsigned comment added by 213.86.119.247 (talk) 13:33, 12 February 2008 (UTC)

"Round-robin scheduling results in max-min fairness if the data packets are equally sized, since the data flow that has waited longest time is given scheduling priority"

Q: How come the data flow that has waited the longest time is given scheduling priority if Round-Robin is based on forwarding the following flow if a current serviced flow is absent?

A: Perhaps because the second clause is wrong. Please rephrase it. "... since all active flows will take turns in a fair manner, independently of how many packets that are in queue in the flow"? Mange01 (talk) 21:24, 6 May 2008 (UTC)