• The Journal of the Korea Contents Association
• /
• v.16 no.2
• /
• pp.163-173
• /
• 2016

Recently, massive amounts of stream data have been studied for distributed processing. In this paper, we propose an incremental stream data processing method based on in-memory in big data environments. The proposed method stores input data in a temporary queue and compare them with data in a master node. If the data is in the master node, the proposed method reuses the previous processing results located in the node chosen by the master node. If there are no previous results of data in the node, the proposed method processes the data and stores the result in a separate node. We also propose a job scheduling technique considering the load and performance of a node. In order to show the superiority of the proposed method, we compare it with the existing method in terms of query processing time. Our experimental results show that our method outperforms the existing method in terms of query processing time.

• The Journal of the Korea Contents Association
• /
• v.10 no.9
• /
• pp.68-78
• /
• 2010

As the IP multicast function is very slowly deployed in Internet due to its scalability problem and inter-domain interoperability problem, interest in the P2P(Peer-to-Peer) streaming technologies for the realtime multimedia multicast applications such as IPTV is highly growing. This paper proposes a P2P streaming method for the QoS-sensitive multimedia multicast applications such as highly-interactive personal IPTV and video conferences. The proposed P2P streaming method allows an application to construct a reliable streaming tree in which a proper number of backup peers are placed according to its reliability requirement. The reliable streaming tree reduces the reconnection delay, occurred in the case of a normal and/or abnormal peer leave, so as to minimize the loss of streaming data. In the proposed P2P streaming method, the join delay of a peer called startup delay is also substantially reduced because the bandwidth and end-to-end delay information of every peer kept in a distributed way allows the target peer for a joining peer to be able to be quickly determined. Moreover, the proposed method's peer admission control mechanism based on the bandwidth and end-to-end delay enables the delay-bounded streaming services to be provided for its corresponding applications.

• Information Systems Review
• /
• v.25 no.1
• /
• pp.213-231
• /
• 2023

With the rapid development of live streaming commerce, online host as an information source plays a critical role in affecting live streaming performance. However, the impact of different product types on the relationship between online hosts and live streaming has been less studied. Based on the elaboration likelihood model (ELM) and information source theory, this study aims to empirically investigate what factors influence the sales of live streaming commerce and how product type moderates the relationship between them. The analysis of 11,422 live streaming commerce data collected for four months from October 10, 2021 to February 10, 2022 shows that, among the factors related to source credibility and attractiveness, multi-channel networks (MCN) and the number of followers positively affect the sales volume of live streaming commerce, whereas the reputation score harms the sales. Moreover, the moderating effect of the product type (i.e., ratio of involvement products) on the relationships is confirmed. The findings enrich the literature on live streaming commerce performance. The limitations and future research directions are also discussed.

• Journal of Digital Contents Society
• /
• v.13 no.4
• /
• pp.567-574
• /
• 2012

In this paper, we propose a buffering scheme to improve the performance by adaptively adjusting the length of the buffering period according to the degree of data duplication among peers that belong to each specific playback period in P2P live streaming systems. To do so, we first assign all the peers into many groups depending on their playback time positions. We then determine the length of their buffering periods according to the number of peers belonging to each group. That is, we increase the length of the buffering periods when much buffered data are duplicated among peers within a group while we decrease it when few buffered data are duplicated. By simulation experiments, we show that our proposed buffering scheme can improve the performance significantly compared to the fixed length buffering scheme that have been employed in the existing mesh-based P2P systems.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.30-40
• /
• 2010

The hard disk is one of the most frequently used storage in IPTV sep-top box. It has large storage capacity and provides fast I/O speed compared to its price whereas it causes high power consumption due to mechanical characteristics of spindle motor. In order to play streaming data in the set-top box, spindle motor of hard disk keeps active mode and it causes high power consumption. In this paper, We propose an offset-buffering and multi-mode spin-down method to reduce power consumption for streaming data playback. The offset-buffering inspects the user's viewing pattern and performs buffering based on the analysis of viewing pattern. So, it can maintain the status of spindle motor as idle mode for long time. Besides, it can reduce power consumption by spinning down according to offset-buffer size. The experimental result shows that proposed offset-buffering and multi mode spin-down method is about 28.3% and 12.5% lower than the full-Buffering method in terms of the power consumption and spin-down frequency, respectively.

• Journal of KIISE
• /
• v.43 no.4
• /
• pp.470-479
• /
• 2016

