• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.149-156
• /
• 2009

Korean WiBro becomes international standard to IEEE 802.16e, and We are carrying out a WiBro network business from capital regions. We executed eavesdropping about voices and messenger program and the VoIP which frequently happened in WiBro networks at these papers. We have a lot in common with the Wireshark which is a packet collection and an analyzer, and We execute eavesdropping, and We reproduce eavesdropping data with bases to a SIP, H.263, TCP, UDP protocol through packets. In time of a copy of a packet negative the VoIP which verify time with bases, and was eavesdropped on integrity packet and a X-Lite call record, be matched that a packet is counterfeit forgery did not work, and We demonstrate, and verify integrity. The data which integrity was verified put in a seaming envelope, and we prepare so as it is to a liver of investigator, and execute, and to be able to do use to proof data after seaming in courts in order to utilize as criminal investigation data.

• Journal of the Korean Professional Engineers Association
• /
• v.28 no.3
• /
• pp.121-134
• /
• 1995

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 unit con-trol devices located In common manufacturing zone and operated by connecting them. The network management system, which controls and supervises the network resources in the communication network, is the function that is necessarily required in this net-work. 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 token rotation time and waiting time for the network operation. On the evalution of the performance, the data packet length varies from 10 bytes to 100 bytes in the operation of the group manage-ment network, the variation of the token rotation time and waiting time is less than 10 msec. When the variation of the data packet lenhth is less than 50 bytes, differences in token rotation time or waiting time is unnoticable. Since the waiting time in this case is less than 10 msec, response time Is fast enough.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.327-332
• /
• 2016

The routing protocol for low-power and lossy networks (RPL) is an internet protocol based routing protocol developed and standardized by IETF in 2012 to support a wide range of applications for low-power and lossy-networks (LLNs). In LLNs consisting of resource-constrained devices, the energy consumption of battery powered sensing devices during network operations can greatly impact network lifetime. In the case of inefficient route selection, the energy depletion from even a few nodes in the network can damage network integrity and reliability by creating holes in the network. In this paper, a composite energy-aware node metric ($RER_{BDI}$) is proposed for RPL; this metric uses both the residual energy ratio (RER) of the nodes and their battery discharge index. This composite metric helps avoid overburdening power depleted network nodes during packet routing from the source towards the destination oriented directed acyclic graph root node. Additionally, an objective function is defined for RPL, which combines the node metric $RER_{BDI}$ and the expected transmission count (ETX) link quality metric; this helps to improve the overall network packet delivery ratio. The COOJA simulator is used to evaluate the performance of the proposed scheme. The simulations show encouraging results for the proposed scheme in terms of network lifetime, packet delivery ratio and energy consumption, when compared to the most popular schemes for RPL like ETX, hop-count and RER.

• Proceedings of the Optical Society of Korea Conference
• /
• 2009.02a
• /
• pp.307-308
• /
• 2009

To reduce delay for high priority packets in the ring-based EPON, the EPON packet classifier groups services as their priorities and frames for services are dynamically framed as their priorities. Since dynamic framing for a packet priority dynamically changes assignment spaces in the maximum framing packet size as network traffics, it makes services with high priority to improve quality of services with relative low threshold time for transmitting.

• ETRI Journal
• /
• v.16 no.3
• /
• pp.27-41
• /
• 1994

This paper provides a performance study of multistage interconnection networks in packet switching environment. In comparison to earlier work, the model is more extensive - it includes several parameters such as multiple-packet messages, variable buffer size, and wait delay at a source. The model is also uniformly applied to several representative networks and thus provides a basis for fair comparison as well as selection of optimal values for parameters. The complexity of the model required use of simulation. However, a partial analytical model is provided to measure the congestion in a network.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.397-399
• /
• 2005

Handover is one of the most important factors that may degrade the performance of TCP connections and real-time applications in wireless data networks. We proposed a seamless handover with Motion Prediction in IEEE 802.16e-based broadband wireless access networks. By intergrating MAC and network layer handovers efficiently, this scheme minimizes the handover delay and eliminates packet losses during handover Simulations show that this scheme achieves loss-free packet delivery without packet duplication and increases TCP throughput significantly.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.40.1-40
• /
• 2001

In this paper, control theoretic approaches are proposed to guarantee QoS (Quality of Series) such as packet delay and packet loss of real-time traffic in high-speed communication network. Characteristics of variable rate real-time traÆc in communication networks are described. The mathematical model describing networks including source and destination nodes are suggested. By a traffic control mechanism, it is shown that worst-case end-to-end transfer delay of traffic can be controlled and packet loss can be prevented. The simulation shows results of delay control and buer level control to raise QoS in realtime traffic.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.477-480
• /
• 2003

Packet losses in the Internet can dramatically degrade quality of multimedia streams. Forward Error Correction (FEC) is one of the best methods that can protect data from packet erasures by means of sending additional redundant information. Proposed control algorithm provides the possibility of receiving real-time multimedia streams of given quality wifth minimal traffic overhead. The traffic optimization is reached by adjusting packet size as well as block code parameters. Calculations and simulation results show that for non-bursty network conditions traffic optimization can lead to more than 50% bandwidth reduction.

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• pp.77-80
• /
• 2003

Complying with highly demand of information through internet. the utility of computer and network is rapidly provided with to schools. This situation brings about many problems. For example, the stolen information through false identification(Hacking) is the most greatest concern. In this paper it tells that the efficient way of preservating computer use is by using operating system of Open Source, which is Linux system. Further more, it shows the system which was organized by IP-Tabling (offered service-Packet Filtering method from the Linux system) functions well as a security system.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2097-2100
• /
• 2003

Many studies have been done on secure operating system using secure kernel that has various access control policies for system security. Secure kernel can protect user or system data from unauthorized and/or illegal accesses by applying various access control policies like DAC(Discretionary Access Control), MAC(Mandatory Access Control), RBAC(Role Based Access Control), and so on. But, even if secure operating system is running under various access control policies, network traffic among these secure operating systems can be captured and exposed easily by network monitoring tools like packet sniffer if there is no protection policy for network traffic among secure operating systems. For this reason, protection for data within network traffic is as important as protection for data within local system. In this paper, we propose a secure operating system trusted channel, SOSTC, as a prototype of a simple secure network protocol that can protect network traffic among secure operating systems and can transfer security information of the subject. It is significant that SOSTC can be used to extend a security range of secure operating system to the network environment.