• Title/Summary/Keyword: Node Architecture

Search Result 490, Processing Time 0.031 seconds

A Construction and Operation Analysis of Group Management Network about Control Devices based on CIM Level 3 (CIM 계층 3에서 제어 기기들의 그룹 관리 네트워크 구축과 운영 해석)

  • 김정호
    • The Journal of Society for e-Business Studies
    • /
    • v.4 no.1
    • /
    • pp.87-101
    • /
    • 1999
  • To operate the automatic devices of manufacturing process more effectively and to solve the needs of the resource sharing, network technology is applied to the control devices located in common manufacturing zone and operated by connecting them. In this paper, functional standard of the network layers are set as physical and data link layer of IEEE 802.2, 802.4, and VMD application layer and ISO-CIM reference model. Then, they are divided as minimized architecture, designed as group objects which perform group management and service objects which organizes and operates the group. For the stability in this network, this paper measures the variation of data packet length and node number and analyzes the variated value of the waiting time for the network operation. For the method of the analysis, non-exhausted service method are selected, and the arrival rates of the each data packet to the nodes that are assumed to form a Poission distribution. Then, queue model is set as M/G/1, and the analysis equation for waiting time is found. For the evalution of the performance, the length of the data packet varies from 10 bytes to 100 bytes in the operation of the group management network, the variation of the wating time is less than 10 msec. Since the waiting time in this case is less than 10 msec, response time is fast enough. Furthermore, to evaluate the real time processing of the group management network, it shows if the number of nodes is less than 40, and the average arrival time is less than 40 packet/sec, it can perform stable operation even taking the overhead such as software delay time, indicated packet service, and transmissin safety margin.

  • PDF

DEVS 형식론을 이용한 다중프로세서 운영체제의 모델링 및 성능평가

  • 홍준성
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1994.10a
    • /
    • pp.32-32
    • /
    • 1994
  • In this example, a message passing based multicomputer system with general interdonnedtion network is considered. After multicomputer systems are developed with morm-hole routing network, topologies of interconecting network are not major considertion for process management and resource sharing. Tehre is an independeent operating system kernel oneach node. It communicates with other kernels using message passingmechanism. Based on this architecture, the problem is how mech does performance degradation will occur in the case of processor sharing on multicomputer systems. Processor sharing between application programs is veryimprotant decision on system performance. In almost cases, application programs running on massively parallel computer systems are not so much user-interactive. Thus, the main performance index is system throughput. Each application program has various communication patterns. and the sharing of processors causes serious performance degradation in hte worst case such that one processor is shared by two processes and another processes are waiting the messages from those processes. As a result, considering this problem is improtant since it gives the reason whether the system allows processor sharingor not. Input data has many parameters in this simulation . It contains the number of threads per task , communication patterns between threads, data generation and also defects in random inupt data. Many parallel aplication programs has its specific communication patterns, and there are computation and communication phases. Therefore, this phase informatin cannot be obtained random input data. If we get trace data from some real applications. we can simulate the problem more realistic . On the other hand, simualtion results will be waseteful unless sufficient trace data with varisous communication patterns is gathered. In this project , random input data are used for simulation . Only controllable data are the number of threads of each task and mapping strategy. First, each task runs independently. After that , each task shres one and more processors with other tasks. As more processors are shared , there will be performance degradation . Form this degradation rate , we can know the overhead of processor sharing . Process scheduling policy can affects the results of simulation . For process scheduling, priority queue and FIFO queue are implemented to support round-robin scheduling and priority scheduling.

  • PDF

A Study on Hierarchical Structure and Blockchain-based Node Authentication Mechanism in MANET (MANET에서 계층적 구조와 블록체인 기반 노드 인증 기법에 관한 연구)

  • Yang, Hwanseok
    • Convergence Security Journal
    • /
    • v.19 no.3
    • /
    • pp.13-19
    • /
    • 2019
  • MANET has many security vulnerabilities because it consists of only mobile nodes using wireless. In particular, it is a very important factor determining network performance that excludes the participation of malicious nodes through accurate reliability measurements and authentication of nodes participating in the network. In this paper, we proposed a technique applied with blockchain technology in order to prevent forgery of authentication information for nodes participating in the network. And, an area-based hierarchical structure was applied to increase the efficiency of authentication for nodes and apply the optimal technique of block generation and exchange protocol. In addition, four data payloads were added to the block header in order to add authentication information for nodes in block. To improve the reliability by applying the blockchain technique to the hop-by-hop data transfer method between mobile nodes, blockchain exchange protocol through transaction creation, block packaging and verification processes were implemented. We performed the comparative experiment with the existing methods to evaluate the performance of the proposed method and confirmed the excellent performance by the experiment results.

