Trie partitioning in distributed PC based routers

Recent research in PC based routers has proposed a distributed architecture. Such an architecture poses several challenges in the areas of scalability, robustness, efficiency of routing, latency and other issues.We examine the issue of decrease in throughput due to large routing tables in this architecture and propose partitioning as a solution. Our contribution is twofold: defining the concept of load for a node in a forwarding table trie and to show by simulation experiments the effectiveness of partitioning and its application to a distributed router.