[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Song et al., 2009 - Google Patents

Ipv6 lookups using distributed and load balanced bloom filters for 100gbps core router line cards

Song et al., 2009

View PDF
Document ID
5817244478407911368
Author
Song H
Hao F
Kodialam M
Lakshman T
Publication year
Publication venue
IEEE INFOCOM 2009

External Links

Snippet

Internet line speeds are expected to reach 100 Gbps in a few years. To match these line rates, a single router line card needs to forward more than 150 million packets per second. This requires a corresponding amount of longest prefix match operations. Furthermore, the …
Continue reading at www.researchgate.net (PDF) (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/74—Address processing for routing
    • H04L45/745—Address table lookup or address filtering
    • H04L45/7453—Address table lookup or address filtering using hashing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/74—Address processing for routing
    • H04L45/745—Address table lookup or address filtering
    • H04L45/7457—Address table lookup or address filtering using content-addressable memories [CAM]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/74—Address processing for routing
    • H04L45/742—Route cache and its operation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/54—Organization of routing tables
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/30—Peripheral units, e.g. input or output ports
    • H04L49/3009—Header conversion, routing tables or routing tags
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/40—Wormhole routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/48—Routing tree calculation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/20—Support for services or operations
    • H04L49/201—Multicast or broadcast
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures

Similar Documents

Publication Publication Date Title
Song et al. Ipv6 lookups using distributed and load balanced bloom filters for 100gbps core router line cards
Dharmapurikar et al. Longest prefix matching using bloom filters
US8780926B2 (en) Updating prefix-compressed tries for IP route lookup
US8018940B2 (en) Network address lookup based on bloom filters
US7990973B2 (en) Hash functions for applications such as network address lookup
Dharmapurikar et al. Longest prefix matching using bloom filters
US7019674B2 (en) Content-based information retrieval architecture
US7653670B2 (en) Storage-efficient and collision-free hash-based packet processing architecture and method
Eatherton et al. Tree bitmap: hardware/software IP lookups with incremental updates
Jedhe et al. A scalable high throughput firewall in FPGA
JP2004537921A (en) Method and system for high-speed packet transfer
Bando et al. Flashtrie: Hash-based prefix-compressed trie for IP route lookup beyond 100Gbps
Nikitakis et al. A memory-efficient FPGA-based classification engine
Veeramani et al. Minimization of flow table for TCAM based openflow switches by virtual compression approach
Kaxiras et al. IPStash: a set-associative memory approach for efficient IP-lookup
Bando et al. Flashlook: 100-gbps hash-tuned route lookup architecture
Le et al. Scalable high-throughput sram-based architecture for ip-lookup using FPGA
Islam et al. CP-TRIE: Cumulative popcount based trie for ipv6 routing table lookup in software and ASIC
Baer et al. Memory hierarchy design for a multiprocessor look-up engine
Ghosh et al. A hash based architecture of longest prefix matching for fast IP processing
Hsiao et al. A high-throughput and high-capacity IPv6 routing lookup system
Ray et al. Memory efficient hash-based longest prefix matching architecture with zero false+ ve and nearly zero false− ve rate for IP processing
Ray et al. SRAM based longest prefix matching approach for multigigabit IP processing
Yang et al. Architecture and performance models for scalable IP lookup engines on FPGA
Ray et al. An SRAM-based novel hardware architecture for longest prefix matching for IP route lookup