• Title/Summary/Keyword: 단편화

Search Result 307, Processing Time 0.025 seconds

Performance Evaluation of Cryptographic Algorithms for the 6LoWPAN with Packet Fragmentations (6LoWPAN 단편화 패킷 재전송에 따른 암호화 알고리즘 성능 분석)

  • Kim, Hyun-Gon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.8
    • /
    • pp.77-84
    • /
    • 2011
  • In this paper we implement a 6LoWPAN protocol on the MICAz sensor platform, which could minimize packet re-transmission, and support security primitives for packet integrity and confidentiality. And we also present a performance evaluation of the implemented protocol calculated according to the cryptographic algorithms. In the re-transmission method, time stamp, nonce, and checksum are considered to protect replay attacks. As cryptographic algorithms, AES, 3DES, SHA2, and SHA1 are implemented. If transmission errors (thus, packet losses) and the number of hops are increase then, packet re-transmissions are increase exponentially from the experimental results. Also, the result shows that cryptographic operations take more time than packet re-transmission time.

Landscape Analysis of the Hallasan National Park in a Jeju Island Biosphere Reserve: Fragmentation Pattern (제주 생물권보전지역 내 한라산국립공원의 경관분석 : 단편화 현상)

  • Kang, Hye-Soon;Kim, Hyun-Jung;Chang, Eun-Mi
    • Korean Journal of Environment and Ecology
    • /
    • v.22 no.3
    • /
    • pp.309-319
    • /
    • 2008
  • Roads are an indicator of anthropogenic activity causing ecosystem disturbances and often lead to habitat fragmentation, habitat loss, and habitat isolation. The Hallasan National Park(153.4$km^2$) on Jeju Island being distinguished for its unique geology, topography, and biota has also been designated as a core area of UNESCO Man and the Biosphere(MAB) Reserve. Although the high conservation value of this park has contributed to a rapid growth of tourists and road construction, landscape changes due to roads have not been examined yet. We used GIS systems to examine the fragmentation pattern caused by roads, in relation to its zonation, elevation, and vegetation. When a buffer was applied to roads(112m width for paved roads and 60m width for both legal and illegal trails), the park consisted of 100 fragments. The ten fragments generated after applying buffer to only paved roads and legal trails ranged from $0.002km^2$ to $38.2km^2$ with a mean of $14.2km^2$, and about 7% of both nature conservation zone and nature environment zone of the park were edge. Fragments in both east and west ends of the park and around the summit exhibited relatively high shape indices with means of 5.19(for 100 fragments) and 7.22(for 10 fragments). All five legal trails are connected to the pit crater of the mountain and vegetation changed from broadleaf forests and conifer forests to grasslands with elevation, consequently resulting in dramatic fragment size reduction in grasslands at high elevation, in particular above 1,400m, where endemic and alpine plants are abundant. These results show that in Hallasan National Park the risks of habitat deterioration and habitat loss due to fragmentation may be more severe in the nature conservation zone dominated by Baengnokdam than in the nature environment zone. Therefore, current road networks of the park appear to fall short of the goal of the national park for ecosystem conservation and protection. Considering that the entire Hallasan National Park also serves as a MAB core area, conservation efforts should focus, first of all, on park rezoning and road management to mitigate habitat fragmentation.

Development of an XML Converter using Document Fragmentation Method (문서 단편화 기법을 이용한 XML 변환기의 설계 및 구현)

  • 정창후;최윤수;주원균;진두석;김광영;이민호;서정현
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10b
    • /
    • pp.214-216
    • /
    • 2004
  • 최근 다양한 응용 분야에서 점차 증가하고 있는 XML 문서에 대한 효과적 검색을 위해서 많은 검색 시스템들이 제안되고 있다. 그러나 이러한 검색 시스템은 XML 문서의 구조적 특성을 명확하게 알지 못하거나 질의어 작성에 익숙하지 못한 사용자에게 XML 문서를 검색하는데 많은 어려움을 주고 있다. 이러한 문제를 해결하기 위해 본 논문은 복잡한 계층의 XML 문서를 의미 있는 엘리먼트를 중심으로 계층을 단순화시켜서 검색에 이용할 수 있도록 도와주는 XML 문서 변환기를 제안한다. XML 문서 변환기는 XML 문서의 부모-자식 관계, 형제 관계 등의 계층 정보를 유지하면서 문서를 단편화 시켜주는 도구이다. XML 문서 변환기와 더불어 이것을 이용하여 구현된 XML 문서 검색 시스템의 계층적 출력 인터페이스에 대하여 함께 설명하도록 한다.

  • PDF

Secure Fragmentation Technique for Content-Centric Networking (콘텐츠 중심 네트워크를 위한 안전한 패킷 단편화 기술)

  • Hyun, Sangwon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.27 no.4
    • /
    • pp.831-841
    • /
    • 2017
  • This paper presents a secure and DoS-resistant fragment authentication technique for Content-Centric Networking (CCN). Our approach not only guarantees the authenticity of each fragment, but also provides a high resistance to DoS attacks through the immediate verification of fragment authenticity at interim nodes on the routing path. Our experimental results demonstrate that the proposed approach provides much stronger security than the existing approach, without imposing a significant overhead.

