• ETRI Journal
• /
• v.22 no.4
• /
• pp.40-50
• /
• 2000

We apply a "sliding-window" Maximum Likelihood(ML) estimator to estimate traffic parameters On-Off source and develop a method for estimating stochastic predicted individual cell arrival rates. Based on these results, we propose a simple Connection Admission Control(CAC)scheme for delay sensitive services in broadband onboard packet switching satellite systems. The algorithms are motivated by the limited onboard satellite buffer, the large propagation delay, and low computational capabilities inherent in satellite communication systems. We develop an algorithm using the predicted individual cell loss ratio instead of using steady state cell loss ratios. We demonstrate the CAC benefits of this approach over using steady state cell loss ratios as well as predicted total cell loss ratios. We also derive the predictive saturation probability and the predictive cell loss ratio and use them to control the total number of connections. Predictive congestion control mechanisms allow a satellite network to operate in the optimum region of low delay and high throughput. This is different from the traditional reactive congestion control mechanism that allows the network to recover from the congested state. Numerical and simulation results obtained suggest that the proposed predictive scheme is a promising approach for real time CAC.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.98-107
• /
• 2008

In mobile ad hoc networks, packet loss is unavoidable due to MAC contention, link failure or the inherent characteristics of wireless link. Since TCP relies on the timely reception of TCP ACK packets to progress the transmission of the TCP DATA packets, ACK loss obviously affects the performance due to two main problems: (a) Frequent occurrence of spurious retransmissions caused by timeout events and (b) impairment of the fast retransmit mechanism caused by the lack of a sufficient number of duplicate ACK packets. In particular, since most reactive routing protocols force the packets buffered over a path to be discarded while performing a route recovery, the performance degradation becomes more serious due to such ACK loss. In this paper, therefore, TCP with two piggybacking schemes (called TCP-pgy) is proposed in order to resolve the above-mentioned problems over reactive routing protocols. Through extensive simulations using the ns-2 simulator, we prove that our proposed schemes contribute to TCP performance improvements.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.212-212
• /
• 2004

• Journal of Broadcast Engineering
• /
• v.25 no.4
• /
• pp.609-619
• /
• 2020

In accordance with a demand for high quality video streaming, it needs high data rate in limited bandwidth and more traffic congestion occurs. In particular, when providing real time video service, packet loss rate and bit error probability increase significantly. To solve these problems, a raptor code, which is one of FEC(Forward Error Correction) techniques, is pervasively used in the application layers as a method for improving real-time service quality. In this paper, we propose a method of determining image transmission parameters based on various deep neural networks to increase transmission efficiency at a similar level of image quality by using raptor codes. The proposed neural network uses the packet loss rate, video encoding rate and data rate as inputs, and outputs raptor FEC parameters and packet sizes. The results of the proposed method present that the throughput is 1.2% higher than that of the existing multimedia transmission technique by optimizing the transmission efficiency at a PSNR(Peak Signal-to-Noise Ratio) level similar to that of the existing technique.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.1
• /
• pp.1-10
• /
• 2008

Coloriztion algorithms, which hide color information into gray images and find them to recover color images, have been developed recently. In these methods, it is important to minimize the loss of original information while the color components are embedded and extracted. In this paper, we propose a colorization method using a wavelet packet transform in order to embed color components with minimum loss of original information. In addition, the compensation processing of color saturation in the recovered color images is achieved. In the color-to-gray process, an input RGB image is converted into Y, Cb, and Cr images, and a wavelet packet transform is applied to the Y image. After analyzing the amounts of total energy for each sub-band, color components are embedded into two sub-bands including minimum amount of energy on the Y image. This makes it possible not only to hide color components in the Y image, but to recover the Y image with minimum loss of original information. In the gray-to-color process, the color saturation of the recovered color images is decreased by printing and scanning process. To increase color saturation, the characteristic curve between printer and scanner, which can estimate the change of pixel values before and after printing and scanning process, is used to compensate the pixel values of printed and scanned gray images. In addition, the scaling method of the Cb and Cr components is applied to the gray-to-color process. Through the experiments, it is shown that the proposed method improves both boundary details and color saturation in the recovered color images.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.34-41
• /
• 2009

