Fast routing table lookup based on deterministic multi-hashing

@article{Huang2010FastRT,
  title={Fast routing table lookup based on deterministic multi-hashing},
  author={Zhuo Huang and David Lin and Jih-Kwon Peir and Shigang Chen and S. M. Iftekharul Alam},
  journal={The 18th IEEE International Conference on Network Protocols},
  year={2010},
  pages={31-40}
}
New generations of video, voice, high-performance computing and social networking applications have continuously driven the development of novel routing technologies for higher packet forwarding speeds to meet the future Internet demand. One of the fundamental design issues for core routers is fast routing table lookup, which is a key problem at the network layer of the Internet protocol suite. It is difficult to scale the current TCAM-based or trie-based solutions for future routing tables dueā€¦Ā CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 25 references

A Design for High- Speed Low-Power Cmos Fully Parallel Content-Addressable Memory Macros

  • H. Miyatake, M. Tanaka, Y. Mori
  • IEEE Journal of Solid-State Circuits, 2001.
  • 2001
Highly Influential
6 Excerpts

Peacock Hash: Fast and Updatable Hashing for High Performance Packet Processing Algorithms

  • S. Kumar, J. Turner, P. Crowley
  • Proc. of IEEE INFOCOM, 2008.
  • 2008
Highly Influential
5 Excerpts

Balanced Allocations

  • Y. Azar, A. Broder, E. Upfal
  • Proc. of ACM STOC, 1994.
  • 1994
Highly Influential
4 Excerpts

Similar Papers

Loading similar papersā€¦