Contributed by ben on from the humppa! dept.
O’Reilly Network has a very nice interview with several developers that discusses many of the features, including improved networking support, pf changes, SCSI support, and improvements to the package system in the upcoming OpenBSD 4.0 release.
(Comments are closed)
By Anonymous Coward (69.70.207.240) on
By Dustin Lundquist (131.191.91.111) on
Comments
By djm@ (206.59.235.113) on
> routing table. Any idea on the performance hit of using it?
There will be a performance hit, but I haven't measured it. Unless you are hitting the rule on every packet (i.e no "keep state"), then the cost is *per-state* not per-packet. BTW, the cost is almost same as the existing "no-route" predicate (only a comparison more).
If you have a very busy network or a good testbed, then I'd love to see some measurements.
-d
Comments
By Lars Hansson (203.65.245.80) lars@unet.net.ph on
> > routing table. Any idea on the performance hit of using it?
>
> There will be a performance hit,
The interesting question is of course if it's a significantly larger performance hit than doing ingress filtering manually with tables or lists. I doubt it is.
By Anonymous Coward (87.78.71.194) on
Very nice!
By Anonymous Coward (87.194.34.157) on