Board and the CRC for Broadband Telecommunications and Networking. (1994)
Download:
|
|
by N. Clarke, A. Cantoni
ftp://ftp.lirmm.fr/pub/odbi/clarke1.ps.gz
Add To MetaCart
Abstract:
Look-up tables are used extensively in telecommunications networks in such areas as multiplexing, switching, routing and re-assembly. There are also many applications involving lookup tables outside the field of telecommunications, such as electronic dictionaries and database search algorithms. Essentially, look-up tables map sets of input numbers onto arbitrary sets of output numbers. In this paper we present two new methods for the design of high speed, dynamic look-up tables and compare them with other common look-up table implementations. 1
Citations
| 165 | Trie memory – FREDKIN - 1960 |
| 84 | Fast routing table lookup using CAMS – McAuley - 1993 |
| 40 | Computer Architecture and Parallel Processing – Hwang, Briggs - 1984 |
| 28 | Putting routing tables in silicon – Pei, Zukowski - 1992 |
| 27 | An Architecture for – Rekhter, Li - 1993 |
| 17 | Content-addressable and associative memory: Alternatives to the ubiquitous RAM – Chisvin, Duckworth - 1989 |
| 11 | Parallel searching techniques for routing table lookup – Knox, Panchanathan - 1993 |
| 8 | Algorithms, 2nd ed – Sedgewick - 1988 |
| 4 | Cascading Content Addressable Memories – Moors, Cantoni - 1992 |
| 1 | Computer Networks", Prentice-Hall, 2nd Edition – Tanenbaum - 1989 |
| 1 | When one LAN is not enough: Bridges, Routers and Gateways can `network the networks"', BYTE – Stallings - 1989 |
| 1 | Asynchronous Transfer Mode Receiver – Hill, Cantoni, et al. - 1992 |
