94,622 Hits in 2.8 sec

Generic Component Lookup [chapter]

Till G. Bay, Patrick Eugster, Manuel Oriol
2006 Lecture Notes in Computer Science  
fundamentals of component lookup.  ...  We propose a generic model of component lookup -applicable to settings as diverse as tagged sets, classic white pages, or even method dispatch -and its implementation.  ...  We propose a generic model of multiple specifications component lookup based on mathematical formulae, called COLOS (generic COmponent LOokup based on Specification matching).  ... 
doi:10.1007/11783565_13 fatcat:r5igshyspfeqjgiqfl7chvml6m

NDNBench: A benchmark for Named Data Networking lookup

Ting Zhang, Yi Wang, Tong Yang, Jianyuan Lu, Bin Liu
2013 2013 IEEE Global Communications Conference (GLOBECOM)  
NDNBench can generate various Forwarding Information Bases (FIBs), traces with structure and size diversity to conduct the tests thoroughly by adjusting the parameters.  ...  , comparison and experiments with different name lookup approaches.  ...  For component-based approaches, components are the atomic lookup unit.  ... 
doi:10.1109/glocom.2013.6831393 dblp:conf/globecom/ZhangWYLL13 fatcat:mcesuc64bfe6vf5ax5ospibnde

Achieving Efficient Pathname LOOKUP in File Server Group

Feng-jung Liu, Chu-sing Yang, Yao-kuei Lee
2006 Proceedings of the 9th Joint Conference on Information Sciences (JCIS)  
In this paper, we leveraged the concept of intermediate file handle to cover the heterogeneity of file system and designed a mechanism, named Multi-component LOOKUP to solve the inefficiency problem of  ...  full pathname LOOKUP, to reduce the number of RPC requests going across the network and to allow a client to resolve a full path name in one operation.  ...  For instance, on evaluation of the path "a/b/c", the system will generate separate LOOKUP requests for each component of the pathname "a", "b", and "c".  ... 
doi:10.2991/jcis.2006.9 dblp:conf/jcis/LiuYL06 fatcat:stuivt7xnvedfo3zvkzjkrlqje

Stage Lookup: Accelerating Path Lookup using Directory Shortcuts [article]

Yanliang Zou, Tongliang Deng, Jian Zhang, Chen Chen, Shu Yin
2020 arXiv   pre-print
The lookup procedure in Linux costs a significant portion of file accessing time as the virtual file system (VFS) traverses the file path components one after another.  ...  We propose Stage Lookup, which dynamically caches popular directories to speed up lookup procedures and further reduce file accessing latency.  ...  We generate a six-level directory tree owning 10,000+ nodes.  ... 
arXiv:2010.08741v1 fatcat:cgmp5kezbnculgnaitgeymagcm

GPU-accelerated name lookup with component encoding

Yi Wang, Huichen Dai, Ting Zhang, Wei Meng, Jindou Fan, Bin Liu
2013 Computer Networks  
In pursuit of overcoming this challenge, we propose a Name Component Encoding (NCE) solution that assigns codes (integers) to name components.  ...  lookup throughout while reducing lookup latency.  ...  We generate two types of name traces, simulating average lookup workload and heavy lookup workload, respectively. Each name trace contains 200M names.  ... 
doi:10.1016/j.comnet.2013.07.006 fatcat:53jpcur7jba45bqjsoefdruoiq

Distributed resource directory architecture in Machine-to-Machine communications

Meirong Liu, Teemu Leppanen, Erkki Harjula, Zhonghong Ou, Archana Ramalingam, Mika Ylianttila, Timo Ojala
2013 2013 IEEE 9th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)  
The DRD4M introduces two components: a resource registration component for registering resources and a resource lookup component with caching functionality for handling resource lookup with filtering.  ...  Preliminary performance evaluation in terms of response time of resource lookup is provided.  ...  Meanwhile, the handlers generate and send responses back to requesting devices after getting results from resource registration component or resource lookup component. B.  ... 
doi:10.1109/wimob.2013.6673379 dblp:conf/wimob/LiuLHORYO13 fatcat:zjiscq4kkvfztbzndz6wxpj2vq

Named data networking on a router: Fast and DoS-resistant forwarding with hash tables

Won So, Ashok Narayanan, David Oran
2013 Architectures for Networking and Communications Systems  
Our forwarding engine features (1) name lookup via hash tables with fast collision-resistant hash computation, (2) an efficient FIB lookup algorithm that provides good average and bounded worstcase FIB  ...  lookup time, (3) PIT partitioning that enables linear multicore speedup, and (4) an optimized data structure and software prefetching to maximize data cache utilization.  ...  The forwarding decision is made based on either an exact-match or componentized longest prefix match (LPM) of the name against a set of tables (discussed below).  ... 
doi:10.1109/ancs.2013.6665203 dblp:conf/ancs/SoNO13 fatcat:cuymsgphdfcynpa3owfhko5ima

Enhancing NetBeans with Transparent Fault Tolerance Using Meta-Level Architecture

