• Title/Summary/Keyword: 네트워크 트래픽 데이터

Search Result 787, Processing Time 0.024 seconds

Advanced protocol against MITM attacks in Industrial Control System (산업제어시스템에서의 MITM 공격을 방어하기 위해 개선된 프로토콜)

  • Ko, Moo-seong;Oh, Sang-kyo;Lee, Kyung-ho
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.6
    • /
    • pp.1455-1463
    • /
    • 2015
  • If the industrial control system is infected by malicious worm such as Stuxnet, national disaster could be caused inevitably. Therefore, most of the industrial control system defence is focused on intrusion detection in network to protect against these threats. Conventional method is effective to monitor network traffic and detect anomalous patterns, but normal traffic pattern attacks using MITM technique are difficult to be detected. This study analyzes the PROFINET/DCP protocol and weaknesses with the data collected in real industrial control system. And add the authentication data field to secure the protocol, find out the applicability. Improved protocol may prevent the national disaster and defend against MITM attacks.

A Reactive Chord for Efficient Network Resource Utilization in Mobile P2P Environments (모바일 P2P 환경에서 효율적인 네트워크 자원 활용을 위한 반응적인 코드)

  • Yoon, Young-Hyo;Kwak, Hu-Keun;Kim, Cheong-Ghil;Chung, Kyu-Sik
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.2
    • /
    • pp.80-89
    • /
    • 2009
  • A DHT(Distributed Hash Table) based P2P is a method that compensates disadvantages of the existing unstructured P2P method. If a DHT algorithm is used, it can do fast data search and maintain search efficiency independent of the number of peers. The peers in a DHT method send messages periodically to keep the routing table updated. In a mobile environment, the peers in a DHT method should send messages more frequently to keep the routing table updated and reduce the failure of requests. However this results in increasing the overall network traffic. In this paper, we propose a method to reduce the update load of a routing table in the existing DHT by updating it in a reactive way. In the proposed reactive method, a routing table is updated only if a data request is coming whereas it is updated periodically in the existing proactive method. We perform experiments using Chord simulator(I3) made by UC Berkely. The experimental results show the performance improvement of the proposed method compared to the existing method.

General Web Cache Implementation Using NIO (NIO를 이용한 범용 웹 캐시 구현)

  • Lee, Chul-Hui;Shin, Yong-Hyeon
    • Journal of Advanced Navigation Technology
    • /
    • v.20 no.1
    • /
    • pp.79-85
    • /
    • 2016
  • Network traffic is increased rapidly, due to mobile and social network, such as smartphones and facebook, in recent web environment. In this paper, we improved web response time of existing system using direct buffer of NIO and DMA. This solved the disadvantage of JAVA, such as CPU performance reduction due to the blocking of I/O, garbage collection of buffer. Key values circulated many data due to priority change put on a hash map operated easily and apply a priority modification algorithm. Large response data is separated and stored at a fast direct buffer and improved performance. This paper showed that the proposed method using NIO was much improved performance, in many test situations of cache hit and cache miss.

A Geographical Routing Protocol Based on Agent for Wireless Sensor Networks (무선센서네트워크에서 에이전트 기반의 지리정보 라우팅 프로토콜)

  • Dong, Lihua;Kim, Ki-Il
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.9
    • /
    • pp.2143-2149
    • /
    • 2010
  • An agent based geographic routing protocol is proposed to improve the well-known geographic routing protocol-GPSR routing protocol. In the proposed scheme, the agent is selected by sink node which concern about the source node's position as well as agent candidate's state. So packets will first be forwarded to agent and next step is to be forwarded to their final goal- sink node from agent. During the next hop selection process, nodes select their neighbors by considering not only position but also their average available buffer size. This results in efficient selection of next hop node in congestion area, and then increases the successful packet delivery ratio. The simulation is conducted for two scenarios: general number of connections and large number of connections in our map. Results show that new method with agent achieves improved performance in successful packet delivery ratio when compares to GPSR without our scheme.

Mobile IP local pre-registration scheme for accommodating real-time data traffics in cdma2000 Networks (cdma2000 네트워크에서 실시간 데이터 트래픽을 수용하기 위한 Mobile IP 지역내 사전등록 기법)

  • 박민철;임재성
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.7A
    • /
    • pp.493-502
    • /
    • 2003
  • In this paper, to solve some problems of the Mobile IP and local registration strategy we propose a method that can effectively support real-time traffics sensitive to delay time and packet loss. The proposed method reduces the registration time after a Mobile Node's movement between networks by carrying out the pre-registration for the domain which it will move into the network information of the link layer of cdma2000 system, at the boundary cell's handoff zone. Through the cost analysis and simulation it is shown that the proposed scheme yield a better performance compared with the Mobile IP and local registration strategies in terms of packet loss for parameters; variation of the velocity of a Mobile Node, and a distance between the Mobile Node and home networks, etc.

