• The Transactions of the Korea Information Processing Society
• /
• v.7 no.3
• /
• pp.923-934
• /
• 2000

• 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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.3
• /
• pp.203-217
• /
• 1994

In this paper we develop an exponentialization procedure for the modelling of open FMS networks with general processing time at each station and limited buffer size. By imposing a reasonable assumption on the solution set, the nonlinear equation system for the exponentialization procedure is formulated as a variational inequality problem and the solution existence is examined. The efficient algorithm for the nonlinear equation system is developed using linearized Jacobi approximation method.

• 한국초전도학회:학술대회논문집
• /
• v.13
• /
• pp.86-86
• /
• 2003

• Proceedings of the Korea Institute of Applied Superconductivity and Cryogenics Conference
• /
• 2003.02a
• /
• pp.98-100
• /
• 2003

PbTiO$_3$ films applicable to buffer layers for YBCO coated conductor have been successfully fabricated by sol-gel process. Crystallinity of grown films are heavily dependent on processing parameters such as annealing atmosphere and number of dipping. (100) oreinted PbTiO$_3$ films grown on (200) oriented Ni substrates exhibit uniform surface with small grain size(200~300nm).

• 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.

• The KIPS Transactions:PartC
• /
• v.17C no.3
• /
• pp.299-306
• /
• 2010

IPTV and VoIP services are considered as killer applications over Mobile WiMAX network, which provideshigh mobility and data rate. Among those which affect the quality of voice in those services, the jitter buffer or playout buffer can compensate the poor voice quality caused by the packet drop due to frequent route change or differences among routes between service endpoints. In this paper, we analyze the correlation between the sleep interval length and jitter buffer size in order to guarantee a predefined level of voice quality. For this purpose, we present an end-to-end delay model considering additional delay incurred by the WiMAX PSC-II sleep mode and a VoIP service quality requirement based on the delay constraints. Through extensive simulation experiments, we also show that the increase of jitter buffer size may degrade the voice quality since it can introduce additional packet drop in the jitter buffer under WiMAX power saving mode.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.6
• /
• pp.255-260
• /
• 2017

The limitation of real-time video conferencing system is that the delay of network and buffering and the transmission of user information are not efficiently performed between systems, so real - time performance is not guaranteed completely. In order to overcome this problem, the study on the extension of the network infrastructure and the jitter delay is actively carried out, but the study on the buffering delay is insufficient. In this paper, we propose a frame-rate control buffer management (FRCB) scheme to solve the problem caused by buffering delay. The FRCB is used to prevent overflow and underflow of the buffer by adopting the two-stage buffer threshold of Fast-play THreshold (FTH) and Slow-play THreshold (STH). Therefore, it showed better performance than jitter buffer even under high CPU load, and showed that it is suitable for high quality real time video conferencing.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.709-718
• /
• 2002

Cluster based VOD systems require elaborate load balancing and buffer management techniques in order to ensure real-time display for multiuser concurrently. In this paper, we propose a new load balancing technique based on the dynamic buffer partitioning in cluster based VOD servers. The proposed technique evenly distribute the user requests into each service node according to its available buffer capacity and disk access rate. In each node, the dynamic buffer partitioning technique dynamically partitions the buffer to minimize the average waiting time for the requests that access the same continuous media. The simulation results show that our proposed technique decreases the average waiting time by evenly distributing the user requests compared with the exiting techniques and then increases the throughput in each node. Particularly under the overloaded condition in the cluster server, the simulation probes that the performance of the proposed technique is better two times than the Generalized Interval Caching based technique.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.12 no.6
• /
• pp.377-384
• /
• 2017

The scope of the matrix application is so broad that it can not be limited. A typical matrix application area in computer science is image processing. Particularly, radar scanning equipment implemented on a small embedded system requires real-time matrix transposition for image processing, and since its memory size is small, a general matrix transposition algorithm can not be applied. In this case, matrix transposition must be done in disk space, such as flash disk, using a limited memory buffer. In this paper, we analyze and improve a recently published flash disk-based matrix transposition algorithm named as asymmetric sub-matrix transposition algorithm. The performance analysis shows that the asymmetric sub-matrix transposition algorithm has lower performance than the conventional sub-matrix transposition algorithm, but the improved asymmetric sub-matrix transposition algorithm is superior to the sub-matrix transposition algorithm in 13 of the 16 experimental data.