• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5271-5289
• /
• 2016

On large-scale data analysis platforms deployed on cloud infrastructures over the Internet, the instability of the data transfer time and the dynamics of the processing rate require a more sophisticated data distribution scheme which maximizes parallel efficiency by achieving the balanced load among participated computing elements and by eliminating the idle time of each computing element. In particular, under the constraints that have the real-time and limited data buffer (in-memory storage) are given, it needs more controllable mechanism to prevent both the overflow and the underflow of the finite buffer. In this paper, we propose an auto regulated data provisioning model based on receiver-driven data pull model. On this model, we provide a synchronized data replenishment mechanism that implicitly avoids the data buffer overflow as well as explicitly regulates the data buffer underflow by adequately adjusting the buffer resilience. To estimate the optimal size of buffer resilience, we exploits an adaptive buffer resilience control scheme that minimizes both data buffer space and idle time of the processing elements based on directly measured sample path analysis. The simulation results show that the proposed scheme provides allowable approximation compared to the numerical results. Also, it is suitably efficient to apply for such a dynamic environment that cannot postulate the stochastic characteristic for the data transfer time, the data processing rate, or even an environment where the fluctuation of the both is presented.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.18 no.4
• /
• pp.107-114
• /
• 2010

Coupling systems for trains need more complicated buffer equipments than existing systems because the recent tendency of the regulations enforces trains to be safe for collisions even when the driving speed is higher than before. Using hydraulic buffer is an effective way to satisfy the requirement while it causes the increase of the cost for the coupling system. In this study, we introduce the methodology to build a simulation model for the hydraulic buffer, which could be installed into the coupling systems. In the simulation model of the hydraulic buffer, the reacting force is determined by both buffer stroke and speed whereas the elastic buffer model is designed by using only the buffer stroke in other studies. The simulation results with the advanced hydraulic buffer model shows that the simulating results can be close the real experimental results around 10%, and, if we considers friction forces, the simulation calculates the maximum force within 10% comparing to the experimental.

• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.121-128
• /
• 2005

Tho existing TCP(Transmission Control Protocol) is known to be unsuitable for a network with the characteristics of high RDP(Bandwidth-Delay Product) because of the fixed small or large buffer size at the TCP sender and receiver. Thus, some trial cases of adjusting the buffer sizes automatically with respect to network condition have been proposed to improve the end-to-end TCP throughput. ATBT(Automatic TCP fluffer Tuning) attempts to assure the buffer size of TCP sender according to its current congestion window size but the ATBT assumes that the buffer size of TCP receiver is maximum value that operating system defines. In DRS(Dynamic Right Sizing), by estimating the TCP arrival data of two times the amount TCP data received previously, the TCP receiver simply reserves the buffer size for the next arrival, accordingly. However, we do not need to reserve exactly two times of buffer size because of the possibility of TCP segment loss. We propose an efficient TCP buffer tuning technique(called TBT-PLR: TCP buffer tuning algorithm based on packet loss ratio) since we adopt the ATBT mechanism and the TBT-PLR mechanism for the TCP sender and the TCP receiver, respectively. For the purpose of testing the actual TCP performance, we implemented our TBT-PLR by modifying the linux kernel version 2.4.18 and evaluated the TCP performance by comparing TBT-PLR with the TCP schemes of the fixed buffer size. As a result, more balanced usage among TCP connections was obtained.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.263-271
• /
• 2004

In this paper, we proposed a new buffer management algorithm using perVC-Queuing discipline. Proposed algorithm uses service rate estimation and assigns dynamic perVC threshold to each VCs. Service rate estimation and dynamic perVC threshold combined with global threshold provide nearly optimal throughput and improve fairness performance of network resource among GFR VCs as well as guarantee MCR of all VCs. From simulation results, we demonstrate the proposed scheme fulfills the requirement of GFR service as well as improves the TCP throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.12
• /
• pp.3132-3143
• /
• 1996

In the evaluation of Broadband-ISDN, the main issue is to interconnect existing LANs and MANs to B-ISDN based on Asynchrous Transfer Mode. However, LANs provide connectionless services, whereas the ATM network provides connection-oriented services. So some problem arises from accessing ATM switchs to transparently transmit connectionless data via B-ISDN. Two methods then were recommended by ITU-TS to support the connectionaless services. In the paper, we do the numerical analysis, using the stochastic fluid flow method, of dynamic bandwidth allocation sheme with two class traffics in the virtual path established between Interworking Units(JWUS) interconnecting LANs to an ATM network and Connectionless Servers(CLSs). The loss mechanism of each traffic is controlled by the contents of buffer. The vandwidth which the IWU requests the CLS is estimated by the number of On-Off sources in the On state. We use the stochsastic fluide flow method which is to find the steady-state joint probability in each level of the IWU buffer. The length of the IWU buffer as the real random variable is changed by traffics entering the IWU.

