• Title/Summary/Keyword: 통신지연

Search Result 3,207, Processing Time 0.034 seconds

A Study on the Legal and Institutional Improvement Plan for Cyber Correspondence (사이버 대응태세 구축을 위한 법·제도적 개선방안 연구)

  • Lee, Yong Seok;Lim, Jong In
    • Convergence Security Journal
    • /
    • v.19 no.1
    • /
    • pp.61-66
    • /
    • 2019
  • Cyber space is a place where free activities are guaranteed. However, it is also true that not all individuals and countries strive for peaceful cyberspace, and that there is a growing tendency to gain unfair advantage through this space. Therefore, the state should reform laws and institutions to keep cyberspace safe. By establishing the "Basic Law on Cyberspace" which includes the law of the state law on cyberspace, it is necessary to be able to recognize and respond to the direction of the national legal discipline on cyberspace. The development of digital forensics is an urgent task due to the rapid development of IT. However, if the law is delayed for various reasons, some of the existing laws should be amended to improve the stability of the law in accordance with the circumstances. To this end, it is necessary to revise the "Information and Communication Infrastructure Protection Act", "Information and Communication Network Enhancement and Information Protection Act", "Integrated Defense Law", "Establishment of Defense Information Infrastructure Infrastructure and Defense Information Resource Management Act".

Dynamic Routing and Priority-based Data Transmission Schemes in Avionic Ethernet for Improving Network QoS (항공전자 이더넷의 네트워크 성능 향상을 위한 동적 라우팅 기법 및 우선순위기반 데이터 전송 기법)

  • Lee, Won Jin;Kim, Yong Min
    • Journal of Advanced Navigation Technology
    • /
    • v.23 no.4
    • /
    • pp.302-308
    • /
    • 2019
  • Aircraft data network (ADN) is a data networking for signal transmission among avionic systems in aircraft, and it mostly has been applied MIL-STD-1553B that guarantees high reliability considering its application environments. However, commercial Ethernet has been widely applied for ADN recently, and its range of applications have increased. Ethernet provides high speed of data transmission, however, it could not guarantee quality of service (QoS) so high as MIL-STD-1553B. In this paper, we propose dynamic routing and priority based data transmission schemes in order to improve the QoS of legacy Ethernet. Our propose schemes can be applied to Ethernet switch, and it is able to manage network traffic efficiently, and reduce the time for data transmission. We analyze the packet transmission time for both legacy and proposed schemes in Ethernet environments using simulation, and we show that our proposed scheme can reduce the time for data transmission compare to legacy spanning tree protocol.

The Security Vulnerabilities of 5G-AKA and PUF-based Security Improvement (5G 인증 및 키합의 프로토콜(5G-AKA)의 보안취약점과 PUF 기반의 보안성 향상 방안)

  • Jung, Jin Woo;Lee, Soo Jin
    • Convergence Security Journal
    • /
    • v.19 no.1
    • /
    • pp.3-10
    • /
    • 2019
  • The 5G network is a next-generation converged network that combines various ICT technologies to realize the need for high speed, hyper connection and ultra low delay, and various efforts have been made to address the security vulnerabilities of the previous generation mobile networks. However, the standards released so far still have potential security vulnerabilities, such as USIM deception and replication attack, message re-transmission attack, and race-condition attack. In order to solve these security problems, this paper proposes a new 5G-AKA protocol with PUF technology, which is a physical unclonable function. The proposed PUF-based 5G-AKA improves the security vulnerabilities identified so far using the device-specific response for a specific challenge and hash function. This approach enables a strong white-list policy through the addition of inexpensive PUF circuits when utilizing 5G networks in areas where security is critical. In addition, since additional cryptographic algorithms are not applied to existing protocols, there is relatively little burden on increasing computational costs or increasing authentication parameter storage.

Efficient Finite Field Arithmetic Architectures for Pairing Based Cryptosystems (페어링 기반 암호시스템의 효율적인 유한체 연산기)

  • Chang, Nam-Su;Kim, Tae-Hyun;Kim, Chang-Han;Han, Dong-Guk;Kim, Ho-Won
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.3
    • /
    • pp.33-44
    • /
    • 2008
  • The efficiency of pairing based cryptosystems depends on the computation of pairings. pairings is defined over finite fileds GF$(3^m)$ by trinomials due to efficiency. The hardware architectures for pairings have been widely studied. This paper proposes new adder and multiplier for GF(3) which are more efficient than previous results. Furthermore, this paper proposes a new unified adder-subtractor for GF$(3^m)$ based on the proposed adder and multiplier. Finally, this paper proposes new multiplier for GF$(3^m)$. The proposed MSB-first bit-serial multiplier for GF$(p^m)$ reduces the time delay by approximately 30 % and the size of register by half than previous LSB-first multipliers. The proposed multiplier can be applied to all finite fields defined by trinomials.

A Finite Memory Structure Smoothing Filter and Its Equivalent Relationship with Existing Filters (유한기억구조 스무딩 필터와 기존 필터와의 등가 관계)

  • Kim, Min Hui;Kim, Pyung Soo
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.10 no.2
    • /
    • pp.53-58
    • /
    • 2021
  • In this paper, an alternative finite memory structure(FMS) smoothing filter is developed for discrete-time state-space model with a control input. To obtain the FMS smoothing filter, unbiasedness will be required beforehand in addition to a performance criteria of minimum variance. The FMS smoothing filter is obtained by directly solving an optimization problem with the unbiasedness constraint using only finite measurements and inputs on the most recent window. The proposed FMS smoothing filter is shown to have intrinsic good properties such as deadbeat and time-invariance. In addition, the proposed FMS smoothing filter is shown to be equivalent to existing FMS filters according to the delay length between the measurement and the availability of its estimate. Finally, to verify intrinsic robustness of the proposed FMS smoothing filter, computer simulations are performed for a temporary model uncertainty. Simulation results show that the proposed FMS smoothing filter can be better than the standard FMS filter and Kalman filter.

