• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.6
• /
• pp.736-745
• /
• 2002

In network delivery of compressed video, packets may be lost if the channel is unreliable like Internet. Such losses tend to of cur in burst like continuous bit-stream error. In this paper, we propose an effective error-concealment approach to which an error resilient video encoding approach is applied against burst errors and which reduces a complexity of error concealment at the decoder using data hiding. To improve the performance of error concealment, a temporal and spatial error resilient video encoding approach at encoder is developed to be robust against burst errors. For spatial area of error concealment, block shuffling scheme is introduced to isolate erroneous blocks caused by packet losses. For temporal area of error concealment, we embed parity bits in content data for motion vectors between intra frames or continuous inter frames and recovery loss packet with it at decoder after transmission While error concealment is performed on error blocks of video data at decoder, it is computationally costly to interpolate error video block using neighboring information. So, in this paper, a set of feature are extracted at the encoder and embedded imperceptibly into the original media. If some part of the media data is damaged during transmission, the embedded features can be extracted and used for recovery of lost data with bi-direction interpolation. The use of data hiding leads to reduced complexity at the decoder. Experimental results suggest that our approach can achieve a reasonable quality for packet loss up to 30% over a wide range of video materials.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1063-1079
• /
• 2010

Vehicle ad hoc networks (VANET) are one of the most important technologies to provide various ITS services. While VANET requires rapid and reliable transmission, packet transmission in VANET is unstable because of high mobility. Many routing protocols have been proposed and assessed to improve the efficiency of VANET. However, topology-based routing protocols generate heavy overhead and long delay, and position-based routing protocols have frequent packet loss due to inaccurate node position. In this paper, we propose a position-based routing repair algorithm to improve the efficiency of VANET. This algorithm is proposed based on the premise that AODV (-PGB) can be used effectively in VANET, if the discovery, maintenance and repair mechanism of AODV is optimized for the features of VANET. The main focus of this algorithm is that the relay node can determine whether its alternative node exits and judge whether the routing path is disconnected. If the relay node is about to swerve from the routing path in a multi-hop network, the node recognizes the possibility of path loss based on a defined critical domain. The node then transmits a handover packet to the next hop node, alternative nodes and previous node. The next node repairs the alternative path before path loss occurs to maintain connectivity and provide seamless service. We simulated protocols using both the ideal traffic model and the realistic traffic model to assess the proposed algorithm. The result shows that the protocols that include the proposed algorithm have fewer path losses, lower overhead, shorter delay and higher data throughput compared with other protocols in VANET.

• Publications of The Korean Astronomical Society
• /
• v.29 no.3
• /
• pp.45-52
• /
• 2014

This paper describes the development of algorithm for direct data transmission between Raw VLBI Data Buffer (RVDB) and Huge Capacity Data Server (HCDS) operated in Korea-Japan Correlation Center (KJCC). The transmitted data is the VLBI observation data, which is recorded at each radio telescope site, and the data transmitting rate is varying from 1 Gbps, in usual case, upto 8 Gbps. The developed algorithm for data transmission enables the direct data transmission between RVDB and HCDS through 10 Gbps optical network using VLBI Data Interchange Format (VDIF). Proposed method adopts the conventional UDP/IP protocol, but in order to prevent the loss of data during data transmission, the packet error monitoring and data re-transmission functions are newly designed. The VDIF specification and VDIFCP (VDIF Control Protocol) are used for the direct data transmission between RVDB and HCDS. To validate the developed algorithm for data transmission, we conducted the data transmission from RVDB to HCDS, and compared to the transmitted data with the original data bit by bit. We confirmed that the transmitted data is identical to the original data without any loss and it has been recovered well even if there were some packet losses.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.649-655
• /
• 2003

Network-based computing such as cluster computing requires a reliable high-speed transport protocol. TCP is a representative reliable transport protocol on the Internet, which implements many mechanisms, such as flow control, congestion control, and retransmission, for reliable packet delivery. This paper, however, finds out that Myrinet does not incur any packet losses caused by network congestion. In addition, we ascertain that Myrinet supports reliable and ordered packet delivery. Consequently, most of reliable routines implemented in TCP produce unnecessarily additional overheads on Myrinet. In this paper, we show that we can attain the reliability only by flow control on Myrinet and propose a new reliable protocol based on UDP named RUM (Reliable UDP on Myrinet) that performs a flow control. As a result, RUM achieves a higher throughput by 45% than TCP and shows a similar one-way latency to UDP.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.9
• /
• pp.1764-1770
• /
• 2007