• Proceedings of the IEEK Conference
• /
• 2002.06b
• /
• pp.133-136
• /
• 2002

This paper discusses the design of a sample-and -hold amplifier(SHA) that has a 12-bit resolution with a 100 MS/s speed. The sample-and-hold amplifier uses the open-loop architecture with hold-mode feedthrough cancellation for high accuracy and high sampling speed. The designed SHA is composed of input buffer, sampling switch, and output buffer with additional amplifier for offset cancellation Hard Ware. The input buffer is implemented with folded-cascode type operational transconductance Amplifier(OTA), and sampling switch is implemented with switched source follower(SSF). A spurious free dynamic range (SFDR) of this circuit is 72.6 dB al 100 MS/s. Input signal dynamic range is 1 Vpp differential. Power consumption is 65 ㎽.

• 한국IT서비스학회:학술대회논문집
• /
• 2006.11a
• /
• pp.360-365
• /
• 2006

VoD (Video-on-Demand) 서비스는 가입자가 원하는 컨텐츠를 실시간으로 전송하는 서비스의 형태이다. 오늘날은 방대한 양의 멀티미디어 데이터를 효율적으로 압축하고 보다 빠르게 전송할 수 있는 시스템의 발달이 가속화되고 있고 이는 VoD 서비스의 증가로도 이어지고 있다. 그러므로 가입자가 원하는 컨텐츠를 보다 효과적으로 제공할 수 있는 VoD 서비스의 방법을 찾는 것은 중요한 일이다. 본 논문에서는 기존의 NVoD (Near-VoD) 서비스 또는 TVoD (True-VoD) 서비스 만을 제공함으로서 생길 수 있는 단점을 없애고 장점만 살릴 수 있는 방법을 제안하였다. 이는 기존의 가입자단에 Buffer를 제공하여 NVoD를 TVoD화 함으로서 가능하게 하였다. 또한, 본 논문에서 제안한 방법이 필요한 버퍼의 크기를 제시하고 전체적인 알고리즘을 제시하여 이를 구체화 하였다.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.12 no.1
• /
• pp.768-783
• /
• 2020

Typically, a Dynamic Positioning System (DPS) uses a PID feed-back system, and it often adopts a wind feed-forward system because of its easier implementation than a feed-forward system based on current or wave. But, because a ship's drifting motion is caused by wind, current, and wave drift loads, all three environmental loads should be considered. In this study, a motion predictive control for the PID feedback system of the DPS is proposed, which considers the three environmental loads by utilizing predicted drifted ship positions in the future since it contains information about the three environmental loads from the moment to the future. The prediction accuracy for the future drifted ship position is ensured by adopting deep learning algorithms and a replay buffer. Finally, it is shown that the proposed motion predictive system results in better station-keeping performance than the wind feed-forward system.

• Proceedings of the IEEK Conference
• /
• 2002.06b
• /
• pp.109-112
• /
• 2002

This paper presents relationship between the dynamic behavior of an asynchronous linear pipeline (ALP) and the performance of the ALP as buffers are allocated. Then the relationship is used in order to characterize a local optimum situation on the buffer design space of the ALP. Using the characterization we propose an efficient algorithm optimizing buffer allocation on an ALP in order to achieve its average case performance. Without the loss of optimality, our algorithm works in linear time complexity so it achieves fast buffer-configuration optimization. This paper makes two contributions. First, it describes relationship between the performance characteristics of an ALP and a local optimum on the buffer design space of the ALP. Second, it devises a buffer allocation algorithm finding an optimum solution in linear time complexity.

• The KIPS Transactions:PartB
• /
• v.17B no.6
• /
• pp.413-420
• /
• 2010

In this paper, we propose a scheme for dynamic allocating network bandwidth based on the playback buffer levels of the clients in a distributed mobile multimedia system. In this scheme, the amount of bandwidth allocated to serve a video request depends on the buffer level of the requesting client. If the buffer level of a client is low or high temporarily, more or less bandwidth will be allocated to serve it with an objective to make it more adaptive to the playback situation of this client. By employing the playback buffer level based bandwidth allocation policy, fair services can also be provided to the clients. In order to support high quality video playbacks, video frames must be transported to the client prior to their playback times. The main objectives in this bandwidth allocation scheme are to enhance the quality of service and performance of individual video playback such as to minimize the number of dropped video frames and at the same time to provide fair services to all the concurrent video requests. The performance of the proposed scheme is compared with that of other static bandwidth allocation scheme through extensive simulation experiments, resulting in the 4-9% lower ratio of frames dropped according to the buffer level.