• Annual Conference of KIPS
• /
• 2007.05a
• /
• pp.135-138
• /
• 2007

현재 인터넷을 통한 IPTV, VoD등과 같은 많은 멀티미디어 서비스가 이루어지고 있으나 QoS를 보장받지 못하고 있다, 이를 위한 유니캐스트로는 한계가 있고, IP 멀티캐스트는 현실적으로 사용하기 어렵다. 본 논문에서는 IP 계층대신 응용계층에서 멀티캐스트 기능을 구현하는 오버레이 멀티캐스트를 VoD 서비스에 적용하여, 클라이언트가 동시에 여러 피어들로부터 스트림 데이터를 받는 방식을 제안함으로서 지터를 줄여 고품질의 QoS 보장 받고자 한다. 클라이언트는 미리 스트림데이터를 받기 때문에 실시간성의 제약으로부터 벗어나기 날수 있어 궁극적으로 QoS의 향상을 이룰 수 있다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.8
• /
• pp.535-544
• /
• 2018

As the spread of mobile devices equipped with various sensors and high-quality wireless network communications functionsexpands, the amount of spatio-temporal data generated from mobile devices in various service fields is rapidly increasing. In conventional research into processing a large amount of real-time spatio-temporal streams, it is very difficult to apply a Hadoop-based spatial big data system, designed to be a batch processing platform, to a real-time service for spatio-temporal data streams. This paper extends the MapReduce online framework to support real-time query processing for continuous-input, spatio-temporal data streams, and proposes a load management method to distribute overloads for efficient query processing. The proposed scheme shows a dynamic load balancing method for the nodes based on the inflow rate and the load factor of the input data based on the space partition. Experiments show that it is possible to support efficient query processing by distributing the spatial data stream in the corresponding area to the shared resources when load management in a specific area is required.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7B
• /
• pp.628-637
• /
• 2003

This paper describes a novel multiplexing scheme for delay-sensitive multiple VBR-coded bit streams in live multimedia service offered to high-speed networks. The primary goal of multiplexing in this paper is to keep delay limits of each bit streams and to enhance network resource utilization when they no multiplexed and transmitted over network. For this aim, this paper presents a dynamical control scheme which does not cause violation of any delay constraints to each bit steam. The scheme is based on the assumption that recent behavior of the each bit scream has high correlation with near-term future behavior. Such property is used to make as flat as possible by both temporal averaging on a stream-by-stream and spatial averaging is introduced when multiple VBR-coded bit streams are multiplexed. The effectiveness of the scheme is evaluated by several simulation using an MPEG-coded video trace of Star_wars and it is shown that the proposed scheme can effectively reduce the feat rate md coefficient of variation of the multiplexed transmission rate.

• Journal of KIISE:Information Networking
• /
• v.34 no.4
• /
• pp.276-286
• /
• 2007

Existing streaming mechanisms have no consideration for the characteristics of streaming applications because they only consider network stability. In this paper, in order to overcome limitations of the previous work on video streaming, we propose a new video streaming mechanism called "HAViS(Hybrid Approach for Video Streaming)". The proposed mechanism includes more sophisticated features that consider both network and user requirements. Therefore, the HAViS mechanism improves the network stability by adjusting the sending rate of video stream based on the network state and it also provides the smooth playback by preventing the buffer underflow or overflow. Moreover, it is designed to take into consideration the streaming video content. Through the simulation, we prove that the HAViS mechanism efficiently uses the buffer resources and provides improved network stability and smooth playback.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1B
• /
• pp.1-12
• /
• 2002

In the multimedia CDMA mobile communication service, it is required to support various applications, such as voice, video, file transfer, e-mail, and Internet access, with guaranteed QoS. In the mixed traffic environment ,which consists of voice, stream data, and packet data, we analyze the network where preemptive priority is granted to delay-intolerant voice service and a buffer is offered to delay-tolerant stream data service. And, for best-effort packet data service, the access control by transmission permission probability is applied to obtain prominent throughput. To analyze the multimedia CDMA mobile communication system, we build a 2-dimensional markov chain model about prioritized-voice and stream data services and accomplish numerical analysis in combination with packet data traffic based on residual capacity equation.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.47-56
• /
• 2003