Design of Quantum Key Distribution System without Fixed Role of Cryptographic Applications (암호장치의 송·수신자 역할 설정이 없는 양자키분배 시스템 설계)

  • Ko, Haeng-Seok;Ji, Se-Wan;Jang, Jingak
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.30 no.5
    • /
    • pp.771-780
    • /
    • 2020
  • QKD(Quantum Key Distribution) is one of the protocols that can make two distant parties safely share secure keys against the threat of quantum computer. Generally, cryptographic applications which are connected to the QKD device have fixed roles as a transmitter and a receiver due to the race condition and complexity of implementation. Because the conventional QKD system is mainly applied to the link encryptor, there are no problems even if the roles of the cryptographic devices are fixed. We propose a new scheme of QKD system and protocol that is easy to extend to the QKD network by eliminating quantum key dependency between cryptographic device and QKD node. The secure keys which are generated by the TRNG(True Random Number Generator) are provided to the cryptographic applications instead of quantum keys. We design an architecture to transmit safely the secure keys using the inbound and outbound quantum keys which are shared between two nodes. In this scheme, since the dependency of shared quantum keys between two QKD nodes is eliminated, all cryptographic applicatons can be a master or a slave depending on who initiates the cryptographic communications.

2.5 Gbps Hybrid PON link Using RSOA Based WDM-PON and a Reach Extender (RSOA기반 WDM-PON 링크와 Reach Extender를 이용한 2.5 Gbps 하이브리드 PON 링크 기술)

  • Kim, Kwang-Ok;Lee, Jie-Hyun;Lee, Sang-Soo;Jang, Youn-Seon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.6B
    • /
    • pp.583-591
    • /
    • 2011
  • We presents the architecture of the 2.5 Gbps hybrid PON link which can increase of the transmission distance and link capability, and split ratio by using a colorless DWDM-PON and O/E/O based reach extender into an existing G-PON link. A RSOA based DWDM-PON to apply the feeder fiber can provide a link capacity of 32 larger that of a legacy G-PON. The reach extender converts the wavelength of DWDM-PON to G-PON through GTC frame regeneration at the remote node, and can provide a burst reset signal in order to extract upstream burst signal, simultaneously. The proposed hybrid PON enable a legacy G-PON to operate over the maximum 60 km distance with a 128-way split per WDM wavelength.

Sensor Network System for Littoral Sea Cage Culture Monitoring (연근해 가두리 양식장 모니터링을 위한 센서네트워크 시스템)

  • Shin, DongHyun;Kim, Changhwa
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.9
    • /
    • pp.247-260
    • /
    • 2016
  • Sensor networks have been used in many applications such as smart home, smart factory, etc. based on sensor data. Sensor networks can change system requirements and architectures depending on their application areas. Currently, sensor network application cases in ocean environments are very rare because the ocean environments have much difficult accessibility more poor conditions, higher wave heights, more frogs, much heavier salinity, etc., compared with ground environments. In this paper, we propose the requirements, architecture and design of a sensor network system for the littoral sea cage culture monitoring and we also introduce its operation results through the development. The developed system based on our research provides users with functionalities to extract, monitor, and manage underwater environmental conditions suitable to littoral sea cage culturing of fishes.