This paper investigates the issue of efficient reading for sensor data of semi-passive sensor tag. The Cold Chain management system requires complete sensor data without data loss and the short processing time of reading sensor tag data. However, reading the sensed data could be interfered by RF environment such as a jamming, obstacle and so on. This study found that it could lead to loss of the sensed data and takes much time to read it when data loss is occurred. To solve this problem, we propose the transaction processing mechanism that guarantees efficient reading of the sensed data. To do this, we present the technique of dynamic packet size and technique of data recovery to execute read transaction. These techniques improve the reliability of reading operation as well as speed up of read process for the large capacity data. This paper contributes to the improvement of efficient reading of sensed data without any loss of data and large time required.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.95-102
• /
• 2003

The buffering is a promising solution to resolve the contention problem in optical network. we study the packet loss probability and the dimensioning of optical buffer using a Fiber Delay Line for variable length packet. In this paper, we study the relation between the granularity and the loss of FDL buffer in Single-Stage FDL buffer and propose the Single-Bundle Multi-Stage FDL buffer. The Multi-Stage FDL buffer is too early yet to apply to the current backbone network, considering the current technology in view of costs. but we assume that the above restriction will be resolved in these days. The appropriate number of delay and pass line for a dimensioning is based on a amount of occupied time by packets. Once more another multi-stage FDL buffer is proposed, Split-Bundle multi-stage FDL buffer. The Split-Bundle ms-FDL buffer is more feasible for a FDL buffer structure, considering not only a size of switching matrix but also a bulk of switching element. its feasibility will be demonstrated from a loss probability.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11S
• /
• pp.3684-3693
• /
• 2000

In this paper, performance of a nonblocking high speed packet switch with switching capacity m which adopts a dynamic priority control function (DPCF) of a threshold- based Bernoulli priority jump (TBPJ) scheme is considered. Each input queue has two separate buffers with different sizes for two classes of traffics, delay-sensitive and loss-sensitive traffics, and adopts a TBPJ scheme that is a general state-dependent Bernoulli scheduling scheme. Under the TBP] scheme, a head packet of the delay-sensitive traffic buffer goes into the loss -sensitive traffic buffer with Hernoulli probability p according to systems states that represent the buffer thresholds and the number of packets waiting for scheduling. Performance analysis shows that TBPJ scheme obtains large performance build-up for the delay-sensitive traffic without performance degradation for the loss-sensitive traffic. In addition to, TBP] scheme shows better performance than that of HOL scheme.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1915-1919
• /
• 2003

A practical method of adaptive rate allocation to source and channel codings for an independent loss channel is proposed for Internet video. It is based on the observations that the values of residual loss probabilities at the optimal code rates for different packet loss probabilities are closely clustered to the average residual loss probability for a transmission frame size n in RS(n,k) code and for a total bit rate R. These observations aye then exploited to find the code rate for maximum PSNR. Simulation results demonstrate that the proposed method achieves a near-optimal bit-rate allocation in the joint source-channel coding of H.263 and RS(n,k) codings.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.1
• /
• pp.15-20
• /
• 2010

This paper proposes a multihoming-based vertical handover scheme using Proxy binding update to minimize handover delay and packet loss while a mobile node moves to a heterogeneous access network. When a mobile node moves to a heterogeneous access network, the proposed scheme can provide a mobile node with fast and seamless handover by performing layer-3 handover using its new interface while the other interface is still communicating in the old access network. The proposed Proxy binding update is different from the Mobile IP binding update in that it includes home addres (HoA) of the old interface instead of the new interface. The performance analysis shows that the proposed scheme can efficiently reduce vertical handover delay and packet loss.