Simple and fast IP lookups using binomial spanning trees-Reference-Cited by-同舟云学术

Simple and fast IP lookups using binomial spanning trees

Published:2005-03 Issue:5 Volume:28 Page:529-539
ISSN:0140-3664
Container-title:Computer Communications
language:en
Short-container-title:Computer Communications

Author:

Chang Yeim-Kuan

Publisher

Elsevier BV

Subject

Computer Networks and Communications

Reference18 articles.

1. M. Akhbarizadeh, M. Nourani, IP routing based on partitioned lookup table, in: Proceedings of the IEEE International Conference on Communications (ICC), April 2002, pp. 2263–2267.

2. T. Chiueh, P. Pradhan, High performance IP routing table lookup using CPU caching, in: Proceedings of INFOCOM 99, March 1999, pp. 1421–1428.

3. M. Degermark, A. Brodnik, S. Carlsson, S. Pink, Small forwarding tables for fast routing lookups, in: Proceedings of ACM SIGCOMM, October 1997, pp. 3–14.

4. Trie, memory;Fredkin;Communications of the ACM,1960

5. P. Gupta, S. Lin, N. McKeown, Routing lookups in hardware at memory access speeds, in: Proceedings of INFOCOM 99, March 1999, pp. 1240–1247.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Multilevel length-based classified index table for IP lookups and updates;Journal of Computer and System Sciences;2020-09

2. PARASOL: a hybrid approximation approach for scalable frequent itemset mining in streaming data;Journal of Intelligent Information Systems;2019-12-17

3. Multi-Inherited Search Tree for Dynamic IP Router-Tables;IEEE Transactions on Computers;2017-01-01

4. A Classified Multisuffix Trie for IP Lookup and Update;IEEE Transactions on Computers;2012-05

5. Multiprefix Trie: A New Data Structure for Designing Dynamic Router-Tables;IEEE Transactions on Computers;2011-05