• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.8
• /
• pp.1928-1936
• /
• 1996

In this paper, we propose an adaptive bandwidth allocation algorithm for the transmission of VBR video through ATM Networks. In order to evaluate the required bandwidth for the VBR video, the characteristics of the compressed VBR video generated by the two-layered coder are analyzed with variations in the number of GOP(N), quantizer scale(q), and the number of low-frequency DCT coefficients(.betha.). The two-layer coder which is used to separate from the number of DCT coefficients is designed to transmit the VBR video efficiently. The compressed data generated by the two-layer coder are splitted into the high priority and low priority cells. If congestion is occurred in ATM networks, the minimum image quality is maintained by the high priority cells. The required bandwidth for VBR video is estimated with a prediction algorithm using the scene anframe correlations as well as the statistical properties of the VBR video sources. Strong correlation among the adjacent slices in a frame represents by the scene correlation andstrong correlation among the frames is represented by the frame correlation. The performance of the bandwidth allocation scheme proposed is evaluated in terms of the bandwith utilization, cell loss rate, and SNR with variations in q, n, .betha.. Simulation rewsults shown that the proposed scheme is superior to the conventional methods.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.4
• /
• pp.17-24
• /
• 2016

In this paper, we propose a AH LSU(Advanced Hybrid QoS Routing Link State Update) Algorithm that improves the performance of Hybrid LSU(Hybrid QoS Link State State Update) Algorithm with statistical information of flow holding time in network. AH LSU algorithm has had both advantages of LSU message control in periodic QoS routing LSU algorithm and QoS routing performance in adaptive LSU algorithm. It has the mechanism that calculate LSU message transmission priority using the flow of statistical request bandwidth and available bandwidth and include MLMR(Meaningless LSU Message Removal) mechanism. MLMR mechanism can remove the meaningless LSU message generating repeatedly in short time. We have evaluated the performance of the MLMR mechanism, the proposed algorithm and the existing algorithms on MCI simulation network. We use the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.134-146
• /
• 2005

Research about QoS in the ad-hoc networks for stable service of various applications has been needed as the expectation about the realization of the ad-hoc networks grows bigger. Existing researches about QoS in the ad-hoc network had the problems which can not guarantee the quantitative services or create the overhead. In this paper, we propose a novel algorithm of QFAN(QoS Framework for Ad-hoc Networks) the framework to resolve such problems and considered application of the proposed algorithm into the ad-hoc networks. Our model can guarantee the minimum bandwidth of the real-time traffic as minimized the overhead. And, disproportionate distribution of bandwidth problem can resolve by the proposed algorithm through the fair share between real-time traffic and best-effort traffic about available bandwidth. We design both the TiRe(Tiny Reservation) and the ADR(Adaptive Drop Rate) control algorithm to apply the proposed QFAN. Using simulation, we confirm fair share of available bandwidth between real-time traffic and best-effort traffic as guarantee minimum required bandwidth of real-time traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12B
• /
• pp.811-817
• /
• 2005

Efficient bandwidth management is necessary in order to provide high quality service to users in a multimedia wireless/mobile network. In this paper, I propose an on-line load balancing algorithm with preemption. This technique is able to balance the traffic load among cells accommodating heterogeneous multimedia services while ensuring efficient bandwidth utilization. The most important features of my algorithm are its adaptability, flexibility and responsiveness to current network conditions. In addition, my online scheme to control bandwidth adaptively is a cell-oriented approach. This approach has low complexity making it practical for real cellular networks. Simulation results indicate the superior performance of my algorithm.

• The Journal of Korea Robotics Society
• /
• v.11 no.2
• /
• pp.92-99
• /
• 2016

An electro-hydraulic actuator (EHA) is widely used in industrial motion systems and the increasing bandwidth of EHA position control is important issue. The model-inverse feedforward controller is known to extend the bandwidth of system. When the system has non-minimum phase (NMP) zeros, direct model inversion makes system unstable. To overcome this problem, an approximate model-inverse method is used. A representative approximate model inversion method is zero phase error tracking control (ZPETC). However, if zeros locate right half plane of z-plane, the approximate inverse model amplifies the high-frequency response. In this paper, to solve the problem of ZPETC, an adaptive model-inverse control is proposed. The adaptive algorithm updates feedforward term in real-time. The effectiveness of the proposed adaptive model-inverse position control strategy is verified by comparison with typical proportional-integral (PI) control and feedforward control by experiments. As a result, the proposed adaptive controller extends the bandwidth of EHA position control.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.1
• /
• pp.153-163
• /
• 2007