A Comparative Study on Off-Path Content Access Schemes in NDN (NDN에서 Off-Path 콘텐츠 접근기법들에 대한 성능 비교 연구)

  • Lee, Junseok;Kim, Dohyung
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.10 no.12
    • /
    • pp.319-328
    • /
    • 2021
  • With popularization of services for massive content, the fundamental limitations of TCP/IP networking were discussed and a new paradigm called Information-centric networking (ICN) was presented. In ICN, content is addressed by the content identifier (content name) instead of the location identifier such as IP address, and network nodes can use the cache to store content in transit to directly service subsequent user requests. As the user request can be serviced from nearby network caches rather than from far-located content servers, advantages such as reduced service latency, efficient usage of network bandwidth, and service scalability have been introduced. However, these advantages are determined by how actively content stored in the cache can be utilized. In this paper, we 1) introduce content access schemes in Named-data networking, one of the representative ICN architectures; 2) in particular, review the schemes that allow access to cached content away from routing paths; 3) conduct comparative study on the performance of the schemes using the ndnSIM simulator.

A Study on the Latency Analysis of Bus Information System Based on Edge Cloud System (엣지 클라우드 시스템 기반 버스 정보 시스템의 지연시간 분석연구)

  • SEO Seungho;Dae-Sik Ko
    • Journal of Platform Technology
    • /
    • v.11 no.3
    • /
    • pp.3-11
    • /
    • 2023
  • Real-time control systems are growing rapidly as infrastructure technologies such as IoT and mobile communication develop and services that value real-time such as factory management and vehicle operation checks increase. Various solutions have been proposed to increase the time sensitivity of this system, but most real-time control systems are currently composed of local servers and multiple clients located in control stations, which are transmitted to local servers where control systems are located. In this paper, we proposed an edge computing-based real-time control model that can reduce the time it takes for the bus information system, one of the real-time control systems, to provide the information to the user at the time it collects the information. Simulating the existing model and the edge computing model, the edge computing model confirmed that the cost for users to receive data is reduced from at least 10% to up to 80% compared to the existing model.

  • PDF

Deep Learning-Based Dynamic Scheduling with Multi-Agents Supporting Scalability in Edge Computing Environments (멀티 에이전트 에지 컴퓨팅 환경에서 확장성을 지원하는 딥러닝 기반 동적 스케줄링)

  • JongBeom Lim
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.12 no.9
    • /
    • pp.399-406
    • /
    • 2023
  • Cloud computing has been evolved to support edge computing architecture that combines fog management layer with edge servers. The main reason why it is received much attention is low communication latency for real-time IoT applications. At the same time, various cloud task scheduling techniques based on artificial intelligence have been proposed. Artificial intelligence-based cloud task scheduling techniques show better performance in comparison to existing methods, but it has relatively high scheduling time. In this paper, we propose a deep learning-based dynamic scheduling with multi-agents supporting scalability in edge computing environments. The proposed method shows low scheduling time than previous artificial intelligence-based scheduling techniques. To show the effectiveness of the proposed method, we compare the performance between previous and proposed methods in a scalable experimental environment. The results show that our method supports real-time IoT applications with low scheduling time, and shows better performance in terms of the number of completed cloud tasks in a scalable experimental environment.

An Encryption Algorithm Based on Light-Weight SEED for Accessing Multiple Objects in RFID System (RFID 시스템에서 다중 객체를 지원하기 위한 경량화된 SEED 기반의 암호화 알고리즘)

  • Kim, Ji-Yeon;Jung, Jong-Jin
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.15 no.3
    • /
    • pp.41-49
    • /
    • 2010
  • Recently, RFID systems are spreading in various industrial areas faster but cause some serious problems of information security because of its unstable wireless communication. Moreover, traditional RFID systems have a restriction that one tag per each application object. This restriction deteriorates their usability because it is difficult to distinguish many tags without some kind of effort. Therefore, efficient information sharing of objects based on information security has to be studied for more spreading of RFID technologies. In this paper, we design a new RFID tag structure for supporting multiple objects which can be shared by many different RFID applications. We also design an encryption/decryption algorithm to protect the identifying information of objects stored in our tag structure. This algorithm is a light revision of the existing SEED algorithm which can be operated in RFID tag environment. To evaluate the performance of our algorithm, we measure the encryption and decryption times of this algorithm and compare the results with those of the original SEED algorithm.

Data Central Network Technology Trend Analysis using SDN/NFV/Edge-Computing (SDN, NFV, Edge-Computing을 이용한 데이터 중심 네트워크 기술 동향 분석)

  • Kim, Ki-Hyeon;Choi, Mi-Jung
    • KNOM Review
    • /
    • v.22 no.3
    • /
    • pp.1-12
    • /
    • 2019
  • Recently, researching using big data and AI has emerged as a major issue in the ICT field. But, the size of big data for research is growing exponentially. In addition, users of data transmission of existing network method suggest that the problem the time taken to send and receive big data is slower than the time to copy and send the hard disk. Accordingly, researchers require dynamic and flexible network technology that can transmit data at high speed and accommodate various network structures. SDN/NFV technologies can be programming a network to provide a network suitable for the needs of users. It can easily solve the network's flexibility and security problems. Also, the problem with performing AI is that centralized data processing cannot guarantee real-time, and network delay occur when traffic increases. In order to solve this problem, the edge-computing technology, should be used which has moved away from the centralized method. In this paper, we investigate the concept and research trend of SDN, NFV, and edge-computing technologies, and analyze the trends of data central network technologies used by combining these three technologies.