Martin Rytter, Bo Nørregaard Jørgensen
2010 Journal of Object Technology  
In component-based systems, fault-tolerance concerns are typically handled by manually programmed fault containers.  ...  However, manually programmed fault containers are often subject to evolutionary pressure when components change.  ...  To achieve transparent sharing, a lookup service can allow client components and provider components to enter and leave the system without generating evolutionary pressure.  ... 
doi:10.5381/jot.2010.9.5.a3 fatcat:veyfsv72hvgjjmmhyl4addlu3u

Steerable Name Lookup based on Classified Prefixes and Scalable One Memory Access Bloom Filter for Named Data Networking

Sheng Huang, Jianghua Xu, Xiaofei Yang, Zhen Wu, Cuicui Niu
2016 International Journal of Future Generation Communication and Networking  
One memory access Bloom filter and scalable Bloom filter are combined to solve scalability of name lookup engine and speed up name lookup.  ...  Then prefixes with different length and component numbers are mapped into different Bloom filter. In order to reduce unnecessary probes, we design the number of component steerable structure (NCS).  ...  Two types of name traces, average and heavy workload, are generated to measure the lookup performance that are used to simulate name lookup under average and heavy workload.  ... 
doi:10.14257/ijfgcn.2016.9.7.09 fatcat:pwhi775wmrgivoni3642i4v2sq

Several Methods for Constructing White-box Solutions

Tingting Lin, Hailun Yan, Xuejia Lai, Weidong Qiu
2019 Journal of Physics, Conference Series  
Our introduction covers almost all the general methods for constructing white-box solutions and aims at presenting a full overview of white-box designs.  ...  Use the same linear transformations to encode the masks and generate new lookup tables. Such lookup tables will be used to annihilate the masks in the end.  ...  Figure 3 . 3 Replace standard components with customized components In general, several steps are required in order to apply this method to design new white-box cryptographic schemes:Develop substitution  ... 
doi:10.1088/1742-6596/1288/1/012005 fatcat:i5c5pyz53vezhbgdgm6vdje6ou

Efficient data ingestion and query processing for LSM-based storage systems

Chen Luo, Michael J. Carey
2019 Proceedings of the VLDB Endowment  
We first propose and evaluate a series of optimizations for efficient batched point lookups, significantly improving the range of applicability of LSM-based secondary indexes.  ...  Section 3 presents a general architecture for LSM-based storage systems and introduces various optimizations for efficient point lookups.  ...  In general, two types of merge policies are used in practice [16, 17] , both of which organize components into "levels".  ... 
doi:10.14778/3303753.3303759 fatcat:qv4s5o7rsnfqxikvwrtgf7nw6y

Name Lookup in Named Data Networking: A Review

Al-qutwani Majed, Xingwei Wang, Bo Yi
2019 Information  
Furthermore, name lookup approaches were analyzed and compared in a novel manner.  ...  NDN requires per-packet update that is preceded by a one-name lookup operation, which results in heavy time processing.  ...  When an NDN packet arrives at the PIT, each of its name components is obtained and assigned a code generated through NCE.  ... 
doi:10.3390/info10030085 fatcat:s7kub6iyvfbhbg4l5dpd65koja

An Entropy-Based Approach: Compressing Names for NDN Lookup

Tianyuan Niu, Fan Yang.
2021 IEEE Access  
Especially for DOS-resistant lookup algorithm, when the component number of an inserted name is larger than existing ones inside the hash table, or a virtual prefix needs to be generated, the size of the  ...  In general, Our design can keep the delay of one lookup operation relatively low and vary gently as the size of the dataset grows.  ... 
doi:10.1109/access.2021.3101578 fatcat:oyl66u7plre5lnrsktu57yhy2i

Efficient Data Ingestion and Query Processing for LSM-Based Storage Systems [article]

Chen Luo, Michael J. Carey
2019 arXiv   pre-print
In this paper, we focus on efficient data ingestion and query processing for general-purpose LSM-based storage systems.  ...  We first propose and evaluate a series of optimizations for efficient batched point lookups, significantly improving the range of applicability of LSM-based secondary indexes.  ...  Section 3 presents a general architecture for LSM-based storage systems and introduces various optimizations for efficient point lookups.  ... 
arXiv:1808.08896v2 fatcat:l676rpnkmnhz3baq6x5j3wwilm

An Efficient Non-blocking Data Cache for Soft Processors

Kaveh Aasaraai, Andreas Moshovos
2010 2010 International Conference on Reconfigurable Computing and FPGAs  
Bus The Bus component is responsible for servicing the bus requests generated by Request.  ...  . • For non-cacheable requests and cache misses, Lookup triggers the Request component to generate appropriate requests. In addition, queues the instruction metadata in the Metadata storage.  ... 
doi:10.1109/reconfig.2010.61 dblp:conf/reconfig/AasaraaiM10 fatcat:ncuyaices5f57gppl7fum3jelq
« Previous Showing results 1 — 15 out of 94,622 results