• MALSORI
• /
• no.43
• /
• pp.101-112
• /
• 2002

In real time packetized voice application, missing packets are major source of voice quality degradation. Thus packet loss concealment (PLC) algorithms are needed to guarantee QoS of VoIP. In this paper, we describe packet loss concealment scheme utilizing the next good frame which follows loss packets. When this scheme is combined with other PLC algorithms, such as G.711 pitch waveform replication recommended by ITU-T LP based PLC algorithm, additional voice quality improvement is obtained for consecutive packet loss larger than 60 msec.

• Journal of the Korea Society for Simulation
• /
• v.11 no.1
• /
• pp.1-10
• /
• 2002

IETF proposed Fast Handover mechanism tn reduce the latency during which the mobile node is effectively dusconnected from the Internet. In this paper, we propose three buffering strategies and a bicasting strategy to resolve packet loss and packet disordering problems in Fast Hangover mechanism. Through Java-based simulation we show thats, packet loss and disordering problems have been resolved by our proposal. As the result the buffering and bicasting strategies can reduce the handover delay caused by packet loss and packet disordering, in addition.

• Proceedings of the KSPS conference
• /
• 2003.10a
• /
• pp.109-112
• /
• 2003

In real time packetized voice applications, missing frames is a major source of voice quality degradation. Thus packet loss concealment(PLC) algorithms are needed to guarantee the QoS of the VoIP. Still current speech codecs for VoIP work poor when consecutive packet losses are issued. In this paper, we proposed a new PLC algorithm for the G.729 codec. Our algorithm works better especially when the consecutive packet loss occurs mainly because it adopts an adaptive gain controller utilizing the number of missing packet information combined with a fixed codebook vector estimation algorithm and LPC bandwidth expansion.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.118-123
• /
• 2009

In this paper, we propose packet selection and significance based interval allocation algorithm for real-time streaming service. In real-time streaming of inter-frame (and layer) coded video, minimizing packet loss does not imply maximizing QoS. It is true that packet loss adversely affects the QoS but one single packet can have more impact than several other packets. We exploit the fact that the significance of each packet loss is different from the frame type it belongs to and its position within GoP. Using packet dependency and PSNR degradation value imposed on the video from the corresponding packet loss, we find each packet's significance value. Based on the packet significance, the proposed algorithm determines which packets to send and when to send them. The proposed algorithm is tested using publicly available MPEG-4 video traces. Our scheduling algorithm brings significant improvement on user perceivable QoS. We foresee that the proposed algorithm manifests itself in last mile connection of the network where intervals between successive packets from the source and to the destination are well preserved.

• The Journal of the Acoustical Society of Korea
• /
• v.29 no.1
• /
• pp.34-40
• /
• 2010

As internet spread widely, various service which use the internet have been provided. One of the service is a internet phone. Its usage is increasing by the advantage of cost. But it has a falling off in quality of speech. because it use packet switching method while existing telephone use circuit switching method. Although vocoder use PLC (Packet Loss Concealment) algorithm, it has a weakness of continuous packet loss. In this paper, we propose methods to improve a lowering in quality of speech under continuous loss of packet by using PLC algorithm used in advanced G.729 and G.711. The proposed methods are LP (Linear Prediction) parameter interpolation, excitation signal reconstruction and excitation signal gain reconstruction. As a result, the proposed method shows superior performance about 11%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10C
• /
• pp.950-958
• /
• 2007

This paper presents an efficient packet loss resilient scheme for real-time video transmission over the Internet. By analyzing the temporal and spatial dependencies in inter- and intra-frames, we assign forward error correction codes (FEC) across video packets for minimizing the effect of error concealment and error propagation from packet loss. To achieve optimal allocation of FEC codes, we formulate the effect of packet loss on video quality degradation as packet distortion model. Then we propose an unequal FEC assignment scheme with low complexity based on packet correction rate, which uses the packet distortion model and includes channel status information. Simulation results show that the proposed FEC assignment scheme gives substantial improvement for the received video quality in packet lossy networks. Furthermore the proposed scheme achieves relatively smaller degradation of video quality with higher packet loss rates.

• MALSORI
• /
• no.57
• /
• pp.175-189
• /
• 2006

Because a packet loss brings about degradation of speech quality, VoIP speech coders have PLC (Packet Loss Concealment) mechanism. G.711, which is a mandatory VoIP speech coder, also has the PLC algorithm based on pitch period replication. However, it is not robust to burst losses. Thus, we propose two methods to improve the performance of the original PLC algorithm in G.711. One adaptively utilizes voiced/unvoiced information of adjacent good frames regarding to the current lost frame. The other is based on adaptive gain control according to energy variation across the frames. We evaluate the performance of the proposed PLC algorithm by measuring a PESQ value under different random and burst packet loss simulating conditions. It is shown from the experiments that the performance of the proposed PLC algorithm outperforms that of PLC employed in ITU-T Recommendation G.711.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.10a
• /
• pp.127-132
• /
• 1999

A mobile IP is proposed to support host mobility over the current Internet. One of the most important issues on the host mobility is location and routing schemes that allow mobile hosts to move effectively from one site to another. In a Mobile IP environment, frequent handoffs are likely to degrade the performance by minimizing the loss of datagrams during handoffs. The handoff scheme is using routing optimization and binding extension to improve the performance by minimizing the average transfer delay of messages and packet loss. Simulation details show the improvement of transport delays and packet loss rate.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.5
• /
• pp.957-962
• /
• 2013

This paper proposes the new enhanced 2-D(2-Dimension) FEC scheme. It analyzes the probability of entire packet loss rate of the existing 2-D FEC by mathematical modeling, finds the problem of the existing 2-D FEC, and deduces the new enhanced 2-D FEC scheme that reduces the entire packet loss probability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7B
• /
• pp.477-487
• /
• 2008

Congestion control of the TCP reduces transmission rate when it detects packet loss because packet loss origines from congestion in the wired network. In the wireless network, packet loss comes from channel errors. Wired TCP degrades performance when there are wireless losses because it does not classify type of loss. These day, there are many researches which classify type of loss between congestion loss and wireless loss for wired-wireless hybrid network. For wireless TCP, many of existing algorithms are based on the estimated bandwidth or variations of packet arrival time. In this paper, we propose a new TCP scheme to distinguish the wireless packet losses from the congestion packet losses using MIB of the IEEE 802.11 MAC. We perform excessive simulations using the NS-2 network simulator and analyze the simulation results to compare the performance of the proposed algorithm to other well-known algorithms. From simulation results, we know that proposed algorithm improves performance about 12% and 32% compared with Spike algorithm and mBiaz algorithm, respectively.