NDLI: Greedy name lookup for named data networking

Please wait, while we are loading the content...

Volume 41, Issue 4, March 2014

Volume 41, Issue 3, December 2013

Volume 41, Issue 2, September 2013

Volume 41, Issue 1, June 2013

Designing large-scale nudge engines

Practical conflict graphs for dynamic spectrum distribution

A large-scale service system with packing constraints

Efficient crowdsourcing for multi-class labeling

Delays and mixing times in random-access networks

Exact analysis of the M/M/k/setup class of Markov chains via recursive renewal reward

Stochastic modeling of large-scale solid-state storage systems

Distributing content simplifies ISP traffic engineering

High-throughput low-latency fine-grained disk logging

Probabilistic optimal tree hopping for RFID identification

A tale of two metrics

Tutorial on geo-replication in data center applications

Challenges in cloud scale data centers

A first look at cellular network performance during crowded events

Online energy generation scheduling for microgrids with intermittent energy sources and co-generation

Root cause detection in a service-oriented architecture

Scheduling of users with markovian time-varying transmission rates

Queueing system topologies with limited flexibility

A mean field model for a class of garbage collection algorithms in flash-based solid state drives

Quantifying the benefits of joint content and network routing

On understanding the energy consumption of ARM-based multicore servers

Multipath TCP algorithms

Accelerating GPGPU architecture simulation

The fundamentals of heavy-tails

Characterizing and modeling the impact of wireless signal strength on smartphone battery drain

Defragmenting the cloud using demand-based resource allocation

The design space of probing algorithms for network-performance measurement

Lingering issues in distributed scheduling

Revisiting widely held SSD expectations and rethinking system-level implications

Reuse-based online models for caches

Profiling and analyzing the I/O performance of NoSQL DBs

Characterizing the impact of process variation on write endurance enhancing techniques for non-volatile memory systems

An empirical analysis of intra- and inter-datacenter network failures for geo-distributed services

Computational analysis of cascading failures in power networks

Data center asset tracking using a mobile robot

Data center demand response

Delivering fairness and priority enforcement on asymmetric multicore systems via OS scheduling

Detecting user dissatisfaction and understanding the underlying reasons

Discriminant malware distance learning on structuralinformation for automated malware classification

Exact convex relaxation for optimal power flow in distribution networks

Exploiting the past to reduce delay in CSMA scheduling

Firming solar power

Greedy name lookup for named data networking

How does energy accounting matter for energy management?

Online load balancing under graph constraints

Parallel scaling properties from a basic block view

Sharp bounds in stochastic network calculus

Stable and scalable universal swarms

Sustainability of service provisioning systems under attack

Temperature aware workload management in geo-distributed datacenters

Tolerating path heterogeneity in multipath TCP with bounded receive buffers

Understanding architectural characteristics of multimedia retrieval workloads

Understanding internet video viewing behavior in the wild

Understanding SMS spam in a large cellular network

Web performance bottlenecks in broadband access networks

Greedy name lookup for named data networking

Content Provider	ACM Digital Library
Author	Tai, Dongzhe Zhang, Ting Lu, Jianyuan Xu, Boyang Liu, Bin Wang, Yi Dai, Huichen
Abstract	Different from the IP-based routers, Named Data Networking routers forward packets by content names, which consist of characters and have variable and unbounded length. This kind of complex name constitution plus the huge-sized name routing table makes wire speed name lookup an extremely challenging task. Greedy name lookup mechanism is proposed to speed up name lookup by dynamically adjusting the search path against the changes of the prefix table. Meanwhile, we elaborate a string-oriented perfect hash table to reduce memory consumption which stores the signature of the key in the entry instead of the key itself. Extensive experimental results on a commodity PC server with 3 million name prefix entries demonstrate that greedy name lookup mechanism achieves 57.14 million searches per second using only 72.95 MB memory.
Starting Page	359
Ending Page	360
Page Count	2
File Format	PDF
ISSN	01635999
DOI	10.1145/2494232.2465741
Journal	ACM SIGMETRICS Performance Evaluation Review (PERV)
Volume Number	41
Issue Number	1
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-01-10
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Name lookup Named data networking Perfect hash table
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Hardware and Architecture Software

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in