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

• Journal of Korea Multimedia Society
• /
• v.14 no.9
• /
• pp.1152-1164
• /
• 2011

Stock price is stream data to change continuously. The characteristics of these data, stock trends according to flow of time intervals may differ. therefore, stock price should be continuously prediction when the price is updated. In this paper, we propose the new prediction system that continuously predicts the stock price according to the predefined time intervals for the selected stock item using HTM model. We first present a preprocessor which normalizes the stock data and passes its result to the stream sensor. We next present a stream sensor which efficiently processes the continuous input. In addition, we devise a storage node which stores the prediction results for each level and passes it to next upper level and present the HTM network for prediction using these nodes. We show experimented our system using the actual stock price and shows its performance.

• Journal of Broadcast Engineering
• /
• v.21 no.3
• /
• pp.436-449
• /
• 2016

This paper compares the transport overhead of MMT (MPEG Media Transport) with that of MPEG-2 TS (Transport Stream). MPEG-2 TS is globally used in multiplexing compressed audio and video data in digital broadcast industry, including areas of DTV (Digital Television), IPTV (Internet Protocol Television), and DMB (Digital Multimedia Broadcasting). It was the early 1990s when MPEG-2 TS standard was established. After more than two decades of years since its first establishment, many parts of MPEG-2 TS turned out to be inappropriate to today's broadcast and communication environment. Given the situations, in 2014 MPEG (ISO/IEC JTC 1 SC 29/WG 11) standardized MMT as the next-generation multimedia transport standard hopefully that can replace MPEG-2 TS. In this paper, with assumptions of broadcast service scenarios we applied both MMT and MPEG-2 TS to each scenario and we calculated their transport overheads. We used a software program that counts the transport overhead, which was developed in our laboratory for this paper. And we conducted a comparative analysis based on the calculated result of transport overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6B
• /
• pp.1098-1107
• /
• 1999

In multimedia applications, a source usually generates multiple streams. By heterogeneous multimedia multicast, we mean a recipient can receive some of them, not necessarily all of them. A recipient bids for what it wants to receive and the source gains the same amount when a connection is established. The problem of distributing streams for heterogeneous multicast to maximize the source's gain, can be solved using a 0-1 integer programming, hewn as NP-complete. In this paper, we propose efficient stream distribution algorithms in two different types of multicast models. The first restricted model assumes that the capacity for a link in the multicast tree is grater than or equal to the capacities of its descendant links. In the second unrestricted model, we drop out the restriction in the restricted model. Proposed algorithms have better time and space complexities compared with any existing one. In addition, distributed implementations are straightforward, which is very useful for large networks.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.6
• /
• pp.203-210
• /
• 2013

Majority of the wireless ad hoc routing protocols are proposed to find feasible routes without considering the network load, end-to-end link quality and bandwidth requirements of the application. Therefore, protocol may not provide sufficient quality of service (QoS) to a high speed traffic such as multimedia. In this paper, we propose a path-quality and bandwidth-estimation based routing protocol (PBBR) for the high quality multimedia stream that can meet the application's bandwidth requirements and find the best reliable route. The novelty of this protocol is to select a reliable path to respond the application's requirements based on available bandwidth at each intermediate node and end-to-end path loss ratio. Obtained results from the simulation demonstrates that our protocol can achieve sufficient performance in terms of throughput and end-to-end delay.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.6
• /
• pp.1330-1336
• /
• 2014

QoS techniques and transmitted in real-time communication with the advancement of technology a variety of applications and services are available these days, mobile devices bogeuphwa LTE technology to the development of multimedia services with high quality can be realized. In order to satisfy this condition simply with a router with an increased bandwidth expansion by considering the increase in the routing table of the network scalability problems included. Burst traffic data to be distributed according to the environment is to be centered. To do this, the destination -based routing method to transmit the current paper -based (Source routing) routing settings are required. In this paper, published by the IETF, IP switching system based on standardized protocol Label Switching Multi-Protocol Label Switching (MPLS) network by using the existing Best Effect is difficult to guarantee QoS for multimedia transmission in MPLS network environment using optimized QoS guarantees to transmit the multicast.

• Journal of Korea Multimedia Society
• /
• v.3 no.2
• /
• pp.121-132
• /
• 2000

Most of video indexing applications depend on fast and efficient archiving, browsing, retrieval techniques. A number of techniques have been approached about only pixel domain analysis until now. Those approaches brought about the costly overhead of decompressing because the most of multimedia data is typically stored in compressed format. But with a compressed video data, if we can analyze the compressed data directly. then we avoid the costly overhead such as in pixel domain. In this paper, we analyze the information of compressed video stream directly, and then extract the available features for video indexing. We have derived the technique for cut detection using these features, and the stream is divided into shots. Also we propose a new brief key frame selection technique and an efficient video indexing method using the spatial informations(DT coefficients) and also the temporal informations(motion vectors).

• Journal of Korea Multimedia Society
• /
• v.7 no.7
• /
• pp.886-895
• /
• 2004

In this paper, we propose the dynamic allocation scheme of the CPU bandwidth to efficiently integrate and schedule these tasks in the same system, where multimedia tasks and hard real-time tasks can coexist simultaneously. Hard real-time tasks are guaranteed based on worst case execution times, whereas multimedia tasks modeled as soft real-time tasks are served based on mean parameters. This paper describes a server-based allocation scheme for assigning the CPU resource to two types of tasks. Especially for MPEG video streams, we show how to dynamically control the fraction of the CPU bandwidth allocated to each multimedia task. The primary purpose of the proposed method is to minimize the mean tardiness of multimedia tasks while satisfying the timing constraints of hard real-time tasks present in the system. We showed through simulations that the tardiness experienced by multimedia tasks under the proposed allocation scheme is much smaller than that experienced by using other scheme.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1219-1230
• /
• 2003

We analyze an integrated voice/data CDMA system, where the whole channels are divided into voice prioritized channels and voice non-prioritized channels. For real-time voice service, a preemptivc priority is granted in the voice prioritized channels. And, for delay-tolerant data service, the employment of buffer is considered. On the other hand, the transmission permission probability in best-effort packet-data service is controlled by estimating the residual capacity available for users. We build a 2-dimensional markov chain about prioritized-voice and stream-data services and accomplish numerical analysis in combination with packet-data traffic based on residual capacity equation.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.9-32
• /
• 1996

In this paper, we describe a multimedia data processing model that supports wide variety of applications based on multimedia production model. This model supports network-transparent access to stored multimedia data, real-time mult media input devices, and multimedia processing. The model addresses real-time dato a switching and delivery, as well as acquisition, processing, and output. Most translation, compression, and synchronization services are integrated. This model consists of three layers: (1) stream, (2) multimedia presentation, (3) hyperpresentaion. This paper describes the data abstractions associated with each layer. These data abstractions provide a framework for defining the services provided by each layer, and describe the object-oriented mechanisms that provide those services. A sample scenario is presentated to illustrate the use of this model. A server-client architecture and implementation issues, and future directions are also discussed. sed.