[98787] in North American Network Operators' Group
Re: question on algorithm for radius based accouting
daemon@ATHENA.MIT.EDU (Ian Mason)
Fri Aug 17 08:47:14 2007
In-Reply-To: <1DDD4A8C38E96A42B93D0E1677DE30082BAD88@store1.hq.nac.net>
Cc: "Joe Shen" <joe_hznm@yahoo.com.sg>, "NANGO" <nanog@merit.edu>
From: Ian Mason <nanog@ian.co.uk>
Date: Fri, 17 Aug 2007 13:30:31 +0100
To: Alex Rubenstein <alex@corp.nac.net>
Errors-To: owner-nanog@merit.edu
On 17 Aug 2007, at 04:52, Alex Rubenstein wrote:
>
>> My question is: what's the best algorithm for
>> constrcting broadband access record from radius
>> accouting packets?
>
>
[snip]
>
> They should yield (approximately) the same result. But, to be
> pedantic,
> you haven't accounted for latency within the network.
>
Somebody should be whipped, either for:
1) If you can find a network where that matters, even in the slightest,
the oerson responsible for the design and/or maintainance
OR
2) You, for making even this aged arch-pedant wince. :-)
Seriously, can I also add that RADIUS interim accounting is almost
essential in this scenario. Real world accounting and session boundaries
mis-match badly making it almost mandatory to use interim accounting
records to get an approximation of what the figures look like from
a billing perspective. I'll also add "watch out for missing records"
- I've found RADIUS to be the lossiest network protocol per foot of
cabling that I've ever used.