• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.331-332
• /
• 2009

서버가 전송하는 고품질의 MPEG 스트림을 클라이언트가 적시에 수신하고 재생하기 위해서는 통신망의 충분한 대역폭과 함께 효율적인 실시간 스케쥴링 방법이 반드시 필요하다. 본 논문에서 MPEG 비디오 스트림의 각 프레임은 단일 패킷으로 구성되며 프레임의 중요도에 따라 우선순위가 설정된다. 우선순위를 이용하는 스케쥴링 기법은 종료시한 내에 전송이 완료되는 패킷의 수를 최대화함으로써 멀티미디어 시스템의 실시간적 성능과 서비스 품질을 향상시킬 수 있다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.128-133
• /
• 2005

Respond time and processing rate representing how many tasks can be done during an unit time in a client/server environment are generally use for measuring the performance of computers. In this paper, we suggest a window buffer managing scheme based on a window with many of short-term sliced slots where a media stream is allocated and deallocated into them so that it can maximize the utilization ration of the limited buffer on a multimedia server. And we also propose a buffer substitution scheme for reducing I/O times of a multimedia server by counting re-reference time point about a used block and then it can be reused by the next consecutive media stream.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6A
• /
• pp.918-926
• /
• 2000

A huge storage and broad bandwidth are required to provide subscribers with VoD services. Hence, there is a huge amount of cost in establishing networks for VoD services. To determine how to reduce the cost, a number of studies involving such as distributed server systems, multicasting, program caching, stream sharing, are currently in progress. In this paper, a request criterion for multicast service and the ratio of required bandwidth for unicast to multicast are generated. The effect of multicast service on network bandwidth, server bandwidth, and buffer size was analyzed and validated through computer simulation. The results of this study could be applied to efficient designing networks for VoD services.

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

The transmission of prerecorded and compressed video data without degradation of picture quality requires video servers to cope with large fluctuations in bandwidth requirement. Bandwidth smoothing techniques can reduce the burst of a variable-bit rate stream by prefetching data at a series of fixed rates and simplifying the allocation of resources in the video servers and the network. In this paper, the proposed smoothing algorithm results in the optimal transmission plans for (1) the smallest bandwidth requirements, (2) the minimum number of changes in transmission rate, and (3) the minimum amount of the server process overhead. The advantages of the proposed smoothing algorithm have been verified through the comparison with the existing smoothing algorithms in diverse environments.

• Journal of Korea Multimedia Society
• /
• v.15 no.6
• /
• pp.814-826
• /
• 2012

In this paper, we propose scheduling algorithms for transporting variable-bit-rate video stream using playback buffer level of the clients over wireless communication networks. The proposed algorithms attempt to maximize the utilization of limited bandwidth between the central video server and the clients over a mobile network. Since a video server may serve several video request at the same time, it is important to allocate and utilize network bandwidth to serve them fairly and efficiently. In order to improve the quality of service and real-time performance of individual video playback, the video server attempts to allocate temporarily more network bandwidth to serve a video request with the lower buffer level preferentially. The simulation results prove the fair service and load balancing among the mobile concurrent clients with different buffer levels and hence maximizing the number of frames that are transported successfully to the client prior to their playback times.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.10a
• /
• pp.561-564
• /
• 2018

최근 빠르게 발생하는 빅데이터 스트림이 다양한 분야에서 활용되고 있다. 이러한 빅데이터 전체를 수집하고 처리하는 것은 매우 비경제적이므로, 데이터 스트림 중 필요한 데이터를 걸러내는 필터링 과정이 필요하다. 본 논문에서는 아파치 스톰(Apache Storm)을 사용하여 데이터 스트림의 질의 필터링 시스템을 구축한다. 스톰은 대용량 데이터 스트림을 처리하기 위한 실시간 분산 병렬 처리 프레임워크이다. 하지만, 스톰은 입력 데이터 구조나 알고리즘 변경 시, 코드의 수정과 재배포, 재시작 등이 필요하다. 따라서, 본 논문에서는 이 같은 문제를 해결하기 위해 아파치 카프카(Apache Kafka)를 사용하여 데이터 수집 모듈과 스톰의 처리 모듈을 분리함으로써 시스템의 가용성을 크게 높인다. 또한, 시스템을 웹 기반 클라이언트-서버 모델로 구현하여 사용자가 언제 어디에서든 질의 필터링 시스템을 사용할 수 있게 하며, 웹 클라이언트를 통해 입력한 질의를 자동적 분석하는 쿼리 파서를 구현하여 별도의 프로그램의 수정 없이 질의 필터링을 적용할 수 있다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.9
• /
• pp.527-535
• /
• 2004

Handling mixed workload in digital set-top box or streaming server becomes an important issue as integrated file system gets momentum as the choice for the next generation file system. The next generation file system is required to handle real-time audio/video playback while being able to handle text requests such as web page, image file, etc. Legacy file system provides only best effort I/O service and thus cannot properly support the QoS of soft real-time I/O. In this paper, we would like to present our experience in developing the file system which fan guarantee the QoS of multimedia stream. We classify all application I/O requests into two category: periodic I/O and sporadic I/O. The QoS requirement of multimedia stream could be guaranteed by giving a higher priority to periodic requests than sporadic requests. The proto-type file system(Qosfs) is developed on Linux Operating System.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12B
• /
• pp.758-766
• /
• 2007

IStreaming services with a client-server architecture have scalability problem because a server cannot accomodate clients more than its processing capability. This paper introduces a case study for implementing H.264 streaming system based on P2P architecture in order to provide scalable and stable broadcast streaming services over the internet. The prototype system called OmniCast264 consists of the H.264 encoding server, the streaming server, the proxy server, and peer nodes. The proxy server dynamically manages placement of the peer nodes on the P2P network. Omnicast264 has the concepts of distributed streaming loads, real-time playback, error-robustness and modularity. Thus, it can provide large-scale broadcast streaming services. Finally, we have built P2P streaming systems with 12 PCs connected serially or in parallel. The experiment shows that OmniCast264 can provide real-time playback.

• Journal of KIISE:Databases
• /
• v.29 no.2
• /
• pp.119-127
• /
• 2002

Video server which stores video streams should serve more users with the requested streams rapidly, satisfying their time constraints. However, the number of users supported and the response times for the requested services in video server are in the oppositional relationship with viewpoint of disk throughput. In this paper, we propose new policy that can provide not only rapid responses for the service requests but also increase the number of users supported in the storage system of video server. The policy admits the random movements of disk heads for urgent service requests but maintains the sequential or restricted movements of disk heads and eliminates rewind time of disk heads for less-urgent service requests in storage system of multiple disks environment so that it can not satisfy only the QoS of users but also support more users.

• Journal of Korea Society of Industrial Information Systems
• /
• v.13 no.1
• /
• pp.46-56
• /
• 2008

Double Patching is a multicasting technique for a VoD system which has been proposed to provide a true VoD service by making clients share a long patching stream as well as a regular stream For subsequent short patching streams, the technique always makes the long patching stream have extra data that will be played back during a double period of a patching window. In this paper, we propose a technique, using the start time of the latest short patching stream, optimizes Double Patching by deleting the useless data included in the long patching stream when the patching window of the long patching stream closes. The mean requirement for the server's bandwidth to provide the true VoD service is used as a performance metric, and the effect of the request inter-arrival time, the size of the client's local buffer and the video length on the mean bandwidth requirement is evaluated. Performance evaluation result shows that the proposed technique optimizes Double Patching in all cases.