Efficient entry-reduction algorithm for TCAM-based IP forwarding engine

Access Full Text

Efficient entry-reduction algorithm for TCAM-based IP forwarding engine

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© IEE
Published

Ternary content-addressable memory has been widely used to perform fast routing lookups. It is able to accomplish the best matching prefix searching in O(1) time without considering the number of prefixes and their lengths. As compared to the software-based solutions, the ternary content-addressable memory can offer sustained throughput and simple system architecture. However, it also comes with several shortcomings, such as the limited number of entries, enormous cost and power consumption. Accordingly, an efficient algorithm is proposed to reduce the required size of ternary content-addressable memory. The proposed scheme can eliminate 98% of ternary content-addressable memory entries by adding comparatively little DRAM and, thus, is attractive for IPv6 routing lookup.

Inspec keywords: telecommunication network routing; IP networks; power consumption; content-addressable storage; table lookup

Other keywords: matching prefix searching; entry-reduction algorithm; ternary CAM-based IP forwarding engine; power consumption; IPv6 routing lookup; TCAM-based IP forwarding engine; DRAM; ternary content-addressable memory; throughput

Subjects: Computer networks and techniques; Communication network design, planning and routing; Computer communications

References

    1. 1)
      • Rekhter, Y., Li, T.: ‘An architecture for IP address allocation with CIDR’, RFC 1518, Sept. 1993.
    2. 2)
    3. 3)
      • Degermark, M., Brodnik, A., Carlsson, S., Pink, S.: `Small forwarding tables for fast routing lookups', Proc. ACM SIGCOMM’ 97, Sept. 1997, Cannes, France, p. 3–14.
    4. 4)
      • Waldvogel, M., Varghese, G., Turner, J., Plattner, B.: `Scalable high speed IP routing lookups', Proc. ACM SIGCOMM ’97, Sept. 1997, Cannes, France, p. 25–36.
    5. 5)
    6. 6)
      • V. Srinivasan , G. Varghese . Fast IP lookups using controlled prefix expansion. ACM Trans. Comput. , 1 , 1 - 40
    7. 7)
      • NLANR Project. See http://moat.nlanr.net/.
    8. 8)
    9. 9)
      • Gupta, P., Lin, S., McKeown, N.: `Routing lookups in hardware at memory access speeds', Proc. IEEE INFOCOM’98, March 1998, San Francisco, CA, USA.
    10. 10)
    11. 11)
      • Merit Networks, Inc. Internet performance measurement and analysis (IPMA) statistics and daily reports. See http://www.merit.edu/ipma/routingtable.
    12. 12)
    13. 13)
      • B. Lampson , V. Srinivasan , G. Varghese . IP lookups using multiway and multicolumn search. IEEE/ACM Trans. Netw. , 4 , 324 - 334
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-com_20041153
Loading

Related content

content/journals/10.1049/ip-com_20041153
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading