• Title/Summary/Keyword: 호스트 컴퓨터

Search Result 303, Processing Time 0.03 seconds

Design of A Cross Working Mechanism for Hierarchical Security Policy (계층적 보안 정책에서의 Cross 연동 메커니즘)

  • 이지인;엄남경;이상호
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.04a
    • /
    • pp.787-789
    • /
    • 2001
  • 인터넷은 전세계를 대상으로 구축된 네트워크로서 개방형 구조의 프로토콜을 사용하므로 대부분의 호스트 컴퓨터 시스템들은 정보보안에 취약한 상태이다. 이와 같은 보안 취약성으로 인해 상용화 서비스에 대한 교환 정보의 수정, 검색, 파괴 등의 역기능이 발생하고 있다. 이 논문에서는 기존의 보안 방식 정책으로는 인터넷 보안의 역기능에 대한 완벽한 대책이 될 수 없으므로 이에 따른 보안정책 크로스 연동 메커니즘을 설계하여, 기존의 방식과 비교 분석해서 앞으로의 차세대 인터넷에 적합한 연동메커니즘을 제안하고자 한다.

  • PDF

Extracting Symbol Informations from PDF4172-Dimensional Barcode Image (PDF417 이차원 바코드 명상에서 심볼 정보를 추출하는 알고리즘의 구현)

  • 한희일;정정구
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2001.06a
    • /
    • pp.347-350
    • /
    • 2001
  • 종래에 사용되어 왔던 1 차원 바코드가 정보를 포함하고 있는 데이터베이스에 접근하는 데이터 키 역할을 주로 해온 것에 비해, 2 차원 바코드는 다량의 데이터를 포함할 수 있고 고밀도의 데이터 표현이 가능하여, 호스트 컴퓨터의 데이터 베이스에 온라인 연결할 필요 없이 확인하고자 하는 사람이나 대상물에 대한 정보를 얻을 수 있다. 본 논문에서는 가장 널리 사용되는 2 차원 바코드 체계인 PDF417 을 중심으로, 디지털 카메라를 통하며 입력한 영상을 이진화하여 시작 심볼 또는 정지 심볼을 검색함으로써 2 차원 바코드 영역을 추출한 다음, 추출된 영역으로부터 바코드의 행과 열의 수, 오류수정 정도 등의 헤더정보를 검출하고 이를 바탕으로 코드정보를 추출하는 알고리즘을 제안한다.

  • PDF

A Development of Information System Using Zigbee (Zigbee를 이용한 정보시스템 구축)

  • Ha, Kyeoung-Ju;Ku, Kyomin;Hwa, Lee Young
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.04a
    • /
    • pp.1222-1225
    • /
    • 2009
  • 본 연구개발은 ZigBee 리더기와 단말기 사이의 통신 프로토콜을 설정, ZigBee 단말기에서 전송하는 데이터를 호스트에서 수집/가공/처리할 수 있는 정보시스템을 설계하고 구축하는 것을 목표로 한다.

A Performance Analysis of the Virtual CellSystem for Mobile Hosts (이동 호스트를 위한 가상 셀 시스템의 성능 분석)

  • Lim, Kyung-Shik
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.10
    • /
    • pp.2627-2640
    • /
    • 1998
  • In this paper, we analyze the performance of the virtual cell system[1] for the transmission of IP datagrams in mobile computer communications. A virtual cell consistsof a group of physical cells shose base stationsl are implemented b recote bridges and interconnected via high speed datagram packet switched networks. Host mobility is supported at the data link layer using the distributed hierachical location information of mobile hosts. Given mobility and communication ptems among physical cells, the problem of deploying virtual cells is equivalent to the optimization cost for the entire system where interclster communication is more expesive than intracluster communication[2]. Once an iptimal partitionof disjoint clusters is obtained, we deploy the virtual cell system according to the topology of the optimal partition such that each virtual cell correspods to a cluser. To analyze the performance of the virtual cell system, we adopt a BCMP open multipel class queueing network model. In addition to mobility and communication patterns, among physical cells, the topology of the virtual cell system is used to determine service transition probabilities of the queueing network model. With various system parameters, we conduct interesting sensitivity analyses to determine network design tradeoffs. The first application of the proposed model is to determine an adequate network bandwidth for base station networking such that the networks would not become an bottleneck. We also evaluate the network vlilization and system response time due to various types of messages. For instance, when the mobile hosts begin moving fast, the migration rate will be increased. This results of the performance analysis provide a good evidence in demonsratc the sysem effciency under different assumptions of mobility and communication patterns.

  • PDF

Broadcasting and Caching Schemes for Location-dependent Queries in Urban Areas (도심환경에서 위치의존 질의를 위한 방송과 캐싱 기법)

  • Jung Il-dong;Yu Young-ho;Lee Jong-hwan;Kim Kyongsok
    • Journal of KIISE:Databases
    • /
    • v.32 no.1
    • /
    • pp.56-70
    • /
    • 2005
  • The results of location-dependent queries(LDQ) generally depend on the current locations of query issuers. Many mechanisms, e.g. broadcast scheme, hoarding, or racking policy, have been developed to improve the system peformance and provide better services, which are specialized for LDQs. Considering geographical adjacency of data and characteristics oi target area, caching policy and broadcast scheme affect the overall performance in LDQ. For this reason, we propose both the caching policy and broadcast scheme, which these features are reflected in. Based on the adjacency of data in LDQ, our broadcast scheme use Hilbert curve to cluster data. Moreover, in order to develop the caching policy suitable for LDQ on urban area, we apply the moving distance of a MH(Mobile Host) to our caching policy We evaluate the performance of the caching policy measuring the workload of MHs and the correctness of LDQ results and the performance of the broadcast scheme measuring the average setup-time of MHs in our experiments. Finally, we expect that our caching policy Provides more correct answers when executing LDQ in focal cache and leads significant improvement of the performance of MHs. It also seems quite probable that our broadcast scheme leads improvement of battery life of the MH.

