Implementing Lightweight Routing for BSD TCP/IP
Click here to download now
Overview: This white paper presents a lightweight leaf node routing algorithm and implementation for the BSD networking stack and discuss why the new approach was difficult to implement. The key idea in the algorithm is to observe that end hosts will always send packets to the default gateway and therefore are not required to do actual routing. By removing routing functionality not required for embedded devices, the size of the compiled BSD routing code was reduced by over 430% resulting in a 22% overall reduction of the networking stack, this is more than the size of the TCP module.