Subnet Modeling Approach For Creating Synthetic Routing Tables
Original Publication Date: 2003-Jan-02
Included in the Prior Art Database: 2003-Jan-02
The routing table is a key feature in the testing of packet forwarding engines like routers. The primary motivation of a performance test is to impact the complete routing table by packets. Conventional packet generators have hardware limitations, which prevent generation of a large number of distinct packets to hit all the entries in the routing table. To overcome this limitation, an address increment feature available in all conventional traffic generators is used. To complement this feature, the routing table needs to be recreated with all the key characteristics preserved. This article describes an algorithm for generating a synthetic routing table from a real world routing table. The algorithm models subnets from the routing table and attempts to mimic the prefix length and class distribution characteristics of the real world routing table.