• Journal of KIISE:Information Networking
• /
• v.33 no.6
• /
• pp.407-419
• /
• 2006

As substituting IPv6 network for all IPv4 network in a short time seems unattainable due to high cost and technical limitation, IPv4 and IPv6 are expected to coexist for a certain period of time. Under the co]existing environment of IPv4 and IPv6, interworking brings a number of extra security considerations even if it may have no security problem for each protocol respectively. Thus, the analysis and solutions for those various attacks toward IPv4/IPv6 interworking-related security are inevitably required for the sake of effective transition and settlement to IPv6. In this paper we carried out a proper rule of packet filtering for IPv6-in-IPv4 tunneling interworking environment to protect the IPv4/IPv6 interworking-related security attacks. Design and implementation of the packet filtering system suitable for IPv4/IPv6 tunneling environment in the form of Linux netfilter and ip6tables are also shown. Thru this study, the packet filtering system was found operating correctly ill the tunneling mechanism.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.22 no.4
• /
• pp.26-34
• /
• 2008

This study focus on segmentation process that classifies road surfaces into 5 different categories, dry, wet water, icy, and snowy surfaces by analyzing asphalt-paved road images taken in daylight. By using the polarization coefficients, the proportions of horizontally polarized components to vertically polarized components, regions with over 1.3 polarization coefficients are classified as wet surfaces. Except for wet surfaces, the decision process a lies time-frequency analysis to other parts by using the third order wavelet packet transform. In addition, by using the average frequency characteristics of dry and icy surfaces from image templates, decide which is closer to a test image, and finally identify dry and icy surfaces. It is confirmed that the reposed estimation and segmentation of recognition on various images. This can be interpreted as an indication that image-only mad surface condition supervision is probable.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.2
• /
• pp.439-446
• /
• 2011

In this paper, we proposed and implemented a dedicated hardware for Huffman coding which is a method of entropy coding to use compressing multimedia data with video coding. The proposed Huffman codec consists Huffman encoder and decoder. The Huffman encoder converts symbols to Huffman codes using look-up table. The Huffman code which has a variable length is packetized to a data format with 32 bits in data packeting block and then sequentially output in unit of a frame. The Huffman decoder converts serial bitstream to original symbols without buffering using FSM(finite state machine) which has a tree structure. The proposed hardware has a flexible operational property to program encoding and decoding hardware, so it can operate various Huffman coding. The implemented hardware was implemented in Cyclone III FPGA of Altera Inc., and it uses 3725 LUTs in the operational frequency of 365MHz

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.12
• /
• pp.2975-2981
• /
• 2014

Micro-magnetic detection system is used to detect small particles in an automatic transmission valve body, which signal noise and time-delay may occurs in process of signal transmitting and filtering. In this paper, we present the design and implement of a micro-magnetic detection system based on wireless sensor networks in conveyer belt. Micro-magnetic detection system consists of five modules which are magnetic sensor detector, signal processing unit, wireless sensor networks, system control unit and system monitoring unit. Our experimental results show that the proposed wireless micro-magnetic detection system improves both accuracy and time delay compared to the wired system; therefore, it may apply for wireless micro-magnetic detection system by analysis of packet reception rate.

• Journal of Korea Society of Industrial Information Systems
• /
• v.29 no.1
• /
• pp.63-76
• /
• 2024

In this study, we analyzed queue length and sojourn time of discrete-time BMAP/G/1 queues under the workload control. Group customers (packets) with correlations arrive at the system following a discrete-time Markovian arrival process. The server starts busy period when the total service time of the arrived customers exceeds a predetermined workload threshold D and serves customers until the system is empty. From the analysis of workload and waiting time, distributions of queue length at the departure epoch and arbitrary time epoch and system sojourn time are derived. We also derived the mean value as a performance measure. Through numerical examples, we confirmed that we can obtain results represented by complex forms of equations, and we verified the validity of the theoretical values by comparing them with simulation results. From the results, we can obtain key performance measures of complex systems that operate similarly in various industrial fields and to analyze various optimization problems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10A
• /
• pp.912-921
• /
• 2005

Optical burst switching(OBS) is a promising solution for building terabit optical routers and realizing If over WDM. Channel scheduling Algorithm for reduce contention is one of the major challenges in OBS. We address the issue of how to provide basic burst channel scheduling in optical burst switched WDM networks with fiber delay lines(FDLs). In OBS networks the control and payload components or a burst are sent separately with a time gap. If CHP arrives to burst switch node, because using scheduling algorithm for data burst, reservation resources such as wavelength and transmit data burst without O/E/O conversion, because contention and void between burst are happened at channel scheduling process for data burst that happened the link utilization and bust drop probability Existent proposed methods are become much research to solve these problems. Propose channel scheduling algorithm that use Release Time of bust to emphasize clearance between data and data dissipation that is happened in data assignment in this treatise and maximize bust drop probability and the resources use rate (RTUC : Release Time Unscheduled Channel). As simulation results, Confirmed that is more superior in terms of data drop and link utilization than scheduling algorithm that is proposed existing. As simulation results, confirmed improved performance than scheduling algorithm that is proposed existing in terms of survival of burst, efficiency resource and delay. However, In case load were less, degradation confirmed than existent scheduling algorithm relatively, and confirmed that is superior in data drop aspect in case of load increased.