Talk:Weighted round robin

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles
Low	This article has been rated as Low-importance on the project's importance scale.
	This article is supported by Networking task force (assessed as Mid-importance).

Unnecessary transformation[edit]

there is unnecessary transformation going on. mathematically this

for each flow f
   f.normalized_weight = f.weight / f.mean_packet_size

min = findSmallestNormalizedWeight

for each flow f
   f.packets_to_be_served = f.normalized_weight / min

is equal to

 min=find smallest waight
 for each flow f
 (f.weight/f.mean_packet_size)/
 (f.weight(0)/f.mean_packet_size)
  = f.weight/f.weight(0)

is there any reason to to do n times more divisions ? if there are some rounding problems it should be mentionned on main page. thanks. — Preceding unsigned comment added by Xchmelmilos (talk • contribs) 10:30, 4 May 2008‎ (UTC)[reply]

The mean packet size can differ from one flow to another.

f.packets_to_be_served = f.normalized_weight / min

is equal to

f.packets_to_be_served = (f.weight / f.mean_packet_size) / (min_f.weight / min_f.mean_packet_size)

In fact the weakness section of this article mentions that having to know the mean packet size is a problem with this algorithm - having the mean packet size cancel out doesn't make sense. --195.37.186.61 (talk) 23:13, 22 August 2012 (UTC)[reply]

Unnecessary transformation[edit]

Related links[edit]