Efficient Submesh Allocation Using Improved QA Algorithm (개선된 QA 알고리즘을 이용한 효율적인 서브메쉬 할당)

  • 강영욱;이재도;양승복
    • Journal of the Korea Society of Computer and Information
    • /
    • v.3 no.1
    • /
    • pp.1-12
    • /
    • 1998
  • In 2D(two-dimensional) mesh system, an efficient submesh allocation scheme must have low time overhead for allocation and low response times for incoming tasks. Quick Allocation(QA) reduces submesh allocation time, but can cause high external fragmentation. Due to this, response times for incoming tasks increase. In this paper, we have improved QA to diminish external fragmentation while having not nearly effect on allocation time. Simulation revealed that modified algorithm reduces to some extent the mean response time of the tasks compared to QA.

  • PDF

Java Garbage Collection in CLDC (CLDC에서 자바 가비지 콜렉션)

  • Kwon, He-Eun;Kim, Sang-Hoon
    • The Journal of Information Technology
    • /
    • v.5 no.2
    • /
    • pp.27-34
    • /
    • 2002
  • The KVM garbage collector implemented in CLDC was generally based on the simple mark-sweep algorithm, but it is difficult to handle objects of varying size without fragmentation of the available memory. In this paper, we have designed and implemented a memory allocator based on the mark-sweep algorithm that minimizes the fragmentation by the method that determines the allocation position of free-space list according to object size. The experimental result shows that our algorithm reduce the fragmentation and improve the execution time than the existing algorithm.

  • PDF

De-fragmentation Scheme Exploiting Merge Operation in Flash Memory-based File System (플래시 메모리 기반 파일 시스템에서 병합동작을 이용한 조각 모음 기법)

  • Hyun, Choul-Seung;Lee, Dong-Hee
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06b
    • /
    • pp.377-380
    • /
    • 2007
  • 플래시 메모리는 무게, 내구성, 전력 소비량 측면에서 기존 디스크보다 우수하기 때문에 주로 휴대용 기기의 저장장치로 사용되었다. 최근에는 집적도가 향상되면서 SSD(Solid State Disk)형태로 노트북에서도 활용되고 있다. 이러한 플래시 메모리는 제자리 갱신이 불가능한 특징 때문에 저장장치로 사용하기 위해서는 FTL(Flash Memory Translation Layer)이라는 주소사상 소프트웨어가 필요하다. 그리고 FTL은 블록을 재활용하기 위해 병합 연산을 수행하게 되는데 이 병합 연산의 비용이 시스템 성능에 큰 영향을 미친다. 아울러 FTL 상에서 동작하는 파일 시스템의 경우도 디스크 기반 파일 시스템과 같이 단편화 문제로 인한 성능 저하가 발생하게 된다. 본 논문에서는 플래시 메모리 기반 파일 시스템에서 단편화 현상을 줄이기 위해 FTL의 병합동작의 특성을 활용한 조각 모음 기법을 제안한다. 실험결과는 제안한 기법이 결국 FTL에서 병합 연산의 비용을 줄임으로써 성능을 향상시킬 수 있음을 보여준다.

  • PDF

Reverse engineering of data abstractions on fragmented binary code (단편화된 실행파일을 위한 데이터 구조 역공학 기법)

  • Lee, Jong-Hyup
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.22 no.3
    • /
    • pp.615-619
    • /
    • 2012
  • Reverse engineering via static analysis is an essential step in software security and it focuses on reconstructing code structures and data abstractions. In particular, reverse engineering of data abstractions is critical to understand software but the previous scheme, VSA, is not suitable for applying to fragmented binaries. This paper proposes an enhanced method through dynamic region assignment.

A Study of Verification Methods for File Carving Tools by Scenario-Based Image Creation (시나리오 기반 이미지 개발을 통한 파일 카빙 도구 검증 방안 연구)

  • Kim, Haeni;Kim, Jaeuk;Kwon, Taekyoung
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.29 no.4
    • /
    • pp.835-845
    • /
    • 2019
  • File Carving is a technique for attempting to recover a file without metadata, such as a formated storage media or a damaged file system, and generally looks for a specific header / footer signature and data structure of the file. However, file carving is faced with the problem of recovering fragmented files for a long time, and it is very important to propose a solution for digital forensics because important files are relatively fragmented. To overcome these limitations, various carving techniques and tools are continuously being developed, and data sets from various researches and institutions are provided for functional verification. However, existing data sets are ineffective in verifying tools because of their limited environmental conditions. Therefore, this paper refers to the importance of fragmented file carving and develops 16 images for carving tool verification based on scenarios. The developed images' carving rate and accuracy of each media is shown through Foremost which is well known as a commercial carving tool.