• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.22 no.3
• /
• pp.754-762
• /
• 2021

Seamless wireless communication network access technology enables users to guarantee service continuity. Hence, it is necessary for disaster situations in which network service may be interrupted. The Multi-path router is a technology to improve network stability and strengthen field operability, particularly in a disaster environment where network failure can occur by providing high-performance data transmission using multi-communication networks and network security by VPN-based wireless IP. In this paper, a prototype system for an MPR-based wireless communication network was proposed to improve the operation performance for disaster field investigation applications. A comparative experiment was performed on various data transmission performances with the existing single wireless communication network. In addition, another experiment was conducted by measuring the data packet transmission and receiving performance in the existing/new wireless communication system first and then assessing the UDP transmission performance in a single router environment to understand the transmission capability of the new MPR. The experimental results showed that the sending and receiving performance was improved by approximately double that of the existing single wireless communication system. The proposed prototype system is expected to allow users to share and disseminate collected on-site data more quickly and efficiently during a disaster site investigation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.4
• /
• pp.69-75
• /
• 2010

In this paper, a ZigBee-based wireless sensor network is configured for the robot to effectively communicate with the environment platform where sensor nodes are implemented using high performance microcontrollers. The localization and the navigation functions are also required to the robot which performs the given task using various types of sensor information. A new type of ZigBee stack is developed using the RUM(Router Under MAC) of the Atmel Corp. and it is applied to a 32-bit ARM core microcontroller for the high performance sensor data manipulation and transmission. It is verified by experiments that the wireless sensor network consisting of developed high performance sensor nodes can be effectively used for the robot environment platform.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.14 no.6
• /
• pp.110-116
• /
• 2005

A single-piece-machined-part has superior characteristics to an assembly of several pieces of part especially for aircraft components. It is necessary to develop high efficient 'multi-head router machine' for machining a large size single-piece-part on a large scale. In this type machine, many cutting chips are generated. These chips should be removed automatically f3r productivity and part precision. In this study, the design evaluation of the cutting chip collecting apparatus for 'multi-head router machine' was complemented using performance test and finite element analysis.

• Journal of Construction Engineering and Project Management
• /
• v.5 no.2
• /
• pp.44-52
• /
• 2015

Various approaches have been used in crack preparations and each of the approaches has advantages and disadvantages. Although the routing method has been widely used and seems to be the best approach among the approaches, it is not a complete solution for crack preparation. This paper compares and evaluates a pneumatic crack cleaning device (CCD) developed by Robotics and Intelligent Construction Automation group at Georgia Tech, over existing devices. Surveys were conducted to discover factors that affect the performance of crack/joint preparation work. Then, data for such information were collected via field tests for devices such as router, heat lancer, air blower and CCD. Performed field test results and follow-up interviews demonstrated that the utilization of CCD has potential to offer improvements in productivity, safety, and maintenance cost. An analytic hierarchical procedure (AHP) and economic analyses were conducted. The AHP analysis considered three factors including safety, quality and productivity while the economic analyses examined the alternatives in various ways. The results indicated that the CCD was ranked first and second for the AHP analysis and economic analysis, respectively. In conclusion, the field tests and results revealed that the utilization of CCD achieved satisfactorily in performance, quality, safety and control, and showed that it has high potential in crack cleaning practice.

• ETRI Journal
• /
• v.30 no.2
• /
• pp.183-193
• /
• 2008

In this paper, we propose quality of service mechanisms for flow-based routers which have to handle several million flows at wire speed in high-speed networks. Traffic management mechanisms are proposed for guaranteed traffic and non-guaranteed traffic separately, and then the effective harmonization of the two mechanisms is introduced for real networks in which both traffic types are mixed together. A simple non-work-conserving fair queuing algorithm is proposed for guaranteed traffic, and an adaptive flow-based random early drop algorithm is proposed for non-guaranteed traffic. Based on that basic architecture, we propose a dynamic traffic identification method to dynamically prioritize traffic according to the traffic characteristics of applications. In a high-speed router system, the dynamic traffic identification method could be a good alternative to deep packet inspection, which requires handling of the IP packet header and payload. Through numerical analysis, simulation, and a real system experiment, we demonstrate the performance of the proposed mechanisms.