According to rapidly developed mobile terminals and network in the play environment for multimedia presentation, different end-to-end QoS situations appear. Then the generation of transcoding path algorithm was reviewed to transcode a source'data satisfying the needed QoS from a destination and play it considering given transcoders and network. This method used only workload as a parameter although two parameters, workload and throughput, were needed to process multimedia stream in a transcoder, Therefore generated transcoding path with this method had additional calculation to check playability whether it was safisfed the QoS of a destination or not. To solve the problem this paper suggests T algorithm with evaluation function using isochronous property that is needed for multimedia stream to arrive a destination. That means, most playable path is selected with heuristic search based isochronous property between many transcoding paths. Using the suggested algorithm, a transcoding path can be generated faster to play the multimedia data with different end-to-end QoS in real-time transmission.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.355-364
• /
• 2005

With fast advances in computing power and network technologies, online streaming services of continuous media (CM) have been popularly implemented on the Web. To implement such services, a variety of CM streams need to be processed efficiently, so that the Sweep scheme was proposed. This scheme has several advantages such as hiccup-free playbacks and seek-time optimization. In this scheme, however, the entire CM streams are scheduled with a single scheduling period, called a cycle. Since only one scheduling period is allowed in this scheme, a significant amount of disk time is usually wasted because of its inflexible disk schedules. To solve this, we propose a new dynamic Sweep scheme. For this, we devise an algorithm that is able to expand scheduling periods of serviced CM streams and propose a new admission control mechanism guaranteeing hiccup-free playbacks. To show performance gains, we execute various simulation experiments. From the experimental results, we can see that the proposed scheme outperforms the Sweep scheme in terms of disk utilization and scheduling flexibility.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.367-376
• /
• 1999

A variable bit-rate based video services have much limitation for bandwidth management, since its trarfic has a some variances in frame level. In particular, the bandwidth management for video which has characteristics of VBR traffic such a MPEG video could be more complicated. Also, it is difficult to manage the bandwidth effectively for proving a VCR function from VOD service, since we don't know the traffic variance exactly at that time. In this paper, we proposed the dynamic bandwidth allocation a scheme based on VBR traffic based stored video such as MPEG for interactive video service. This scheme can maximize the given total bandwidth through the prefetch based variable length bandwidth allocation scheme and dynamic bandwidth management scheme for multiple streams. Also, our scheme can be used for a MPEG-based bandwidth allocation scheme, and provides the method that can maximize the utilization of network resource for multiple stream by using a dynamic bandwidth management.

• Electronics and Telecommunications Trends
• /
• v.21 no.5 s.101
• /
• pp.61-68
• /
• 2006

이벤트 기반 서비스 기술은 실시간으로 발생하는 이벤트를 감지하고 분석하여 이에 대한 반응으로 서비스가 연동되는 기술로, 실시간 기업 환경 구축이나 유비쿼터스 서비스 환경 구축을 위한 핵심 기반 기술이다. 실시간 기업 환경에서 요구되고 있는 기업내업무 프로세스에서 발생하는 다양한 정보를 실시간 모니터링, 분석하여 변화에 대한 신속한 대응을 제공하거나, 유비쿼터스 서비스 환경에서 상황에 맞게 적시에 맞춤형서비스를 제공하기 위해서는 이벤트 기반의 서비스 기술이 요구된다. 본 고에서는 이벤트 기반 아키텍처의 개념, 발전 방향 및 구성 요소에 대해 설명하고, 실시간으로 발생하는 대량의 이벤트를 처리하여 의미있는 상황 정보를 제공하거나 서비스를 연동하는 기술인 이벤트 스트림 처리 기술에 대해 살펴본다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.189-194
• /
• 2002

It is thesis that based on for Croup-Transferring a method of Transferring-Control during real-time. By the development of multimedia, spread of high-speed communication network and generalization of various multimedia services, various techniques an studied by requiring application services for multi-users (meeting-service, remote-service, broadcasting-service, education-service and so on). So we focused on the multimedia group transferring techniques except communication network techniques and multimedia processing techniques, and presented algorithms about a mettled of group-management, a method of delay-control-management that analyzed a effective method of Croup-Control and characters of each group network and used RTP(Real-Time Protocol) / RTCP(Real-Time Control Protocol).