• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.5
• /
• pp.9-16
• /
• 2004

The data link layer of the PCI Express must have the transmitting buffer that contains the packets to transmit next time. Also it must have the retry buffer that contains the packets which were already transmitted but have not been acknowledged by the corresponding target device. In the separated buffer architecture, the data link layer can not transmit the packets in the transmitting buffer if the reiry buffer space is not enough. In this paper, we propose an efficient buffer architecture which merges the transmitting buffer and the retry buffer to a single buffer. Since the proposed buffer can dynamically assign the size of the transmitting buffer and the retry buffer, it can improve the buffer usage efficiency and the data transfer efficiency. The simulation result shows that the proposed buffer has the higher data transfer efficiency than the separated buffer architecture about 39% when the total buffer size is 8K byte.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.13 no.11
• /
• pp.959-962
• /
• 2000

We have fabricated good quality superconducting YBa$_2$Cu$_3$$O_{7-x}$(YBCO) thin films on Hastelloy(Ni-Cr-Mo alloys) metallic substrates with CeO$_2$and BaTiO$_3$buffer layers in-situ by pulsed laser deposition in a multi-target processing chamber. YBCO film with CeO$_2$single buffer layer shows T$_{c}$ of 71.64 K and the grain size less than 0.1${\mu}{\textrm}{m}$. When BaTiO$_3$ is used as a single buffer layer, the grain size of YBCO is observed to be larger than that of YBCO/CeO$_2$by 200 times and the transition temperature of the film is enhanced to be about 84 K. CeO$_2$/BaTiO$_3$double buffer layer has been adopted to enhance the superconducting properties, which results in the enhancement of the critical temperature and the critical current density to be about 85 K and 8.4$\times$10$^4$ A/$\textrm{cm}^2$ at 77 K, respectively mainly due to the enlargement of the grain size of YBCO film.ilm.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.350-353
• /
• 1996

In this paper, based on the performance analysis of serial production lines with quality inspection machines, we develope an buffer size optimization method to maximize the production rate. The total sum of buffer sizes are given and a constant, and under this constraint, using the linear approximation method, we suggest a closed form solution for the optimization problem with an acceptable error. Also, we show that the upstream and downstream buffers of the worst performance machine have a significant effect on the production rate. Finally, the suggested methods are validated by simulations.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.273-276
• /
• 1998

This paper proposes a new Asynchronous Transfer Mode(ATM) switch architecture for the Broadband ISDN. The proposed switch has the architecture to prohibit the out-of-sequence in shared buffer switch system with being fixed buffer size in the out-buffered large scale ATM Switch System. then in this paper proposes cell resequence algorithm to decrease the out-of-sequence problem. also, we studied the out-of-sequence problem that was occurred by the cell transfer delay and the cell overflow due to the fixed buffer size when cell resequenced and we propose to implement optimal ACFIFO(Address Counter First In First Out) buffer size which has the minimized cell loss.

• Journal of Internet Computing and Services
• /
• v.8 no.1
• /
• pp.15-23
• /
• 2007

Wireless LAN (IEEE 802.11) uses traditional TCP for reliable data transmission, But it brings the unintentional packet loss which is not congestion loss caused by handoff, interference, and fading in wireless LAN. In wireless LAN, TCP experiences performance degradation because it consumes that the cause of packet loss is congestion, and it decrease the sending rate by activating congestion control algorithm. This paper analyzes that correlation of throughput and buffer size for wireless buffer tuning. We find MBT (Maximum Buffer Threshold) which does not increase the throughput through the analysis, For calculation of MBT, we experiment the throughput by using high volume music data which is creased by real-time performance of piano. The experiment results is shown that buffer tuing based on MBT shows 20.3%, 21.4%, and 45.4% throughput improvement under 5ms RTT, 10ms RTT, and 20ms RTT, respectively, comparing with the throughput of operation system default buffer size, In addition, we describe that The setting of TCP buffer size by exceeding MBT does not have an effect on the performance of TCP.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.271-275
• /
• 2005

Queueing models are good models for fragments of communication systems and networks, so their investigation is interesting for theory and applications. Theses queues may play an important role for the validation of different decomposition algorithms designed for investigating more general queueing networks. So, in this paper we illustrate that the batch size distribution affects the loss probability, which is the main performance measure of a finite buffer queues.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.1
• /
• pp.1-6
• /
• 2006

Queueing models are good models for fragments of communication systems and networks, so their investigation is interesting for theory and applications. Theses queues may play an important role for the validation of different decomposition algorithms designed for investigating more general queueing networks. So, in this paper we illustrate that the batch size distribution affects the loss probability, which is the main performance measure of a finite buffer queues.

• Journal of Electrical Engineering and information Science
• /
• v.3 no.2
• /
• pp.274-279
• /
• 1998

We investigate a Leaky Bucket(LB) scheme with a threshold in the data buffer, where leaky rate changes depending on the contents of data buffer. We use the fluid flow model for the analysis of the LB scheme with a threshold. We model the bursty input source as markov modulated fluid flow(MMFF) As performance measures we obtain loss probability and mean delay. We present some numerical results to show the effects of the level of a threshold, the rate of token generation, the size of token pool, and the size the data buffer on the performances of the LB scheme with a threshold.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2000.11a
• /
• pp.121-129
• /
• 2000

In this paper, we discuss how to operate a buffer yard in an automated container terminal, which will be used for resolving the difficulties to which the interaction between external manned trucks and internal unmanned equipment led. The determination of fleet size of material handling equipment is an important issue in designing of buffer yard in automated container terminals. This research also addresses the issue of determining buffer capacities through simulation. By using response surface methodology (RSM) for efficient experimentation, the optimal combination of design parameters under applicable operational strategies is obtained.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.1 no.1
• /
• pp.8-13
• /
• 2006

In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To achieve load balancing in networks, many protocols have been proposed. However, existing load balancing schemes do not consider the remaining available buffer size of the interface queue, which still results in buffer overflows by congestion in a certain node which has the least available buffer size in the route. To solve this problem, we propose a load balancing protocol called Dynamic Congestion Aware Routing Protocol (DCAR) which monitors the remaining buffer length of all nodes in routes and excludes a certain congested node during the route discovery procedure. We also propose two buffer threshold values to select an optimal route selection metric between the traffic load and the minimum hop count. Through simulation study, we compare DCAR with other on demand routing protocols and show that the proposed protocol is more efficient when a network is heavily loaded.