On 12/3/07, Arnaldo Carvalho de Melo [EMAIL PROTECTED] wrote:
WARNING: After reading some messages from Ingo Molnar on lkml I think we
should really
trim the number of lists we use for kernel development. And since I
moved
back to using mutt for reading e-mails, something
In addition, it makes two corrections too the code:
1. The receiver of a half-connection does not set window counter values;
only the sender sets window counters [RFC 4342, sections 5 and 8.1].
2. The computation of X_recv does currently not conform to TFRC/RFC 3448,
since this
A ringbuffer-based implementation of loss interval history is easier to
maintain, allocate, and update.
Details:
* access to the Loss Interval Records via macro wrappers (with safety checks);
* simplified, on-demand allocation of entries (no extra memory consumption on
lossless links); cache
Em Mon, Dec 03, 2007 at 08:35:12AM +, Gerrit Renker escreveu:
Hi Arnaldo,
hank you for going through this. I have just backported your recent patches
of 2.6.25
to the DCCP/CCID4/Faster Restart test tree at
git://eden-feed.erg.abdn.ac.uk/dccp_exp {dccp,ccid4,dccp_fr}
as per
2007/12/3, Gerrit Renker [EMAIL PROTECTED]:
I have just backported the latest changes that Arnaldo put in the 2.6.25
tree to the test tree. While it seems correct, I have not run exhaustive
tests, but will run a few.
I have also updated the CCID4/Faster Restart branches with regard to
these
Em Mon, Dec 03, 2007 at 01:49:47PM +, Gerrit Renker escreveu:
| Are you suggesting using netdev exclusively or in addition to [EMAIL
PROTECTED]
|
| Well, since at least one person that has contributed significantly in
| the past has said he can't cope with traffic on netdev, we can CC
| | static inline void ccid3_hc_rx_update_s(struct ccid3_hc_rx_sock
*hcrx, int len)
| | {
| | if (likely(len 0))/* don't update on empty
packets (e.g. ACKs) */
| | hcrx-ccid3hcrx_s =
tfrc_ewma(hcrx-ccid3hcrx_s, len, 9);
| |
7 matches
Mail list logo