An adaptive framework paradigm where the bandwidth values of the ongoing calls vary according to the trafficsituations is one of the promising concepts for overcoming poor resource conditions due to handoffs in mobilecellular networks. However, quantifying the level of bandwidth degradation of the ongoing calls in an adaptiveframework is important in view of Quality of Service (QoS) Provisioning. Therefore we introduce new QoSparameters, the Degradation Degree Ratio (DDR), which represents the average portion of the degradationdegree during degradation pehod of a call, and the Degradation Area Ratio (DAR), which represents the averageratio of a call's degradation level considering both the period and the degree of degradation jointly in multi-levelbandwidth service. We also develop a new analytical model for estimating the QoS measures such as theDegradation Pehod Ratio (DPR), DDR and DAR. We show how to calculate the QoS measures and illustrate themethod by numerical examples. The proposed model can be used to determine the optimal parameter of theCAC scheme and analyze the sensitivity ofthe QoS parameters in adaptive networks.

• Journal of electromagnetic engineering and science
• /
• v.4 no.1
• /
• pp.23-29
• /
• 2004

In this paper we analyze convergence constraints and time constant of IT-LMS algorithm and derive a method of making it's time constant independent of signal power by using input variance estimation. The method for estimating the input variance is to use a single-pole low-pass filter(LPF) with common smoothing parameter value, θ. The estimator is with narrow bandwidth for large θ but with wide bandwidth for small θ. This small θ gives long term average estimation(low frequency) of the fluctuating input variance well as short term variations (high frequency) of the input power. In our simulations of multipath communication channel equalization environments, the method with large θ has shown not as much improved convergence speed as the speed of the original IT-LMS algorithm. The proposed method with small θ=0.01 reach its minimum MSE in 100 samples whereas the IT-LMS converges in 200 samples. This shows the proposed, tap-power normalized IT-LMS algorithm can be applied more effectively to digital wireless communication systems.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1962-1965
• /
• 2004

In this paper, the new algorithm for blind adaptive decorrelating parallel interference canceller detector in direct-sequence code division multiple access (DS-CDMA) synchronous communication systems is proposed. The goal of this paper is to improve the performance of the blind adaptive decorrelating parallel interference cancellation detector (BAD/PIC). The proposed blind adaptive decorrelating detector is using optimum step-size technique bootstrap algorithm as an initial stage of PIC, which does not require a training sequence. Therefore, this algorithm has a superior view of utilizing bandwidth and reduces the complexity of computation of inversion cross-correlation matrix. The computer simulation results show that the bit error rate performance of the proposed algorithm for the new structure of detector is better than that of the other detectors such as matched filters, the conventional PIC, and the blind adaptive decorrelating PIC detector.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.121-124
• /
• 2003

Passive optical networks (PONs) will be the pervasive choice in the design of next-generation access networks. One possible solution to implementing Passive optical access network is to rely on wavelength-division multiplexing (WDM). In this paper, we solve the problem of providing real-time service to both hard and soft real-time messages in conjunction with a conventional vest-effort service in WDM. we propose an adaptive scheduling algorithm to schedule and manage the message transmissions in the optical access network. Proposed algorithm is MLF-MQF. Also, we suggest dynamic bandwidth algorithm(DBA) in Loop-back WDM-PON (LPB-PON).our mechanism based on bandwidth reservation protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.6
• /
• pp.341-349
• /
• 2014

Dynamic adaptive streaming over HTTP (DASH) is the most recent and promising technology to support high quality streaming services. In dynamic adaptive streaming over HTTP (DASH), a client consecutively estimates the available network bandwidth and decides the transmission rate for the forthcoming video chunks to be downloaded. In this paper, we propose a novel rate adaptation algorithm called quality of experience QoE-enhanced adaptation algorithm over DASH (QAAD), which preserves the minimum buffer length to avoid interruption and minimizes the video quality changes during the playback. We implemented a DASH test bed and conducted extensive experiments. Experimental results demonstrate that under fluctuating network conditions, QAAD provides seamless streaming with stabilized video quality while the previous buffer-aware algorithm (i.e., QDASH[9]) frequently changes the video quality and undergoes the interruption.