Return to BSD News archive
Path: euryale.cc.adfa.oz.au!newshost.anu.edu.au!harbinger.cc.monash.edu.au!news.mira.net.au!inquo!in-news.erinet.com!bug.rahul.net!rahul.net!a2i!samba.rahul.net!rahul.net!a2i!dhesi.a2i!dhesi From: Rahul Dhesi <dhesi@rahul.net> Newsgroups: comp.unix.bsd.freebsd.misc Subject: Re: FreeBSD as a router Date: 1 May 1996 18:20:45 GMT Organization: a2i network Lines: 18 Message-ID: <4m8a1t$7rr@samba.rahul.net> References: <4lfm8j$kn3@nuscc.nus.sg> <4m0mht$qcl@skipper.netrail.net> <4m1pjc$nle@itchy.serv.net> <DqMLuC.2xo@ritz.mordor.com> <4m39q0$bqu@shellx.best.com> NNTP-Posting-Host: waltz.rahul.net NNTP-Posting-User: dhesi In <4m39q0$bqu@shellx.best.com> rcarter@shellx.best.com (Russell Carter) writes: >TCP STREAM TEST to gelifast ... >Size Size Size Time Throughput >bytes bytes bytes secs. 10^6bits/sec > 32768 32768 8192 60.01 40.99 What happens to the throughput when you have a big routing table with, say, 30,000 entries, and verious-sized prefixes using BGP4? In that case each packet to be routed requires a search for the right routing table entry. How much route caching does FreeBSD do? How efficiently does it search for the longest matching BGP prefix when selecting a route? -- Rahul Dhesi <dhesi@rahul.net> "please ignore Dhesi" -- Mark Crispin <mrc@CAC.Washington.EDU>