[LARTC] (E)SFQ HRR (=Hierarchical Round Robin)

[LARTC] (E)SFQ HRR (=Hierarchical Round Robin)

[Don Cohen]

 > From: Martin Devera <devik@cdi.cz>
 > Subject: [LARTC] (E)SFQ suggestion
 > Hi,
 > just simple note. Maybe it is already in progress :)
 > 
 > There are attempts to replace hashing routine in SFQ to
 > consider IPs or ports.
 > What about to use HRR - roundrobin around bunch of IP
 > adresses and then smaller WRR for ports per IP ?
 > It would solve both problems - fairnes between computers
 > (IP) and between flows on than single computer ...

(Took me a moment to figure out HRR=Hierarchical Round Robin.)

Yep, that has been on my queue for a long time.
(Though I'm interested in a different case than source IP in first
level and other stuff in second.)

Problems:
- it's a lot more storage (instead of small constant space per
subqueue we now have constant per sub-subqueue, so something 
like 128 => 128 x 20)
- double the time for two lookups
- nontrivial change in code.  Of course, the temptation would be to
make the code work with n levels.  

So far I've been able to get by without it.  That, along with the
disincentives above account for it remaining on the queue for so
long.  Some day I'll need it.  If I'm lucky someone else will get
there before me.

_______________________________________________
LARTC mailing list / LARTC@mailman.ds9a.nl
http://mailman.ds9a.nl/mailman/listinfo/lartc HOWTO: http://lartc.org/