• Title/Summary/Keyword: New Address Information

Search Result 686, Processing Time 0.033 seconds

Implementation of Memory Efficient Flash Translation Layer for Open-channel SSDs

  • Oh, Gijun;Ahn, Sungyong
    • International journal of advanced smart convergence
    • /
    • v.10 no.1
    • /
    • pp.142-150
    • /
    • 2021
  • Open-channel SSD is a new type of Solid-State Disk (SSD) that improves the garbage collection overhead and write amplification due to physical constraints of NAND flash memory by exposing the internal structure of the SSD to the host. However, the host-level Flash Translation Layer (FTL) provided for open-channel SSDs in the current Linux kernel consumes host memory excessively because it use page-level mapping table to translate logical address to physical address. Therefore, in this paper, we implemente a selective mapping table loading scheme that loads only a currently required part of the mapping table to the mapping table cache from SSD instead of entire mapping table. In addition, to increase the hit ratio of the mapping table cache, filesystem information and mapping table access history are utilized for cache replacement policy. The proposed scheme is implemented in the host-level FTL of the Linux kernel and evaluated using open-channel SSD emulator. According to the evaluation results, we can achieve 80% of I/O performance using the only 32% of memory usage compared to the previous host-level FTL.

A New ROM Compression Method for Continuous Data (연속된 데이터를 위한 새로운 롬 압축 방식)

  • 양병도;김이섭
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.5
    • /
    • pp.354-360
    • /
    • 2003
  • A new ROM compression method for continuous data is proposed. The ROM compression method is based on two proposed ROM compression algorithms. The first one is a region select ROM compression algorithm that stores only regions including data after dividing data into many small regions by magnitude and address. The second is a quantization ROM and error ROM compression algorithm that divides data into quantized data and their errors. Using these algorithms, 40~60% ROM size reductions aye achieved for various continuous data.

S/W Based Frame-Level Synchronization for Irregular Screen Processing System

  • Shin, IlHong;Lee, Seonghee;Lee, Eunjun;Lee, Nam Kyung;Lee, Hyunwoo
    • ETRI Journal
    • /
    • v.38 no.5
    • /
    • pp.868-878
    • /
    • 2016
  • A multi-screen environment provides a new opportunity for digital signage applications, where various irregularly shaped screens are employed as an effective means for advertisements and information. A formation method applicable to numerous irregularly shaped screens is proposed to provide a new perspective on digital signage applications. The crucial part of the proposed method comes from the geometric sensing of each screen and the formation of a virtual screen where geometrically aligned content extraction and encoding are employed for content transmission to each screen. In addition, a software-based synchronization method for the proposed system is proposed to address the frame-level synchronization between screens. The experimental results of the proposed method show an improved performance of the frame-level synchronization, where the inconsistency between frames is not identified.

A Preliminary Study on the Multiple Mapping Structure of Classification Systems for Heterogeneous Databases

  • Lee, Seok-Hyoung;Kim, Hwan-Min;Choe, Ho-Seop
    • International Journal of Knowledge Content Development & Technology
    • /
    • v.2 no.1
    • /
    • pp.51-65
    • /
    • 2012
  • While science and technology information service portals and heterogeneous databases produced in Korea and other countries are integrated, methods of connecting the unique classification systems applied to each database have been studied. Results of technologists' research, such as, journal articles, patent specifications, and research reports, are organically related to each other. In this case, if the most basic and meaningful classification systems are not connected, it is difficult to achieve interoperability of the information and thus not easy to implement meaningful science technology information services through information convergence. This study aims to address the aforementioned issue by analyzing mapping systems between classification systems in order to design a structure to connect a variety of classification systems used in the academic information database of the Korea Institute of Science and Technology Information, which provides science and technology information portal service. This study also aims to design a mapping system for the classification systems to be applied to actual science and technology information services and information management systems.

DDoS Defense using Address Prefix-based Priority Service (Address Prefix에 기반한 우선 순위 서비스를 이용한 DDoS 방어)

  • Jin, Jinghe;Lee, Tai-Jin;Nam, Seung-Yeob
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.4
    • /
    • pp.207-217
    • /
    • 2009
  • We propose a two-stage Distributed Denial of Service (DDoS) defense system, which can protect a given subnet by serving existing flows and new flows with a different priority based on IP history information. Denial of Service (DoS) usually occurs when the resource of a network node or link is limited and the demand of the users for that resource exceeds the capacity. The objective of the proposed defense system is to provide continued service to existing flows even in the presence of DDoS attacks. The proposed scheme can protect existing connections effectively with a smaller memory size by reducing the monitored IP address set through sampling and per-prefix history management. We evaluate the performance of the proposed scheme through simulation.

The Analysis of Parcels for Land Alternation in Jinan-Gun jeollabuk-Do based on GIS (GIS 기반 전라북도 진안군의 토지이동 필지 분석)

  • Lee, Geun Sang;Park, Jong Ahn;Cho, Gi Sung
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.22 no.1
    • /
    • pp.3-12
    • /
    • 2014
  • Cadastre is a set of activity registering diverse land information in national scope land management works. A nation examine land information and register it in a cadastral book, and must update data when necessary to properly maintain the information. Currently, local governments execute work about parcels of land alternation by manual work based on KLIS road map. Therefore, it takes too much time-consuming and makes problem as missing lots of parcels of land alternation. This study suggests the method selecting the parcels of land alteration for Jinan-Gun of Jeollabuk-Do using the GIS spatial overlay and the following results are as belows. Firstly, the manual work on the parcels of land alteration was greatly improved through automatically extracting the number and area of parcels according to the land classification and ownership by GIS spatial overlay based on serial cadastral maps and KLIS road lines. Secondly, existing work based on KLIS road lines could be advanced by analyzing the parcels of land alternation using the actual-width of the road from new address system to consider all road area for study site. Lastly, this study can supply efficient information in determining the parcels of land alternation consistant with road condition of local governments by analyzing the number and area of parcels according to the land classification and ownership within various roadsides ranging from 3m, 5m, and 10m by GIS buffering method.