As the number of various types of media data such as UCC (User Created Contents) increases, research is actively being carried out in many different fields so as to provide meaningful media services. Amidst these studies, a semantic web-based media classification approach has been proposed; however, it encounters some limitations in video classification because of its underlying ontology derived from meta-information such as video tag and title. In this paper, we define recognized objects in a video and activity that is composed of video objects in a shot, and introduce a reasoning approach based on description logic. We define sequential rules for a sequence of shots in a video and describe how to classify it. For processing the large amount of increasing media data, we utilize Spark streaming, and a distributed in-memory big data processing framework, and describe how to classify media data in parallel. To evaluate the efficiency of the proposed approach, we conducted an experiment using a large amount of media ontology extracted from Youtube videos.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.287-292
• /
• 2001

Multimedia service systems should have efficient capacity to serve the growing clients and new data. In the general streaming services, users can endure the small amount of time delay at the beginning of service. But they want to have good quality of service. A streaming server tries to transfer video files to clients from a repository of files in real time. The server must guarantee concurrent and uninterrupted delivery of each video stream requested from clients. To achieve its purpose, many stream servers adopt multi-processors, sufficient memory, and RAID or SAN in their systems. In this paper, we propose a Linux-based parallel media streaming server. It is superior to the other systems in the storing structure, fault-tolerance, and service capacity. Since this system supports the web interlace, users can operate easily through the www. This system uses unique striping policy to distribute multimedia files into the parallel storage nodes. If a service request occurs, each storage node transmits striped files concurrently to the client. Its performance is better than the single media streaming service because of the parallel architecture.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.147-151
• /
• 2014

With the advent of tiny and inexpensive computer systems like Raspberry Pi, it has become possible to construct an experimental environment of MANETs (Mobile Ad hoc Networks) at a relatively low cost. In this paper, we implement a node of MANETs with a Raspberry Pi equipped with two 802.11 wireless LAN cards and dynamic routing software running on it. In an outdoor MANETs environment with moving mobile nodes automatically rebuilding broken routes, we conducted a real-time video streaming experiment over the MANET. The video stream is transmitted from a node with a video camera installed on it to another node through the route established dynamically. Each node is equipped with a display device, with which the current status of the node can be checked out. We also implemented software that automatically collects data stored in each node and analyzes the performance of the MANETs. Through this experiment, we could evaluate the performance of realistic video streaming service in a MANETs environment.

• The KIPS Transactions:PartA
• /
• v.15A no.5
• /
• pp.269-274
• /
• 2008

Recently, lots of embedded processors which can run streaming multimedia with high resolution display are introduced. Among the applications running on these embedded processors, real-time audio streaming is one of the applications that suffer from the lack of energy and memory space. In this paper, we propose a novel data compression method on scratch-pad memory, which saves both useful space on the scratch-pad memory and energy. We have implemented the data compression scheme on the GDM1202 real-time audio streaming processor, and the performance results show that we obtained 13.3% energy saving while maintaining comparable application performance to that of the non-compression case.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06d
• /
• pp.315-320
• /
• 2007

본 논문에서는 동시 접속자 수의 제약과 서버 증설에 의한 고비용 문제를 효과적으로 해결할 수 있는 실시간 웹캐스팅 시스템이 설계 구현된다. 기존의 시스템과는 다르게, 다양한 해상도를 지원할 수 있는 IP 카메라로부터 실시간으로 스트리밍 되는 동영상 데이터를 콘텐츠로 하는 라이브 웹캐스팅과, 저장 공간에 저장된 후, 사용자 요구에 따라 파일 데이터를 콘텐츠로 스트리밍 하는 주문형 비디오(VOD) 서비스 모두를 포함하는 total 시스템이다. 압축률이 높은 마이크로소프트사의 WMV(혹은 VC-1) 형식의 동영상 데이터를 사용함으로써 사용 대역폭을 줄여, 많은 Tuner들을 수용할 수 있도록 하였으며, 각 Tuner는 미디어플레이어를 뷰어로써 사용할 수 있도록 하여 시청자들이 별도의 소프트웨어를 설치하지 않도록 하였다. 가능한 모든 시스템 구성 요소들 또한 마이크로소프트에서 제공되는 유틸리티들을 사용할 수 있도록 하여 기존 시스템과의 호환성을 최대화 시켰으며, 특히, Caster, Distributor, 그리고 Tuner, 3 부분으로 나누어, Caster의 규모, 혹은 Tuner의 규모에 따라 Distributor의 확장이 모듈 단위로 가능하도록 하였다.