• Journal of Korea Society of Industrial Information Systems
• /
• v.22 no.1
• /
• pp.33-40
• /
• 2017

In this Paper, Analyse the Steady State Behavior of TCP and TFRC with Packet Error when both TCP and TFRC Flows Co-exist in the Network. First, Model the Network with TCP and TFRC Connections as a Discrete Time System. Second, Calculate Average Round Trip Time of the Packet Between Source and Destination on Packet Loss Environment. Then Derive the Steady State Performance i.e. Throughput of TCP and TFRC, and Average Buffer Size of RED Router Based on the Analytic Network Model. The Throughput of TCP and TFRC Connection Decrease Rapidly with the Growth of Sending Window Size and Their Transmission Rate but Their Declines become Smoothly when the Number of Sending Window Arrives on Threshold Value. The Average Queue Length of RED Router Increases Slowly on Low Transmission Rate but Increases Rapidly on High Transmission Rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9B
• /
• pp.939-946
• /
• 2009

In this paper, we propose a new network ASIP(Application Specific Instruction-set Processor) which was designed for simulation models by a machine descriptions language LISA(Language for Instruction Set Architecture). This network ASIP is aimed for an exclusive engine undertaking packet processing in a router. To achieve the purpose, we added a new necessary instruction set for processing a general ASIP based on MIPS(Microprocessor without Interlock Pipeline Stages) architecture in high speed. The new instructions can be divided into two groups: a classification instruction group and a modification instruction group, and each group is to be processed by its own functional unit in an execution stage. The functional unit was optimized for area and speed through Verilog HDL, and the result after synthesis was compared with the area and operation delay time. Moreownr, it was allocated to the Macro function ana low-level standardized programming language C using CKF(Compiler Known Function). Consequently, we verified performance improvement achieved by analysis and comparison of execution cycles of application programs.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.94-96
• /
• 2021

Software-Defined Networking (SDN), which has emerged to overcome the limitations of existing network architectures, makes routing management simpler and more efficient through a central controller. SR (Segment Routing) is a flexible and scalable way of doing source routing, and defines the information path of the network through a list of segments arranged in the packet header. In an SDN environment, the performance of each router is almost the same, but packets tend to be concentrated on routes that are frequently used depending on routing algorithms. Routers in that path have a relatively high frequency of failure and are more likely to become bottlenecks. In this paper, we propose a routing algorithm that allows the router, which is a resource in the network, to evenly process packets in the SDN with SR, so that the administrator can utilize the resources in the network without idle routers, and at the same time facilitate the management of the router.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.641-646
• /
• 2003

Packet processing speed of routers as well as transmission speed of physical links gives a great effect on IP packet transfer rate in Internet. The router forwards a packet after determining the next hop to the packet's destination. IP address lookup is a main design issue for high performance routers. In this paper, we propose a partitioned compressed-trie for speeding-up IP address lookup algorithms based on tie data structure by exploiting path compression. In the ,proposed scheme, IP prefixes are divided into several compressed-tries and lookup is performed on only one partitioned compressed-trie. Memory access time for IP address lookup is lessen due to compression technique and memory required for maintaining partition does not increased.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.4
• /
• pp.406-412
• /
• 2001

IP address lookup is to determine the next hop destination of an incoming packet in the router. The address lookup is a major bottleneck in high performance router due to the increased routing table sizes, increased traffic, higher speed links, and the migration to 128 bits IPv6 addresses. IP lookup time is dependent on data structure of lookup table and search scheme. In this paper, we propose a new approach to build a lookup table that satisfies the memory constraint. The design of lookup table is formulated as an optimization problem. The objective is to minimize average depth from the root node for lookup. We assume that the frequencies with which prefixes are accessed are known and the data structure is level compressed trie with branching factor $\kappa$ at the root and binary at all other nodes. Thus, the problem is to determine the branching factor k at the root node such that the average depth is minimized. A heuristic procedure is proposed to solve the problem. Experimental results show that the lookup table based on the proposed heuristic has better average and the worst-case depth for lookup.