On Wed, 06 Dec 2006 14:58:55 -0000, <Bill(_dot_)Oxley(_at_)cox(_dot_)com> wrote:
Nice code, now during your testing how many messages (average message
size today 3k) per second were you able to process and on what machine.
I need something that can do about 1200 messages per second per second.
Thanks,
I haven't done any speed testing yet, but will try some now.
But bear in mind my program was intended to show clearly what needs to be
done. You would not write a production version in Perl, though you might
use that Perl version as a guide to ensure that the production version had
covered all the corners.
But having said that, the question to ask is whether adding this feature
is going to make things significantly slower that all the other extra
stuff you have to add to implement DKIM. My expectation is that the
machine cycles for finding and reversing the MIME encodings will be much
less than the machine cycles consumed by performing the SHA-256 hash,
which has to be done over the whole body in any case.
But that bit is easily checked with my program, since the decoding and
hashing within the Perl library are written in C anyway.
--
Charles H. Lindsey ---------At Home, doing my own thing------------------------
Tel: +44 161 436 6131
Web: http://www.cs.man.ac.uk/~chl
Email: chl(_at_)clerew(_dot_)man(_dot_)ac(_dot_)uk Snail: 5 Clerewood Ave, CHEADLE, SK8 3JU, U.K.
PGP: 2C15F1A9 Fingerprint: 73 6D C2 51 93 A0 01 E7 65 E8 64 7E 14 A4 AB A5
_______________________________________________
NOTE WELL: This list operates according to
http://mipassoc.org/dkim/ietf-list-rules.html