Quan et al., 2014 - Google Patents

TB2F: Tree-bitmap and bloom-filter for a scalable and efficient name lookup in content-centric networking

Quan et al., 2014

Document ID: 16854940744356068012
Author: Quan W; Xu C; Vasilakos A; Guan J; Zhang H; Grieco L
Publication year: 2014
Publication venue: 2014 IFIP Networking Conference

External Links

Cited by

Snippet

Content-Centric Networking (CCN) is an entirely novel networking paradigm, in which packet forwarding relies upon lookup operations on content names directly instead of fixed- length host addresses. The unique features of CCN names, ie, variable length, huge …

Continue reading at telematics.poliba.it (PDF) (other versions)

238000000034 method 0 description 24

Classifications

- 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/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30312—Storage and indexing structures; Management thereof
- G06F17/30321—Indexing structures
- G06F17/3033—Hash tables
- 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/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30386—Retrieval requests
- G06F17/30424—Query processing
- G06F17/30533—Other types of queries
- G06F17/30545—Distributed queries
- 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
- 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/30861—Retrieval from the Internet, e.g. browsers
- G06F17/30864—Retrieval from the Internet, e.g. browsers by querying, e.g. search engines or meta-search engines, crawling techniques, push systems
- 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]
- 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/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F17/30613—Indexing
- G06F17/30619—Indexing indexing structures
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements or network protocols for addressing or naming
- H04L61/15—Directories; Name-to-address mapping
- 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
- H04L29/00—Arrangements, apparatus, circuits or systems, not covered by a single one of groups H04L1/00 - H04L27/00 contains provisionally no documents
- H04L29/12—Arrangements, apparatus, circuits or systems, not covered by a single one of groups H04L1/00 - H04L27/00 contains provisionally no documents characterised by the data terminal contains provisionally no documents
- H04L29/12009—Arrangements for addressing and naming in data networks
- H04L29/12792—Details
- H04L29/12811—Caching of addresses
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
- H04L67/10—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation

Similar Documents

Publication	Publication Date	Title
Quan et al.	2014	TB2F: Tree-bitmap and bloom-filter for a scalable and efficient name lookup in content-centric networking
Li et al.	2018	Packet forwarding in named data networking requirements and survey of solutions
Dharmapurikar et al.	2006	Longest prefix matching using bloom filters
Lim et al.	2012	On adding bloom filters to longest prefix matching algorithms
Varvello et al.	2013	On the design and implementation of a wire-speed pending interest table
Tzeng et al.	1999	On fast address-lookup algorithms
US20100306409A1 (en)	2010-12-02	System and method for location discovery based on dns
CN104579974B (en)	2017-10-31	The Hash Bloom Filter and data forwarding method of Name Lookup towards in NDN
Lee et al.	2016	Name prefix matching using bloom filter pre-searching for content centric network
Ghasemi et al.	2018	A fast and memory-efficient trie structure for name-based packet forwarding
CN106921699A (en)	2017-07-04	A kind of Network Access Method, device and system
CN110858823B (en)	2023-03-07	Data packet classification method and device and computer readable storage medium
US20100306410A1 (en)	2010-12-02	Creating a tree to facilitate efficient access to information
CN103544261A (en)	2014-01-29	Method and device for managing global indexes of mass structured log data
Xiao et al.	2009	Using parallel bloom filters for multiattribute representation on network services
Yang et al.	2018	Constant IP lookup with FIB explosion
Priya et al.	2010	Hierarchical packet classification using a Bloom filter and rule-priority tries
Lee et al.	2020	Dual-load Bloom filter: Application for name lookup
CN108647266A (en)	2018-10-12	A kind of isomeric data is quickly distributed storage, exchange method
CN116634017B (en)	2024-02-06	Identification analysis data caching method and device based on digital object
Lim et al.	2007	High-speed packet classification using binary search on length
Yuan	2015	Data structures and algorithms for scalable NDN forwarding
CN115714752B (en)	2024-10-25	Packet classification method and device, forwarding chip and electronic equipment
CN102739550B (en)	2015-11-25	Based on the multi-memory flowing water routing architecture that random copy distributes
Huang et al.	2018	A hybrid approach to scalable name prefix lookup