Fast Update Algorithm for IP Forwarding Table Using Independent Sets

This paper describes a new update algorithm for Internet Protocol (IP) forwarding tables. The update algorithm is so general that it can be combined with many IP address lookup algorithms for fast update. This is done by partitioning the IP forwarding table into independent sets. Each independent set can be looked as a set of disjoint ranges, therefore any data structure for disjoint ranges search can be combined with this algorithm to support fast update. This algorithm achieves fast update by avoiding the worst-case update scenario. The number of independent sets is small, hence, the number of parallel data structures is small.

• Type: Conference
• Year: 2004
• Where: HSNMC
• Authors: Xuehong Sun, Sartaj K. Sahni, Yiqiang Q. Zhao
• Keywords: Fast Update, HSNMC 2004, Independent Sets, Multimedia, Update Algorithm