scholarly journals Research on Multicore Key-Value Storage System for Domain Name Storage

2021 ◽  
Vol 11 (16) ◽  
pp. 7425
Author(s):  
Luchao Han ◽  
Zhichuan Guo ◽  
Xuewen Zeng
Keyword(s):  
Data Structures ◽  
Network Traffic ◽  
Storage System ◽  
Experimental Results ◽  
Domain Name ◽  
Hit Rate ◽  
Replacement Algorithm ◽  
Multiple Cores ◽  
Data Structures And Algorithms ◽  
Deployment Cost

This article proposes a domain name caching method for the multicore network-traffic capture system, which significantly improves insert latency, throughput and hit rate. The caching method is composed of caching replacement algorithm, cache set method. The method is easy to implement, low in deployment cost, and suitable for various multicore caching systems. Moreover, it can reduce the use of locks by changing data structures and algorithms. Experimental results show that compared with other caching system, our proposed method reaches the highest throughput under multiple cores, which indicates that the cache method we proposed is best suited for domain name caching.

scholarly journals Improving Security of Future Networks Using Enhanced Customer Edge Switching and Risk-Based Analysis

Electronics ◽  
2021 ◽  
Vol 10 (9) ◽  
pp. 1107
Author(s):  
Slawomir Nowaczewski ◽  
Wojciech Mazurczyk
Keyword(s):  
Network Traffic ◽  
Information Exchange ◽  
Experimental Results ◽  
It Impacts ◽  
Future Networks

Customer Edge Switching (CES) is an extension of the already known classical firewall that is often described and used in future networks like 5G. It extends its functionality by enabling information exchange with other firewalls to decide whether the inspected network traffic should be considered malicious or legitimate. In this paper, we show how the Passive DNS can be used to further improve security of this solution. First, we discuss CES solution and its internals. We also determine how it uses DNS and CETP protocols. Secondly, we describe the basics of the Passive DNS and how it impacts the DNS protocol. Thirdly, we evaluate how the Passive DNS can be extended to collect also CETP information. Finally, we integrate the solutions and present obtained experimental results.

Optimal Order Picking in Carousels Storage System

2012 ◽  
Vol 601 ◽  
pp. 347-353
Author(s):  
Xiong Zhi Wang ◽  
Guo Qing Wang
Keyword(s):  
Approximation Algorithm ◽  
General Problem ◽  
Storage System ◽  
Order Picking ◽  
Total Order ◽  
Experimental Results ◽  
Optimal Order ◽  
Np Hard ◽  
Special Case

We study the order picking problem in carousels system with a single picker. The objective is to find a picking scheduling to minimizing the total order picking time. After showing the problem being strongly in NP-Hard and finding two characteristics, we construct an approximation algorithm for a special case (two carousels) and a heuristics for the general problem. Experimental results verify that the solutions are quickly and steadily achieved and show its better performance.

scholarly journals A ZVS Bidirectional Inverting Buck-Boost Converter Using Coupled Inductors

Electronics ◽  
2018 ◽  
Vol 7 (10) ◽  
pp. 221 ◽  
Author(s):  
Xu-Feng Cheng ◽  
Yong Zhang ◽  
Chengliang Yin
Keyword(s):  
Storage System ◽  
Core Loss ◽  
Current Mode ◽  
Energy Storage System ◽  
Boost Converter ◽  
Experimental Results ◽  
Switching Loss ◽  
Zero Voltage Switching ◽  
Coupled Inductors ◽  
Light Load

The bidirectional inverting buck-boost converter (BIBBC) has a simple structure and a wide voltage ratio. It can be used in the battery supercapacitor hybrid energy storage system (BSHESS) and the motor drive system. However, the traditional continuous conduction mode (CCM) BIBBC will have severe switching loss. The triangular current mode (TCM) BIBBC can reduce the switching loss, but it will increase core loss and filter capacitance. To solve these problems, this paper proposes a new zero voltage switching (ZVS) BIBBC using a coupled inductor. This ZVS BIBBC will provide ZVS conditions for both transistors whether in positive operation or negative operation. Meanwhile, this ZVS BIBBC has small core losses and filter capacitance, and can be used simply. Finally, experimental results obtained from these BIBBC experimental prototypes are presented to validate the soft-switching achieving and the efficiency improvement performance. Experimental results show that both transistors of the ZVS BIBBC achieve ZVS turn-on conditions. The efficiency of the ZVS BIBBC increased by up to 10 percent compared to the traditional CCM BIBBC at heave load, and by up to 1.5 percent compared to the TCM BIBBC at a light load.

Reparo: A Fast RAID Recovery Scheme for Ultra-large SSDs

2021 ◽  
Vol 17 (3) ◽  
pp. 1-24
Author(s):  
Duwon Hong ◽  
Keonsoo Ha ◽  
Minseok Ko ◽  
Myoungjun Chun ◽  
Yoona Kim ◽  
...  
Keyword(s):  
Storage Systems ◽  
Storage System ◽  
Experimental Results ◽  
Huge Amount ◽  
Failure Characteristics ◽  
System A ◽  
Recovery Scheme ◽  
Cost Efficient ◽  
Recovery Schemes ◽  
Multi Core Processor

A recent ultra-large SSD (e.g., a 32-TB SSD) provides many benefits in building cost-efficient enterprise storage systems. Owing to its large capacity, however, when such SSDs fail in a RAID storage system, a long rebuild overhead is inevitable for RAID reconstruction that requires a huge amount of data copies among SSDs. Motivated by modern SSD failure characteristics, we propose a new recovery scheme, called reparo , for a RAID storage system with ultra-large SSDs. Unlike existing RAID recovery schemes, reparo repairs a failed SSD at the NAND die granularity without replacing it with a new SSD, thus avoiding most of the inter-SSD data copies during a RAID recovery step. When a NAND die of an SSD fails, reparo exploits a multi-core processor of the SSD controller in identifying failed LBAs from the failed NAND die and recovering data from the failed LBAs. Furthermore, reparo ensures no negative post-recovery impact on the performance and lifetime of the repaired SSD. Experimental results using 32-TB enterprise SSDs show that reparo can recover from a NAND die failure about 57 times faster than the existing rebuild method while little degradation on the SSD performance and lifetime is observed after recovery.

Minkowski Operators and Features of Voxel Models

1999 ◽  
Author(s):  
V. Chandru ◽  
M. Manivannan ◽  
S. Manohar
Keyword(s):  
Data Structures ◽  
Structural Information ◽  
Prototype System ◽  
Cad Systems ◽  
Feature Based ◽  
Data Structures And Algorithms ◽  
Feature Based Design ◽  
Traditional Representation

Abstract Feature-based design has evolved as a fundamental paradigm for present-day CAD systems. Voxel-based modeling has many advantages over traditional representation schemes but lacks structural information which is lost in voxelization of the objects. In this paper, we propose to augment voxel models with features by a) storing the sequence of modeling operations along with voxel models and b) by defining feature operators. We have implemented these ideas in our prototype system Sirpi as regularised Minkowski operators using simple data structures and algorithms.

Sign in / Sign up

Export Citation Format

Share Document