Design of Intrusion Detection System to be Suitable at the Information System Organized by Homogeneous Hosts (동질형 호스트들로 구성된 정보시스템에 적합한 침입탐지시스템의 설계)

  • 이종성;조성언;조경룡
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.4 no.1
    • /
    • pp.267-282
    • /
    • 2000
  • With the development of computer&network technology and the growth of its dependance, computer failures not only lose human and material resources but also make organization's competition weak as a side-effect of information society. Therefore, people consider computer security as important factor. Intrusion Detection Systems (IDS) detect intrusions and take an appropriate action against them in order to protect a computer from system failure due to illegal intrusion. A variety of methods and models for IDS have been developed until now, but the existing methods or models aren't enough to detect intrusions because of the complexity of computer network the vulnerability of the object system, insufficient understanding for information security and the appearance of new illegal intrusion method. We propose a new IDS model to be suitable at the information system organized by homogeneous hosts and design for the IDS model and implement the prototype of it for feasibility study. The IDS model consist of many distributed unit sensor IDSs at homogeneous hosts and if any of distributed unit sensor IDSs detect anomaly system call among system call sequences generated by a process, the anomaly system call can be dynamically shared with other unit sensor IDSs. This makes the IDS model can effectively detect new intruders about whole information system.

  • PDF

Design and Implementation of an InfiniBand System Interconnect for High-Performance Cluster Systems (고성능 클러스터 시스템을 위한 인피니밴드 시스템 연결망의 설계 및 구현)

  • Mo, Sang-Man;Park, Kyung;Kim, Sung-Nam;Kim, Myung-Jun;Im, Ki-Wook
    • The KIPS Transactions:PartA
    • /
    • v.10A no.4
    • /
    • pp.389-396
    • /
    • 2003
  • InfiniBand technology is being accepted as the future system interconnect to serve as the high-end enterprise fabric for cluster computing. This paper presents the design and implementation of the InfiniBand system interconnect, focusing on an InfiniBand host channel adapter (HCA) based on dual ARM9 processor cores The HCA is an SoC tailed KinCA which connects a host node onto the InfiniBand network both in hardware and in software. Since the ARM9 processor core does not provide necessary features for multiprocessor configuration, novel inter-processor communication and interrupt mechanisms between the two processors were designed and embedded within the KinCA chip. Kinch was fabricated as a 564-pin enhanced BGA (Bail Grid Array) device using 0.18${\mu}{\textrm}{m}$ CMOS technology Mounted on host nodes, it provides 10 Gbps outbound and inbound channels for transmit and receive, respectively, resulting in a high-performance cluster system.

Analysis of TCP/IP Protocol for Implementing a High-Performance Hybrid TCP/IP Offload Engine (고성능 Hybrid TCP/IP Offload Engine 구현을 위한 TCP/IP 프로토콜 분석)

  • Jang Hankook;Oh Soo-Cheol;Chung Sang-Hwa;Kim Dong Kyue
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.6
    • /
    • pp.296-305
    • /
    • 2005
  • TCP/IP, the most popular communication protocol, is processed on a host CPU in traditional computer systems and this imposes enormous loads on the host CPU. Recently TCP/IP Offload Engine (TOE) technology, which processes TCP/IP on a network adapter instead of the host CPU, becomes an important way to solve the problem. In this paper we analysed the structure of a TCP/IP protocol stack in the Linux operating system and important factors, which cause a lot of loads on the host CPU, by measuring the time spent on processing each function in the protocol stack. Based on these analyses, we propose a Hybrid TOE architecture, in which functions imposing much loads on the host CPU are implemented using hardware and other functions are implemented using software.

Performance and Energy Oriented Resource Provisioning in Cloud Systems Based on Dynamic Thresholds and Host Reputation (클라우드 시스템에서 동적 임계치와 호스트 평판도를 기반으로 한 성능 및 에너지 중심 자원 프로비저닝)

  • Elijorde, Frank I.;Lee, Jaewan
    • Journal of Internet Computing and Services
    • /
    • v.14 no.5
    • /
    • pp.39-48
    • /
    • 2013
  • A cloud system has to deal with highly variable workloads resulting from dynamic usage patterns in order to keep the QoS within the predefined SLA. Aside from the aspects regarding services, another emerging concern is to keep the energy consumption at a minimum. This requires the cloud providers to consider energy and performance trade-off when allocating virtualized resources in cloud data centers. In this paper, we propose a resource provisioning approach based on dynamic thresholds to detect the workload level of the host machines. The VM selection policy uses utilization data to choose a VM for migration, while the VM allocation policy designates VMs to a host based on its service reputation. We evaluated our work through simulations and results show that our work outperforms non-power aware methods that don't support migration as well as those based on static thresholds and random selection policy.

A Development of Adaptive VM Migration Techniques in Cloud Computing (클라우드 컴퓨팅에서 적응적 VM 마이그레이션 기법 개발)

  • Lee, HwaMin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.9
    • /
    • pp.315-320
    • /
    • 2015
  • In cloud computing, server virtualization supports one or more virtual machines loaded on multiple operating systems on a single physical host server. Migration of a VM is moving the VM running on a source host to another physical machine called target host. A VM live migration is essential to support task performance optimization, energy efficiency and energy saving, fault tolerance and load balancing. In this paper, we propose open source based adaptive VM live migration technique. For this, we design VM monitoring module to decide VM live migration and open source based full-virtualization hypervisor.