Proposed measure for Smart Grid's Personal Information Security Issue (스마트 그리드 개인정보 보안이슈 방안 제시)

  • Choi, Heesik;Cho, Yanghyun
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.12 no.4
    • /
    • pp.41-49
    • /
    • 2016
  • Smart Grid is a next generation of new power growth electrical grid which provide high quality of electrical service by using Information Technologies to increase intelligence and performance. By using Smart Grid system, it can support energy management such as increase quality of electrical power, decrease energy and decrease emissions. However, Smart Grid uses information of energy consumption and when Smart Grid collects information, it will create private information. In this thesis, it will address issues of security private information which caused by Smart Grid for administrative measure and efficiency of Smart Grid in domestic. Also, cryptographic module algorithm, latest security solutions and strong wireless security policy for network environment such as wireless communication Iinternet are require for Smart Grid perform successfully and protect national power network equipment from cyber-attack and can stop leakage of user's personal information. Finally, it is urgent to prepare protection measures of National industrial facilities and power grid which can prepare for a cyber terrorism and penetration attacks and build emergency countermeasure management team for Smart Grid are require for safe Smart Grid environment.

Enhanced Robust Cooperative Spectrum Sensing in Cognitive Radio

  • Zhu, Feng;Seo, Seung-Woo
    • Journal of Communications and Networks
    • /
    • v.11 no.2
    • /
    • pp.122-133
    • /
    • 2009
  • As wireless spectrum resources become more scarce while some portions of frequency bands suffer from low utilization, the design of cognitive radio (CR) has recently been urged, which allows opportunistic usage of licensed bands for secondary users without interference with primary users. Spectrum sensing is fundamental for a secondary user to find a specific available spectrum hole. Cooperative spectrum sensing is more accurate and more widely used since it obtains helpful reports from nodes in different locations. However, if some nodes are compromised and report false sensing data to the fusion center on purpose, the accuracy of decisions made by the fusion center can be heavily impaired. Weighted sequential probability ratio test (WSPRT), based on a credit evaluation system to restrict damage caused by malicious nodes, was proposed to address such a spectrum sensing data falsification (SSDF) attack at the price of introducing four times more sampling numbers. In this paper, we propose two new schemes, named enhanced weighted sequential probability ratio test (EWSPRT) and enhanced weighted sequential zero/one test (EWSZOT), which are robust against SSDF attack. By incorporating a new weight module and a new test module, both schemes have much less sampling numbers than WSPRT. Simulation results show that when holding comparable error rates, the numbers of EWSPRT and EWSZOT are 40% and 75% lower than WSPRT, respectively. We also provide theoretical analysis models to support the performance improvement estimates of the new schemes.

Uncertainty Improvement of Incomplete Decision System using Bayesian Conditional Information Entropy (베이지언 정보엔트로피에 의한 불완전 의사결정 시스템의 불확실성 향상)

  • Choi, Gyoo-Seok;Park, In-Kyu
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.6
    • /
    • pp.47-54
    • /
    • 2014
  • Based on the indiscernible relation of rough set, the inevitability of superposition and inconsistency of data makes the reduction of attributes very important in information system. Rough set has difficulty in the difference of attribute reduction between consistent and inconsistent information system. In this paper, we propose the new uncertainty measure and attribute reduction algorithm by Bayesian posterior probability for correlation analysis between condition and decision attributes. We compare the proposed method and the conditional information entropy to address the uncertainty of inconsistent information system. As the result, our method has more accuracy than conditional information entropy in dealing with uncertainty via mutual information of condition and decision attributes of information system.

Longest First Binary Search on Prefix Length for IP Address Lookup (최장 길이 우선 검색에 기초한 프리픽스 길이에 따른 이진 IP 검색 구조)

  • Chu Ha-Neul;Lim Hye-Sook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.8B
    • /
    • pp.691-700
    • /
    • 2006
  • Based on the destination IP address of incoming packets, the Internet routers determine next hops and forward packets toward final destinations through If address lookup. The bandwidth of communication links increases exponentially fast as well as the routing table size grows significant as the number of single host networks attached to the Internet increases. Since packets should be processed at wire-speed, the increased link speed reduces the processing time of a packet in routers, and hence more efficient and fast IP address lookup algorithms and architectures are required in the next generation routers. Most of the previous IP lookup schemes compare routing prefixes of shorter length first with a given input IP address. Since IP address lookup needs to find the most specific route of the given input, search continues until the longest matched prefix is found while it keeps remembering the current test matching prefix. In this paper, based on binary search on prefix length, we proposed a new IP address lookup algorithm which compares longer prefixes first. The proposed scheme is consisted of multiple tries with prefixes on leaves only. The trie composed of the longest prefixes is primarily searched whether there is a match with the given input. This processing is repeated for the trio of the next longer prefixes until there finds a match. Hence the proposed algorithm provides the fast search speed. The proposed algorithm also provides the incremental update of prefixes while the previous binary search on length scheme does not provide the incremental update because of pre-processing requirement. In this paper, we performed extensive simulations and showed the performance comparisons with related works.