An Efficient SIP Messages Control in Distributed Conference Model (분산형 컨퍼런스 모델에서의 효율적 SIP 메시지 제어)

  • Jang, Choon-Seo;Lee, Ky-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.10
    • /
    • pp.71-77
    • /
    • 2012
  • In this paper, We have proposed an efficient SIP(Session Initiation Protocol) messages control which can be used to reduce conference servers load in distributed conference model. Each conference participant can control the amount of event notification messages from the conference server in real time according to its processing capacity and network circumstances. And the amount of SIP messages needed to maintain session with the conference servers can also be controlled actively in our system. The amount of SIP messages which should be processed by the conference servers can be reduced largely by using our suggested method. Therefore the conference system can be more easily expandable and total network traffic can be reduced largely in SIP environment. We have suggested new conference event packages and conference information data model with some added elements that are necessary for efficient SIP messages control. The performance of the proposed system has been evaluated by experiments.

Design and Implementation of Low-Power Object-based IP Storage for Mobile Devices using WLAN Power Control (WLAN 전력제어를 적용한 모바일 단말용 저전력 객체기반 IP 스토리지 설계 및 구현)

  • Nam, Young-Jin;Choi, Min-Seok;Jeon, Young-Joon;Ryu, Jeong-Tak;Moon, Byung-Hyun
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.12 no.4
    • /
    • pp.32-40
    • /
    • 2007
  • A mobile device accesses large-sized data in object-based IP storage as an object unit over IP network. It relies heavily on a WLAN device, which has been known as one of the major power consumers. This paper designs and implements low-power object-based IP storage for mobile devices using an efficient WLAN power control. The proposed WLAN power control exploits prefetch buffer to maximize the idleness for incoming network traffic and controls available WLAN power modes to minimize the power consumption. Our experimental results reveal that the proposed WLAN control can save the total power consumption in a PXA270-based mobile device about 9% while playing the multimedia contents through an object-based IP storage device

  • PDF

A Fast Route Selection Mechanism Considering Channel Statuses in Wireless Sensor Networks (무선 센서 네트워크에서 채널 상태를 고려하여 빠른 경로를 선택하는 기법)

  • Choi, Jae-Won
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.7
    • /
    • pp.45-51
    • /
    • 2009
  • We have presented a routing mechanism that selects a route by considering channel statuses in order to fast transfer delay-sensitive data in WSNs (Wireless Sensor Networks). The existing methods for real-time data transfer select a path whose latency is the shortest or the number of hops is the smallest. An algorithm to select a real-time transfer path based on link error rates according to the characteristic of wireless medium was also suggested. However, the propagation delay and retransmission timeout affected by link error rates are shorter than channel assessment time and backoff time. Therefore, the mechanism proposed in this paper estimated the time spent in using a clear channel and sending out a packet, which is based on channel backoff rates. A source node comes to select a route with the shortest end-to-end delay as a fast transfer path for real-time traffic, and sends data along the path chosen. We found that this proposed mechanism improves the speed of event-to-sink data transfer by performing experiments under different link error and channel backoff rates.

A Performance Analysis and Evaluation of Congestion Avoidance Algorithm for ABR service over ATM Networks (ATM망에서 ABR 서비스를 위한 혼잡회피 알고리즘의 성능 분석 및 평가)

  • 하창승;조익성
    • Journal of the Korea Society of Computer and Information
    • /
    • v.7 no.3
    • /
    • pp.80-91
    • /
    • 2002
  • A general goal of the AT%(Asynchronous Transfer Mode) network is to support connect across various network. On ATM networks, ABR services are provided using the remained ban after allocation CBR and VBR traffic. Realtime services such as transmitting audio or video data may be provided using CBR ado VBR which have a constrained transmission delay, but in these cases, the communications bandwidth may be wasted. In this paper a simulation has been performed to compare and evaluate the performance between the ERICA(Explicit Rate Indicate Avoidance) and EPRCA(Enhanced Proportional Rate Control Algorithm) switches which use Explicit Rate switch algorithm for ABR switch. The variation of the ACR at the source end system, the queue length, the utilization rate of the link bandwidth and the share fairness at the transient and steady states are used as the evaluation criteria for the simulation. As a result of simulation, ERICA algorithm switch was ten times long compared to ERPCA switch to achieve assigned fair share. so EPRCA switch is superior to ERICA about load response. For Fair share and stability, ERICA switch is excellent to EPRCA switch.

  • PDF

Detection of Car Hacking Using One Class Classifier (단일 클래스 분류기를 사용한 차량 해킹 탐지)

  • Seo, Jae-Hyun
    • Journal of the Korea Convergence Society
    • /
    • v.9 no.6
    • /
    • pp.33-38
    • /
    • 2018
  • In this study, we try to detect new attacks for vehicle by learning only one class. We use Car-Hacking dataset, an intrusion detection dataset, which is used to evaluate classification performance. The dataset are created by logging CAN (Controller Area Network) traffic through OBD-II port from a real vehicle. The dataset have four attack types. One class classification is one of unsupervised learning methods that classifies attack class by learning only normal class. When using unsupervised learning, it difficult to achieve high efficiency because it does not use negative instances for learning. However, unsupervised learning has the advantage for classifying unlabeled data, which are new attacks. In this study, we use one class classifier to detect new attacks that are difficult to detect using signature-based rules on network intrusion detection system. The proposed method suggests a combination of parameters that detect all new attacks and show efficient classification performance for normal dataset.