Interconnections: bridges and routers
Interconnections: bridges and routers
Trading packet headers for packet processing
IEEE/ACM Transactions on Networking (TON)
Small forwarding tables for fast routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Scalable high speed IP routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Faster IP lookups using controlled prefix expansion
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Fast and scalable layer four switching
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
High-speed policy-based packet forwarding using efficient multi-dimensional range matching
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Internet Routing Architectures
Internet Routing Architectures
Fast address look-up for internet routers
BC '98 Proceedings of the IFIP TC6/WG6.2 Fourth International Conference on Broadband Communications: The future of telecommunications
IP switching and gigabit routers
IEEE Communications Magazine
Scalable high-speed prefix matching
ACM Transactions on Computer Systems (TOCS)
Efficient construction of multibit tries for IP lookup
IEEE/ACM Transactions on Networking (TON)
An O(log n) Dynamic Router-Table Design
IEEE Transactions on Computers
O(\log n) Dynamic Router-Tables for Prefixes and Ranges
IEEE Transactions on Computers
Adaptive data structures for IP lookups
Journal of Experimental Algorithmics (JEA)
Level compressed DAGs for lookup tables
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient Construction of Pipelined Multibit-Trie Router-Tables
IEEE Transactions on Computers
Level compressed DAGs for lookup tables
Computer Networks: The International Journal of Computer and Telecommunications Networking
The bitmap Trie for fast prefix lookup
HSI'03 Proceedings of the 2nd international conference on Human.society@internet
Trust by workflow in autonomic communication
MMM-ACNS'05 Proceedings of the Third international conference on Mathematical Methods, Models, and Architectures for Computer Network Security
| Hi-index | 0.01 |
We suggest a new simple forwarding technique to speed-up IP destination address lookup. The technique is a natural extension of IP, requires 5 bits in the IP header (IPv4, 7 in IPv6) and performs IP lookup nearly as fast as IP/Tag-switching but with a smaller memory requirement and a much simpler protocol. The basic idea is that each router adds a "clue" to each packet, telling its downstream router where it ended the IP lookup. Since the forwarding tables of neighboring routers are similar, the clue either directly determines the best prefix match for the downstream router, or provides the downstream router with a good point to start its IP lookup. The new scheme thus prevents repeated computations and distributes the lookup process across the routers along the packet path. Each router starts the lookup computation at the point its up-stream neighbor has finished. Furthermore, the new scheme is easily assimilated into heterogeneous IP networks, does not require routers coordination, and requires no setup time. Even a flow of one packet enjoys the benefits of the scheme without any additional overhead. The speedup we achieve is about 10 times faster than current standard techniques. In a sense this paper shows that the current routers employed in the Internet are clue-less; Namely, it is possible to speedup the IP-lookup by an order of magnitude without any major changes to the existing protocols.