Kalman Filtering-based Traffic Prediction for Software Defined Intra-data Center Networks

  • Mbous, Jacques;Jiang, Tao;Tang, Ming;Fu, Songnian;Liu, Deming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.6
    • /
    • pp.2964-2985
    • /
    • 2019
  • Global data center IP traffic is expected to reach 20.6 zettabytes (ZB) by the end of 2021. Intra-data center networks (Intra-DCN) will account for 71.5% of the data center traffic flow and will be the largest portion of the traffic. The understanding of traffic distribution in IntraDCN is still sketchy. It causes significant amount of bandwidth to go unutilized, and creates avoidable choke points. Conventional transport protocols such as Optical Packet Switching (OPS) and Optical Burst Switching (OBS) allow a one-sided view of the traffic flow in the network. This therefore causes disjointed and uncoordinated decision-making at each node. For effective resource planning, there is the need to consider joining the distributed with centralized management which anticipates the system's needs and regulates the entire network. Methods derived from Kalman filters have proved effective in planning road networks. Considering the network available bandwidth as data transport highways, we propose an intelligent enhanced SDN concept applied to OBS architecture. A management plane (MP) is added to conventional control (CP) and data planes (DP). The MP assembles the traffic spatio-temporal parameters from ingress nodes, uses Kalman filtering prediction-based algorithm to estimate traffic demand. Prior to packets arrival at edges nodes, it regularly forwards updates of resources allocation to CPs. Simulations were done on a hybrid scheme (1+1) and on the centralized OBS. The results demonstrated that the proposition decreases the packet loss ratio. It also improves network latency and throughput-up to 84 and 51%, respectively, versus the traditional scheme.

Epidemic & Prediction based Routing Protocol for Delay Tolerant Network (DTN에서 에피데믹과 예측 기반 알고리즘을 이용한 라우팅 프로토콜)

  • Dho, Yoon-Hyung;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.05a
    • /
    • pp.404-407
    • /
    • 2014
  • Delay Tolerant Network (DTN) is a networking architecture that is designed to solve network problem in unstable and stressed environments using the Store-Carry-Forward method. Different form general networks, DTN does not guarantee the end-to-end connectivity, it is hard for the exiting TCP/IP based protocols to normally work due to the characteristic such as large latency and unstable link connectivity. And the condition that send massage without the information of the destination occurs frequently. Thus, suitable routing protocols for DTN are required and being researched. In this paper, we propose a novel routing protocol for DTN utilizing epidemic and prediction based algorithm to prevent the defect of previously DTN routing protocols such as the absence of the holistic view of the network. Proposed algorithm predicted destination using the mobility information recorded in neighbor node's history and utilize epidemic based algorithm when occurred condition without destination's information. This algorithm is enhanced in terms of delivery ratio, decreases latency and overhead in sparse network such as DTN.

  • PDF

A Near-tip Grid Refinement for the Effective and Reliable Crack Analysis by Natural Element Method (효율적이고 신뢰성있는 자연요소 균열해석을 위한 균열선단 그리드 세분화기법)

  • Cho, Jin-Rae
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.32 no.3
    • /
    • pp.183-190
    • /
    • 2019
  • This paper introduces a near-tip grid refinement and explores its usefulness in the crack analysis by the natural element method(NEM). As a sort of local h-refinement in finite element method(FEM), a NEM grid is locally refined around the crack tip showing high stress singularity. This local grid refinement is completed in two steps in which grid points are added and Delaunay triangles sharing the crack tip node are divided. A plane strain rectangular plate with symmetric edge cracks is simulated to validate the proposed local grid refinement and to examine its usefulness in the crack analysis. The crack analysis is also simulated using a uniform NEM grid for comparison. Unlike the uniform grid, the refined grid provides near-tip stress distributions similar to the analytic solutions and the fine grid. In addition, the refined grid shows higher convergence than the uniform grid, the global relative error to the total number of grid points.

The Improvement of Disaster Safety Network using ICT Devices (ICT 기기를 활용한 재난안전통신망 강화 방안)

  • Hong, Sung-Hwa
    • Journal of Advanced Navigation Technology
    • /
    • v.23 no.2
    • /
    • pp.194-199
    • /
    • 2019
  • Natural disasters destroy decades of human effort and investments, thereby placing new demands on society for reconstruction and rehabilitation. In most case, the natural phenomena triggering the disasters are beyond human control. In order to solve the problems that the information resources can not be shared among disaster management sectors and their work is hard to be coordinated in city, an idea of application of ubiquitous sense network and ICT technology to model the architecture of the disaster prevention system based on the analysis of characteristics of disasters. The proposed algorithm simulated that it is possible to locate the terminal by linking the direction angle and the estimated position that can be confirmed at the time of stopping, even if the movement direction of the terminal does not move in a certain direction with only a smaller number of mobile base stations. We also confirmed that the proposed algorithms analyzed through simulation are more efficient than existing algorithms.