• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1996.10a
• /
• pp.765-768
• /
• 1996

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.303-308
• /
• 2000

VOD(Video-On-Demand) 시스템에서 제한 없는 VCR 서비스는 클라이언트들의 개별 서비스 요청에 대하여 유일한 비디오 스트림을 할당함으로서 제공될 수 있다. 이 방식은 서버 부하의 증가와 부족한 네트워크 자원의 고갈 등과 같은 중대한 문제점을 갖고 있으나 클라이언트의 셋톱박스에 버퍼를 구현함으로서 매우 제한된 VCR 기능을 제공하게 된다. 본 논문에서는 대화형 VOD 시스템에서 제한 없는 VCR 기능을 제공할 수 있는 새로운 MBA(Multicast Buffering Algorithm) 알고리듬을 제안한다. MBA 알고리듬 하에서 VCR 서비스는 버퍼가 동적으로 확장되어 비디오 데이터를 저장하기 때문에 사용자에게 제한 없이 제공되어진다. 또한 MBA 알고리듬은 버퍼의 사용 효율을 증대시키는 방법을 제공하며 모든 클라이언트들의 서비스 요청을 지연 없이 즉시 처리하므로 사용자들에게 진정한 대화형 VOD 서비스를 제공하게 된다. 본 논문에서는 MBA 알고리듬을 이용하여 지연 없는 VCR 기능을 갖춘 VOD 서비스를 구현하였으며 시뮬레이션 결과는 MBA 알고리듬이 다른 버퍼링 방식과 비교하여 매우 우수한 성능을 갖고 있음을 보여주고 있다.

• Journal of Korea Multimedia Society
• /
• v.7 no.1
• /
• pp.44-53
• /
• 2004

This paper aims at presenting high quality at low resolution apply by a new antialiasing method for voxelized implicit surfaces. Implicit surfaces create a unique type of 3D-modeling. Some use of implicit surfaces are scientific and medical visualization, animation, medical simulation and interactive modeling. One of previous antialiasing methods for implicit surfaces presented by raytracing or texture mapping is making use of a stochastic sampling. But this method requires more calculation time and costs which is caused by complicated and difficult implicit functions. In the meanwhile, voxelized implicit surfaces generally use high resolution for good quality images but it costs to generate. In order to this problem, this paper suggests a shifted double Z-buffer which is very simple, more efficient and easy. Tn addition, there are applied box-filter and tent-filter to the double Z-buffer antialiasing method for better images. For results this method generate high quality image and it is easy to apply to various filters and is able to extend to multi Z-buffer.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.11
• /
• pp.1713-1719
• /
• 2022

As the noise canceler with a small processing delay increases the sampling frequency, a better-quality output can be obtained. For a single buffer, processing delay occurs because it is impossible to write new data while the processor is processing the data. When synthesizing with anti-noise and output signal, this processing delay creates additional buffering overhead to match the phase. In this paper, we propose an accelerator structure that minimizes processing delay and increases processing speed by alternately performing read and write operations using the Symmetric Even-Odd-buffer. In addition, we compare the structural differences between the two methods of noise cancellation (Fast Fourier Transform noise cancellation and adaptive Least Mean Square algorithm). As a result, using an Symmetric Even-Odd-buffer the processing delay was reduced by 29.2% compared to a single buffer. The proposed Symmetric Even-Odd-buffer structure has the advantage that it can be applied to various canceling algorithms.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.2 s.302
• /
• pp.11-20
• /
• 2005

In previous video conference system, when the number of participants in video conference increases by n, the bandwidth and memory of n2 is required. And also, it brings about increase in traffic and problem of a say during a conference in aspect of transmission of voice data. In this paper, we propose an algorithm of remote video conference using silence detection algerian to resolve the questions such as buffering method of video data in server and heavy traffic detection algorithm to the increase in participants. Video data buffering algorithm is not a method of broadcasting to other client in the server, but this algorithm uses two other methods; the buffering method of receiving compressed video data from clients and the indexing method for acquiring the video data of other participants in clients according to clients' bandwidth and network transmission speed. We apply a voice transmission algerian and a channel management algorithm to the remote video conference system. The method used in the voice transmission algorithm is a silence detection algorithm which does not send silent participants' voice data to the server. The channel management algorithm is a method allocating a say to the participants who have priority. In consideration of average 20 frames and 30ms regardless of a number of participants, we can safely conclude that the transmission of video and voice data is stable.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.54-57
• /
• 2007

