• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.7
• /
• pp.22-29
• /
• 2002

The Gauranteed Frame Rate service category was proposed by the ATM Forum as an enhancement to the UBR service. This service aims to support minimum cell rate gaurantee for each virtual connection and allow any excess bandwidth in the network to be shared among the contending VCs in a fair manner. We propose a new buffer management algorithm for GFR service through FIFO queuing discipline. Proposed scheme can provide minimum bandwidth guarantee for GFR VCs as well as improve the fairness among the competing GFR VCs on a single FIFO queue. From simulation results, we demonstrate the proposed scheme fulfills the requirement of GFR service as well as improves the TCP throughput.

• Journal of Korea Society of Industrial Information Systems
• /
• v.9 no.3
• /
• pp.1-10
• /
• 2004

Video-On-Demand servers use compression techniques to reduce the storage and bandwidth requirements. The compression techniques make the bit rates of compressed video data significantly variable from frame to frame. Consequently, Video-On-Demand servers with a constant bit rate retrieval can not maximize the utilization of resources. It is possible that when variable bit rate video data is stored, accurate description of the bit rate changes could be computed a priori. In this paper, I propose a buffer management scheme called MAX for Video-On-Demand server using variable bit rate continuous media. By caching and prefetching the data, MAX buffer management scheme reduces the variation of the compressed data and increases the number of clients simultaneously served and maximizes the utilization of system resources. Results of trace-driven simulations show the effectiveness of the scheme.

• Journal of Korea Multimedia Society
• /
• v.12 no.12
• /
• pp.1710-1717
• /
• 2009

Flash memory has become the most important storage media in mobile devices along with its attractive features such as low power consumption, small size, light weight, and shock resistance. However, a flash memory can not be written before erased because of its erase-before-write characteristic, which lead to some garbage collection when there is not enough space to use. In this paper, we propose a novel garbage collection scheme, called block-level buffer garbage collection. When it is need to do merge operation during garbage collection, the proposed scheme does not merge the data block and corresponding log block but also search the block-level buffer to find the corresponding block which will be written to flash memory in the next future, and then decide whether merge it in advance or not. Our experimental results show that the proposed technique improves the flash performance up to 4.6% by reducing the unnecessary block erase numbers and page copy numbers.

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

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.5
• /
• pp.285-291
• /
• 2010

Flash memory has many good features such as small size, shock-resistance, and low power consumption, but the cost of flash memory is still high to substitute for hard disk entirely. Recently, some mobile devices, such as laptops, attempt to use both flash memory and hard disk together for taking advantages of merits of them. However, existing OSs (Operating Systems) are not optimized to use the heterogeneous storage media. This paper presents a new buffer cache management scheme. First, we allocate buffer cache space according to access patterns of block references and the characteristics of storage media. Second, we prefetch data blocks selectively according to the location of them and access patterns of them. Third, we moves destaged data from buffer cache to hard disk or flash memory considering the access patterns of block references. Trace-driven simulation shows that the proposed schemes enhance the buffer cache hit ratio by up to 29.9% and reduce the total I/O elapsed time by up to 49.5%.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.324-336
• /
• 2000

The paper proposes an efficient buffer management scheme to enhance performance of the disk I/O system. Without any user level information, the proposed scheme automatically detects the block reference patterns of applications by associating block attributes with forward distance of a block. Based on the detected patterns, the scheme applies an appropriate replacement policy to each application. We also present a new block allocation scheme to improve the performance of buffer cache when kernel needs to allocate a cache block due to a cache miss. The allocation scheme analyzes the cache hit ratio of each application based on block reference patterns and allocates a cache block to maximize cache hit ratios of system. These all procedures are performed on-line, as well as automatically at system level. We evaluate the scheme by trace-driven simulation. Experimental results show that our scheme leads to significant improvements in hit ratios of cache blocks compared to the traditional schemes and requires low overhead.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.9
• /
• pp.358-365
• /
• 2003

To support Internet traffic efficiently over ATM networks, Guaranteed Frame Rate(GFR) has been proposed in the ATM Forum. GFR provides minimum rate guarantees to VCs and allows any excess bandwidth in the network to be shared among the contending VCs in a fair manner. In this paper, we proposed a new fuzzy logic based buffer management algorithm that provides MCR guarantee and fair sharing to GFR VCs. A key feature of proposed algorithm is its ability to accept or drop a new incoming packet dynamically based on buffer condition and load ratio of VCs. This is achieved by using fuzzy logic controller for the production of a drop factor. Simulation results show that proposed scheme significantly improves fairness and TCP throughput compared with previous schemes.

• The KIPS Transactions:PartC
• /
• v.12C no.2 s.98
• /
• pp.229-234
• /
• 2005

We propose a fuzzy logic-based buffer management algorithm to improve internet traffic over ATM-GFR service. The proposed algorithm employs the strategies of early congestion detection and selective packet discard to achieve its design goals. A key feature of proposed algorithm is its ability to accept or drop a new incoming packet dynamically based on buffer condition and load rate of VCs. This is achieved by using fuzzy logic controller for the production of a drop factor. Simulation results show that proposed scheme significantly has improved fairness and TCP throughput compared with previous schemes.

• Journal of Korea Society of Industrial Information Systems
• /
• v.4 no.4
• /
• pp.32-39
• /
• 1999

Video-On-Demand servers have to provide timely processing guarantees and reduce the storage and reduce the storage and bandwidth requirements for continuous media However, compression techniques used in Video-On-Demand servers make the bit rates of compressed video data significantly variable from frame to frame Consequently, most pervious Video-On-Demand servers which use constant bit rate retrieval to guarantee deterministic service under-utilize the system resources and restrict the number of clients. In this paper, I propose a buffer management scheme called CAP(Caching And Prefetching) for Video-On-Demand server using variable bit rate continuous media. By caching and prefetching the data CAP reduces the variation of the compressed data and increases the number of clients simultaneously served and maximizes the utilization of system resources. Results of trace-driven simulations show the effectiveness of the scheme.

• Proceedings of the IEEK Conference
• /
• 2001.06b
• /
• pp.369-372
• /
• 2001

This paper presents the design of high-speed virtual output queue(VOQ) management scheme for high performance cell/packet switch, which has a serial cross bar structure. The proposed VOQ management scheme has been designed for wire-speed routing with a pipelined buffer management. It provides the tolerance of requests and grants data transmission latency between the VOQ manager and central arbiter using a new request control method that is based on a high-speed shifter. The designed VOQ manager has been implemented in a field programmable gate array chip with a 77MHz operating frequency, a 900-pin fine ball grid array package, and 16$\times$16 switch size.