The binding update of MIPv6 which basically makes a route optimization lets MN bring about high signaling traffic, packet loss and delay. HMIPv6, which introduces the MAP protocol, makes the signaling traffic low, thereby reducing the packet losses and delay. However, it still has the same problem in MIPv6 in the case of macro mobility. This paper proposes HMIPv6 with the address insurance policy. It makes MAP prepare LCoA and RCoA before the macro handover happens. When it happens, MN is able to use them after the registration is done in the foreign network. The perormance can be improved because MAP is composed to assure the address in advance. In addition the MAP sends the BU message during the handover, thereby making the proposed scheme better. The simulation shows that the proposed scheme is about 33% shorter than HMIPv6 in the handover delay and about 22% less than FMIPv6 in the packet loss.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.197-212
• /
• 2002

Transmission Control Protocol (TCP) [1] has been tuned as a reliable transfer protocol for traditional networks comprising wired links and stationary hosts with same link characteristics. TCP assumes that congestion in the network be a primary cause for packet losses and unusual delays. TCP performs welt over such networks adapting to end-to-end delays and congestion losses, by standard congestion control mechanisms, such as slow-start, congestion avoidance, fast retransmit and recovery. However, networks with wireless and other lossy links suffer from significant losses due to bit errors and handoffs. An asymmetry network such as ADSL has different bandwidth for both directions. As a result, TCP's standard mechanisms incur end-to-end performance degradation in various links. In this paper, we analyze the TCP problems in wireless, satellite, and asymmetry links, and measure the new TCP mechanisms that are recommended by IETF Performance Implications of Link Characteristics (PILC) WG[2], by using Network Simulator 2 (NS-2).

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.341-344
• /
• 2005

Mobile IPv6(MIPv6) allows a Mobile Node to talk directly to its peers while retaining the ability to move around and change the currently used IP address. One of the major issues regarding the basic Mobile IPv6 protocol is related to the handover management of a mobile node. This paper proposes efficient approach for adaptation of MIPv6 sing context information in roaming environments. To investigate on a efficient and secure handover procedure, proposed approach method will give us the following advantages: (l)the intention of context is to reduce latency, packet losses and avoid re-initiation of signaling to and from mobile nodes,(2) FMIPv6 aims to reduce handover latency due to IP protocol operations as small as possible in comparison to the inevitable link switching latency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.689-698
• /
• 2008

The performance of a TCP protocol on MANETs has been studied in a numerous researches. One of the significant reasons of TCP performance degradation on MANETs is inability to distinguish between packet losses due to congestion from those caused by nodes mobility and as consequence broken routes. This paper presents the Cluster-Label-based Routing (CLR) protocol that is an attempt to compensate source of TCP problems on MANETs - multi-hop mobile environment. By utilizing Cluster-Label-based mechanism for Backbone, the CLR is able to concentrate on detection and compensation of movement of a destination node. The proposed protocol provides better goodput and delay performance than standardized protocols especially in cases of large network size and/or high mobility rate.

• ETRI Journal
• /
• v.29 no.6
• /
• pp.745-754
• /
• 2007

In this paper, we present the Enhanced Communication Transport Protocol-Part 5 (ECTP-5), which provides scalable and reliable multicast communication service for many-to-many applications by constructing high quality recovery trees from two-layer logical trees and repairing the losses via unicast automatic repeat request-based error control. In order to realize the protocol, we developed feasible protocol architectures and building blocks including additional functions which deal with engineering details, such as membership dynamics and sender coordination. Experimental results show that ECTP-5 scales well with various session sizes and packet loss rates in terms of control overhead and recovery latency.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.8
• /
• pp.816-822
• /
• 2010

In this paper, we propose an algorithm to improve TCP performance over wireless links. TCP is known to have poor performance over wireless links because TCP has no mechanism to differentiate congestion loss from wireless loss, and treats all losses as congestive. We present a simple method to determine the cause of packet loss using the successive ECN. In addition, we present an algorithm to control the congestion window size based on the estimated queue state in order to guarantee the fairness and high link utilization.