• Journal of Korea Multimedia Society
• /
• v.8 no.12
• /
• pp.1597-1604
• /
• 2005

Recursive Patching is an efficient multicast technique for large-scale video on demand systems and recursively shares existing video streams with asynchronous clients. When Recursive Patching initiates a transition stream, it always makes a transition stream have additional data for the worst future request. In order to share a VOD server's limited network bandwidth efficiently, this paper proposes Practical Patching that removes the unnecessary data included in the transition stream. The proposed Practical Patching dynamically expands ongoing transition streams when a new request actually arrives at the server. As a result, the transition streams never have unnecessary data. Simulation result confirmed that the proposed technique is better than Recursive Patching in terms of service latency and defection rate.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.12
• /
• pp.71-81
• /
• 2011

The EMR management services can monitoring the patients' record with any doctors in any hospital by using the internet and smartphones online. To handle the real time, multidimensional, continuous data, database management systems (DBMS) must cope with high insert rates for updates, however the traditional DBMS suffers from processing these kinds of data due to its serious design bottlenecks. So the researchers put forward to Data Stream Management System (DSMS). In this paper we describe the real-time Data Stream Server for Continuity of Care Record (CCR) that including continuos query processor. This system is compiled with DSMS and DBMS in EMR system for processing and monitoring the coming CCR data stream, and also storing the processed result with high-efficiency. The system enables users not only to query stored CCR information from DBMS, but also to execute continue query on real-time CCR Data Stream, and health information can be transferred between different healthcare providers that would reduce medical error. At last, we develop a IPhone mobile application to test the proposed real-time data stream server.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.765-774
• /
• 2001

In this paper, we proposed the striping policy for the storage nodes in the Linux-based parallel media stream server. We newly developed a storage clustering architecture, and named it as a system RAID architecture. In this system, many storage cluster nodes are grouped to operate as a single server. This system uses unique striping policy to distribute multimedia files into the parallel storage nodes. If a service request occurs, each storage cluster node transmits striped files concurrently to the clients. This scheme can provide the fair distribution of the preprocessing load in all storage cluster nodes. The feature of this system is a relative striping policy based on the file types, service types, and the number of storage nodes to provide the best service.

• Journal of Advanced Navigation Technology
• /
• v.6 no.4
• /
• pp.290-295
• /
• 2002

In Mpeg-4 system, objects are composed of ES(Elementary Stream). Each of the objects is managed independently by object-based coding and is transmitted via DMIF(Delivery Multimedia Integration Framework). The data streams in Mpeg-4 are transmitted with using DVB-Data Carousel which can improve the reliability and efficiency by cyclic retransmission. This paper describes a system which transmits some part of data stream of Mpeg-4 object with using DVB-Data Carousel to clients via satellite. This also uses a performance enhancing proxy server for reducing round trip time between ground network and satellite.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.225-228
• /
• 2001

We describe the implementation of MPEG-4 Systems for Video on Demand services. We discuss the issues in implementint MPEG-4 Systems, specially Object Description and Elementary stream management(Buffer control, Synchronization). The file-server pump the multiplexed streams to the client through the DMIF. Interaction between server and client is done with User Command(play, pause, stop, fast foward, ...). Stream data are multiplexed off-line. In advance, the file-server read multiplexed streams and pumps it to MPEG-4 terminal(client). Our system can be used in various application not only Video on Demand services, but also Internet broadcasting, remote surveillance, mobile communication, remote education, etc.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.2
• /
• pp.293-300
• /
• 2004

In this paper, we devise both methods supporting interactive VCR-like functions for MPEG stream and minimizing the storage space. Specifically, we proposed both methods to efficiently stripe MPEG stream into multiple disks, and an access strategy to retrieve the distributed streams over the disks. To accurately locate the streams to be referred to, we introduce a table indexing the location. When client request Fast Forward(FF)/Fast Backward(FB), VOD(Video on Demand) server refer to this index table supporting FF/FB functions. Experimental result shows that the proposed method can reduce the additional storage space needed when VOD server services FF/FB functions.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2S
• /
• pp.656-665
• /
• 2000

A critical issue in the performance of a video-on-demand system is the I/O bandwidth required in order to satisfy client requests. Several approaches: batching, bridging, piggybacking are used ot reduce the I/O demand on the video server through sharing. Piggybacking is the policy for altering display rates of requests in progress fro the same object, for the purpose of merging their corresponding I/O streams into a single stream, which can serve the entire group of merged requests. In this paper, we propose a new policy called an adaptive reservation-based piggybacking that dynamically reserves the I/O stream capacity of video server for popular videos according to video server loads to immediately schedule the requests for popular videos. The performance of the proposed policy is evaluated through simulations, and is compared with that of simple piggybacking. As the result, we know that the adaptive reservation-based piggybacking provides better service probability, average waiting time and percentages saving in frames than simple piggybacking.

• Journal of Information Processing Systems
• /
• v.17 no.2
• /
• pp.227-241
• /
• 2021

Object detection techniques based on deep learning such as YOLO have high detection performance and precision in a single channel video stream. In order to expand to multiple channel object detection in real-time, however, high-performance hardware is required. In this paper, we propose a novel back-end server framework, a real-time AI vision platform (RAVIP), which can extend the object detection function from single channel to simultaneous multi-channels, which can work well even in low-end server hardware. RAVIP assembles appropriate component modules from the RODEM (real-time object detection module) Base to create per-channel instances for each channel, enabling efficient parallelization of object detection instances on limited hardware resources through continuous monitoring with respect to resource utilization. Through practical experiments, RAVIP shows that it is possible to optimize CPU, GPU, and memory utilization while performing object detection service in a multi-channel situation. In addition, it has been proven that RAVIP can provide object detection services with 25 FPS for all 16 channels at the same time.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.13 no.4
• /
• pp.213-219
• /
• 2017

Streaming server is that an image produced in real time or a file form of image produced ahead consists of SNS service, and the relay module of streaming server includes output management module that set an output channel more than 2 and control transmission of video content. This thesis intends to suggest how to stream through plural output channel that contains output channel of external streaming server using relay module and do streaming provided to terminal receiving image, and streaming server, streaming system for this. Thus, by extending output channel sending out image to output channel of external streaming server, the scale of streaming server is not limited and the process allotting external streaming server into output channel sending the image becomes simple, so management of output channel becomes efficient even when sending several images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2852-2859
• /
• 1997

Video-On-Demand system provides electronic video rental services from remote video servers on a broadband communication networks. Most of proposed VOD systems are typically designed for one-to-one conncetion between a user and video server. Therefore, video server stream services to customers individually by allocating a dedicated transmission channel and a set of video server resources for each customer. However, it is inefficiency and wxpensive way when server support multiple users who access the same video stream with a dedicated video channel. Therefore, to achieve cost-effectiveness, batching have studied method that uses multicast communication to simultaneously service all users requesting the same video with a single video with a single video stream. However, the application of the multicast communication by batching detract from the VCR-like function and on-demand nature of the system. In this paepr, we propose a scheme that can support an interactive VCR for all user requesting the same video stream with batching. To reduce a server I/O and network bandwidth requirement, dynamic buffer is allocated to access node which has variable playout poit. Consequently, it makes possible interactive VCR operation as if customer uses true VOD system. Also, this scheme can just deliver a multicast stream without delay after an initial request or VCR action occurred. The policy can guarantee acceptable services to number of users at minimum cost.