Much researches have studied for seamless mobility service. Those focused on minimizing the delay time due to the handover. In this paper, we suggest seamless mobility service with the network-based preemptive operations. With these operations, if it's found that the MT(Mobile Terminal)'s handover using L2-trigger event, old access network buffers the delivering data. Therefore this can decrease the data drop rates. And also, this can deal with the ping-pong's phenomenon of MT. At the end of MT's movement, these operations can provide seamless mobility service sending buffered data after checking the MT's movement. This mechanism uses MPLS-LSP(MultiProtocol Label Switching-Label Switched Path) in core network for fast process.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.4
• /
• pp.395-404
• /
• 1999

포인터 스위즐링 기법은 포인터 스위즐링과 언스위즐링으로 이루어지며, 포인터 스위즐링은 객체 접근 시 객체 식별자를 해당 객체의 메모리 주소로 교체하는 것을 말하며, 언스위즐링은 객체 교체 또는 객체 저장 시에 스위즐링된 포인터를 원래의 객체 식별자로 환원하는 것을 말한다. 본 연구에서는 시스템 버퍼 구조에 따라 여러 포인터 스위즐링 기법을 분류하여 장단점을 분석하였으며, 이중 버퍼 구조 상에서 적극/소극, 직접/간접 스위즐링, 언스위즐링 모듈을 설계, 구현하였다. 또한 제한된 크기의 객체 버퍼 상에서 각 포인터 스위즐링 모듈의 성능을 평가하였다. 이 성능 평가의 결과로는 사용하지 않는 포인터는 스위즐링하지 않으며 언스위즐링 부담이 적은 소극 간접 스위즐링 기법이 일반적으로 뛰어난 성능을 나타냄을 알 수 있게 되었다.Abstract The pointer swizzling methods consist of pointer swizzling and unswizzling. Pointer swizzling replaces the OID of a object to the memory address of the object at object access time and unswizzling replaces the swizzling pointer of the OID at object replacement time or object save time. In this research, the different techniques for pointer swizzling are classified according to the system buffer structure and analyzed the pros and cons. In addition, eager/lazy, direct/indirect swizzling, unswizzling modules are designed and implemented on a dual buffering structure. Also, we evaluate the performance of pointer swizzling modules on the restricted object buffer size. The results of performance evaluation show that the performance of lazy indirect pointer swizzling technique is generally good because unused pointers are not swizzled, and unswizzling overhead is minimized.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7B
• /
• pp.1292-1300
• /
• 2000

본 논문에서는 연결지향적인 ATM 네트워크에서 비연결지향적인 데이터 전송을 효율적으로 하기 위한 방법으로 Frame-Weighted(FW) 스케줄링 기법을 제시한다. 본 방법은 기존의 GPS 계열이 갖는 셀 단위에서의 스케줄링으로 인한 낮은 효율 및 높은 셀 손실을 프레임 단위에서의 스케줄링으로 극복한다. 이를 이용하면 네트워크 내의 버퍼 점유율을 낮춤으로써 프로엠 지연을 단축하고 셀 손실을 최소화할 수 있어 데이터 전송에 효과적으로 쓰일 수 있다.

• The Journal of the Korea Contents Association
• /
• v.18 no.3
• /
• pp.34-40
• /
• 2018

In this study, the optimal buffer size is calculated for seamless video playback on a mobile device. Buffer means the memory space for multimedia packet which arrives in mobile device for video play such as VOD service. If the buffer size is too large, latency time before video playback can be longer. However, if it is too short, playback service can be paused because of shortage of packets arrived. Hence, the optimal buffer size insures QoS of video playback on mobile devices. We model the process of buffering into a discret-time queueing model. Mean busy period length and mean waiting time of Geo/G/1 queue with N-policy is analyzed. After then, we uses the main performance measures to present numerical examples to decide the optimal buffer size on mobile devices. Our results enhance the user satisfaction by insuring the seamless playback and minimizing the initial delay time in VOD streaming process.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.7
• /
• pp.48-56
• /
• 2011

Recently, new storage device SSD(Solid State Disk) based on NAND flash memory is gradually replacing HDD(Hard Disk Drive) in mobile device and thus a variety of research efforts are going on to find the cost-effective ways of performance improvement. By increasing the NAND flash channels in order to enhance the bandwidth through parallel processing, DRAM buffer which acts as a buffer cache between host(PC) and NAND flash has become the bottleneck point. To resolve this problem, this paper proposes an efficient low-cost scheme to increase SSD performance by improving DRAM buffer bandwidth through scheduling techniques which utilize DRAM multi-banks. When both host and NAND flash multi-channels request access to DRAM buffer concurrently, the proposed technique checks their destination and then schedules appropriately considering properties of DRAMs. It can reduce overheads of bank active time and row latency significantly and thus optimizes DRAM buffer bandwidth utilization. The result reveals that the proposed technique improves the SSD performance by 47.4% in read and 47.7% in write operation respectively compared to conventional methods with negligible changes and increases in the hardware.