An Efficient Mask Reduction Strategy to Optimize Storage and Computational Complexity in Routing Table Lookups

The concept of IP addressing stands to be an inevitable component in today's deeply interconnected world. An indispensable and critical component in packet movement between desired IP addresses is look up in routing tables. Improving the matrices of such lookups would significantly impact the overall data communication realm. The proposed system reduces the lookup complexity in forwarding tables by incorporating an improved computation and storage optimization strategy in edge routers. An alternative data structure for the existing tree model has been put forth which proves to offer much faster processing capabilities and lesser memory requirements. Augmentation in efficiency is achieved by eliminating the redundancy in processing associated with subnet masks.