• Journal of Internet Computing and Services
• /
• v.13 no.3
• /
• pp.93-105
• /
• 2012

A data stream is a series of tuples which are generated in real-time, incessant, immense, and volatile manner. As new information technologies are actively emerging, stream processing methods are being needed to efficiently handle data streams. Especially, finding out an efficient evaluation for a multi-way join would make outstanding contributions toward improving the performance of a data stream management system because a join operation is one of the most resource-consuming operators for evaluating queries. In this paper, in order to evaluate efficiently a multi-way join continuous query, we propose a novel method to decrease the cost of a query by eliminating unsuccessful intermediate results. For this, we propose a matrix-based structure for monitoring data streams and estimate the number of final result tuples of the query and find out unsuccessful tuples by matrix multiplication operations. And then using these information, we process efficiently a multi-way join continuous query by filtering out the unsuccessful tuples in advance before actual evaluation of the query.

• Journal of Broadcast Engineering
• /
• v.18 no.2
• /
• pp.283-296
• /
• 2013

Various video services with networks are increasingly available as smart phones, computers and IPTV are widely used. However, transmission over networks may experience transmission errors due to traffic increases and noise. As a result, video quality may suffer. Therefore, quality monitoring emerges as an important issue. In this paper, we propose a video quality assessment method using bit stream information. The video quality metric is calculated using header information and ES (elementary stream) information. To assess performance of the proposed algorithm, subjective quality assessment tests are conducted (VGA resolution). It is shown high correlation between subjective result and the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1112-1123
• /
• 2002

Providing a multimedia service requires efficient network bandwidth allocation scheduling. Typically, transmission of information with bursty characteristics, such as a video data stream, utilizes some type of smoothing technique that reduces the transmission rate fluctuation. While capable of a drastic reduction in the peak transmission rate, even the optimum smoothing algorithm proposed to date, however, is rather inadequate for multi-stream applications that share network bandwidth since such an algorithm has been designed and applied toward handling each independent stream. In this paper, we proposed an efficient bandwidth allocation algorithm that addresses these shortcomings. The proposed bandwidth allocation algorithm is divided into two steps, a static bandwidth allocation and a dynamic bandwidth allocation. In the former case, the peak rate reduction is achieved by maintaining the accumulated data in the user buffer at a high level, whereas the concept of real demand factor is employed to meet the needs of multi-stream bandwidth allocation in the latter case, Finally, the proposed algorithm's performance was verified with ExSpect 6.41, a Petri net simulation tool.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2179-2187
• /
• 1999

To privide multimedia mobile communication services for the users in scattered locations, the application ATM cells efficiently in wireless communications, it is effective to the use TDMA method. However, it is necessary to have methods to compensate the CDV(cell delay variation) caused by the difference between TDMA-ATM and cell stream multiplexing of the users. This paper optimizes the cell control time(Tc) when VBR traffic inputs have MMPP by applying CDV characteristics of time stamp method, which has the most advantages among compensation methods of CDV. This paper suggests a cell stream multiplex method employing time stamp techniques to reduce CDV for wireless suggest method shows that CDV distribution and cell stream multiples rangd can be controlled to 1.2${\times}$Tc which reduced over the VBR service in the TDMA-WATM transmission. This paper also presents evaluation of the suggested architecture obtained simulation.

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

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

Video-On-demand system provides electronic video rental services from remote video servers on a broadband communication networks. When we assume some situation that serve the same video stream by batching, each time single video stream became available at server-end side, we face the problem that what video stream to be scheduled at what time instant. Hence, in order to manage the resource bandwidth which is different at each stream, the policy of channel allocation became important factor. In this work, we proposed three type of scheduling policies with queueing, as are cumulative Waiting Time(CWT), Mean Waiting Time(MWT) and Predictable Popular Factor(PPF). While CWT policy is good for popular video, MWT policy was good for non-popular video. Also, we know that PPT policy has some fairness for average wait time and reneging rate of user requests.

• Journal of Internet Computing and Services
• /
• v.12 no.2
• /
• pp.85-101
• /
• 2011

The recommender system analyzes users' preference and predicts the users' preference to items in order to recommend various items such as book, movie and music for the users. The collaborative filtering method is used most widely in the recommender system. The method uses rating information of similar users when recommending items for the target users. Performance of the collaborative filtering-based recommendation is lowered when attacker maliciously manipulates the rating information on items. This kind of malicious act on a recommender system is called 'Recommendation Attack'. When the evaluation data that are in continuous change are analyzed in the perspective of data stream, it is possible to predict attack on the recommender system. In this paper, we will suggest the method to detect attack on the recommender system by using the stream trend of the item evaluation in the collaborative filtering-based recommender system. Since the information on item evaluation included in the evaluation data tends to change frequently according to passage of time, the measurement of changes in item evaluation in a fixed period of time can enable detection of attack on the recommender system. The method suggested in this paper is to compare the evaluation stream that is entered continuously with the normal stream trend in the test cycle for attack detection with a view to detecting the abnormal stream trend. The proposed method can enhance operability of the recommender system and re-usability of the evaluation data. The effectiveness of the method was verified in various experiments.

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• pp.251-254
• /
• 2003

DMB is a next-generation multimedia broadcasting system that not only enables digital broadcasting services such as transmission of CD-duality audio, traffic information, and real-time stock information, but also allows reception of high-quality digital TV in high-speed driving conditions. In the DMB system, MPEG-2 TS(Transport Stream) multiplex method and MPEG-4 System SL(Sync Layer) have been selected as the delivery layer. In this paper, an efficient interface scheme between an MPEG-2 TS processing hardware and software-implemented MPEG-4 system within a DMB terminal device is proposed.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.11a
• /
• pp.845-848
• /
• 2006

In this paper, a ETI management system for a variety of media services based on Terrestrial-Digital Multimedia Broadcasting(T-DMB) is introduced. This system consists of DMB I/O board and DMB multiplexer. The system transforms media data stream over IP(TCP/IP or UDP/IP) for these services to ETI frame(G.703) pushed to T-DMB transmitter.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.99-102
• /
• 1998

As multimedia communication services have been widely spreading, the amount of video traffic is rapidly increasing in B-ISDN environment based on the ATM technology. The image quality of MPEG services is very sensitive to the cell losses in ATM network, since each cell contains information needed at decoding process. Since the number of cells in each frame of MPEG is variable, this video smoothing technology need to prepare a buffer for no overflow or underflow at the transmission, requires that some number of cells be taken to the buffer in client before the playback of video. To ensure the high quality image of video, the video smoothing is scheduled by a Group of Picture unit. In this paper, we then apply the theory to reds nightmare encoded in MPEG, and find minimum smoothing buffer size, initial buffer size. It can be used to study the smoothing of stored video.