• The Transactions of the Korea Information Processing Society
• /
• v.7 no.6
• /
• pp.1949-1955
• /
• 2000

This paper proposes a multistage interconnection ATM switching network without internal blocking. The first is recirculating shuffle-exchange network improved on hardware complexity. The next is connected to Rank network with tree structure. In this network, after the packets transferred to the same output ports are given each priority, only a packet with highest priority is sent to the next, an the others are recirculated to the first. Rearrangeability through decomposition and composition algorithm is applied for the transferred packets in hanyan network and all they arrive at a final destinations. To analyze throughput, waiting time and packet loss ratio according tothe size of buffer, the probabilities are modeled by a binomial distribution of packet arrival.

• Journal of the Optical Society of Korea
• /
• v.18 no.5
• /
• pp.466-471
• /
• 2014

An asynchronous optical packet-switching (AOPS) node with load-balancing capability can achieve better performance in reducing the high packet-loss ratio (PLR) and time delay caused by unbalanced traffic. This paper proposes a novel dynamic load-balancing algorithm for an AOPS node with limited buffer and without wavelength converters, and considering the data flow distribution and service levels. By calculating the occupancy state of the output ports, load state of the input ports, and priorities for data flow, the traffic is balanced accordingly. Simulations demonstrate that asynchronous variant data packets and output traffic can be automatically balanced according to service levels and the data flow distribution. A PLR of less than 0.01% can be achieved, as well as an average time delay of less than 0.46 ns.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1602-1605
• /
• 2002

Communication schemes are currently changing from circuit switched towards packet switched. These changes enable access to Internet and multimedia services in wireless network. Provision of real-time IP services in air interface introduces relatively large overhead in RTP/UDP/IP headers. To reduce the overhead, the header compression schemes are required. There exist two header compression schemes (CRTP, ROHC) which are IETF standards. We propose Context-ID detection method which reduces more efficiently the packet loss rate than two existing schemes. Its performance in WCDMA system environment is evaluated for CRTP and ROHC schemes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.222-225
• /
• 2002

The watermarking on medical images with wavelet packet is presented. The wavelet packet produces the enhancing the resolution from low to high band that minimize the loss on the band. The result on experiment is that PSNR is 0.1dB on image quality and PSNR is 28dB on the durability in compressed ratio 60% over. This proposal allows an enhancing and robust image to stand and oppose the distortion and modification by intention.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1433-1436
• /
• 2004

The ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure of centralized administration. Load-Balanced Ad hoc Routing(LBAR) protocol is an on-demand routing protocol intended for delay-sensitive applications where users are most concern with packet transmission delay. Although LBAR mechanism is a novel load balancing routing protocol for ad hoc network, it has own limitation in route path maintenance phase. Therefore, in this paper, we propose Advanced Load-Balanced Ad hoc Routing(A-LBAR) that is delay-sensitive and has an efficient path maintenance scheme. The robust path maintenance scheme is maintained by considering about nodal loads all over network and misbehavior of overloaded or selfish nodes. The proposed scheme provides good performance over DSR and AODV in terms of packet delay and packet loss rate when some misbehaving nodes exist in the network.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.287-289
• /
• 2013

Fast Handover for Proxy Mobile IPv6 (FPMIPv6), a protocol described in RFC 5949, is used to reduce handover latency and minimize packet loss problem occuring in the Proxy Mobile IPv6 (PMIPv6) protocol. However, during the study of implementing FPMIPv6, we found the Out-of-Order Packet (OoOP) problem that occurs in the experiment of FPMIPv6. Since the OoOP is an issue that affects significantly to QoS of the network, in this paper, we analyze the OoOP problem by using network model. The analysis conducts the cause of occurring OoOP problem due to there exist two paths for data transmitted from Correspondent Node (CN) to MN in FPMIPv6.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.473-480
• /
• 2002

Although many researches on IDS (Intrusion Detection System) have been performed, the most of them are limited to the algorithm of detection software. However, even an IDS with superior algorithm can not detect intrusion, if it loses packets which nay have a clue of intrusions. In this paper, we suggest an efficient wav to improve the performance of IDS by reducing packet losses occurred due to hardware limitation and abundant processing overhead introduced by massive detection software itself. The reduction in packet losses is achieved by dropping hacking-free packets. The result shows that this decrease of packet losses leads an IDS to improve the detection rate of real attack.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.9
• /
• pp.1492-1512
• /
• 2011

Due to multiple hops, mobility and time-varying channel, supporting delay sensitive real-time traffic in wireless local area network-based (WLAN) mesh networks is a challenging task. In particular for real-time traffic subject to medium access control (MAC) layer control overhead, such as preamble, carrier sense waiting time and the random backoff period, the performance of real-time flows will be degraded greatly. In order to support real-time traffic, an efficient adaptive packet scheduling (APS) scheme is proposed, which aims to improve the system performance by guaranteeing inter-class, intra-class service differentiation and adaptively adjusting the packet length. APS classifies incoming packets by the IEEE 802.11e access class and then queued into a suitable buffer queue. APS employs strict priority service discipline for resource allocation among different service classes to achieve inter-class fairness. By estimating the received signal to interference plus noise ratio (SINR) per bit and current link condition, APS is able to calculate the optimized packet length with bi-dimensional markov MAC model to improve system performance. To achieve the fairness of intra-class, APS also takes maximum tolerable packet delay, transmission requests, and average allocation transmission into consideration to allocate transmission opportunity to the corresponding traffic. Detailed simulation results and comparison with IEEE 802.11e enhanced distributed channel access (EDCA) scheme show that the proposed APS scheme is able to effectively provide inter-class and intra-class differentiate services and improve QoS for real-time traffic in terms of throughput, end-to-end delay, packet loss rate and fairness.

• ETRI Journal
• /
• v.34 no.6
• /
• pp.827-837
• /
• 2012

We propose a flow admission control (FAC) for setting up a wire-speed connection for new flows based on their negotiated bandwidth. It also terminates a flow that does not have a packet transmitted within a certain period determined by the users. The FAC can be used to provide a reliable transmission of user datagram and transmission control protocol applications. If the period of flows can be set to a short time period, we can monitor active flows that carry a packet over networks during the flow period. Such powerful flow management can also be applied to security systems to detect a denial-of-service attack. We implement a network processor called a flow management network processor (FMNP), which is the second generation of the device that supports FAC. It has forty reduced instruction set computer core processors optimized for packet processing. It is fabricated in 65-nm CMOS technology and has a 40-Gbps process performance. We prove that a flow router equipped with an FMNP is better than legacy systems in terms of throughput and packet loss.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.2
• /
• pp.121-127
• /
• 2007

Frequent occurrences of a fire cause tremendous loss of human lives and their property. Recently, in order to cope with such catastrophic accidents, researches on fire-fighting robots are carried out in developed countries. Under the dangerous situations, it is sometimes impossible for fire-fighting men to access the firing place because of explosive materials, smoke, high temperature and so on. In such an environment, fire-fighting robots can be useful to extinguish the fire. It is usually very dangerous place where fire-fighting robots operate. Hence, these robots should be controlled by remote users who are for away from the firing place exploiting remote communication systems. This paper considers the communication systems between fire-fighting robots and remote users. The communication systems consist of two parts; digital packet communication systems and analog image communication systems. Digital packet communication systems transfer data packets in order to control fire-fighting robots and to check the state of the fire-fighting robots. Remote users watch the video around the fire-fighting robots by exploiting the analog image communication systems. In the future, the more prosperous the commercial communication network systems will be, the more evolved the communication systems for fire-fighting robots are.