• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.3-5
• /
• 1998

단일 데이터적 특성을 가진 VOD(Video On Demand)와 같은 멀티미디어 응용의 경우 복합적이고 집합적인 클러스터링 서버구조(composite clustered server structure)를 가정하는 경우가 대부분 이었다. 그러나, 혼합 데이터적 특성이 강한 MNOD 와 같은 멀티미디어 응용은 단일화된 클러스터링 서버 구조 보다는 각 데이터의 특성을 잘 반영할 수 있는 독립적이고 분산된 형태의 클러스터링 구조가 필수적이다. 이에 본 논문은 MNOD 서비스를 위한 새로운 형태의 클러스터링 서버 구조를 설계하고, 구조의 당위성을 큐잉 분석 Alc 스케줄링의 효율성 측면에서 증명하려고 시도하였다. 큐잉 분석 결과, 독립적 형태의 구조가 지니는 확장성, 실패회복의 용이성 등의 제반 장점 뿐 아니라 응답시간의 측면에서도 기존의 집합적인 클러스터링 구조보다 좋은 성능을 보였다.

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

• International journal of advanced smart convergence
• /
• v.4 no.1
• /
• pp.18-30
• /
• 2015

As the speed of networks that subscribers can use has greatly increased, demand for high-quality broadcast content, such as from Internet Protocol Television (IPTV) and Video on Demand (VoD), is likewise increasing. Therefore, while broadcasters are increasing content and channels, they are striving to improve consumer quality of experience (QoE) to differentiate themselves from competitors, including by producing higher physical-quality content. Recently, subjective measurement methods have been internationally standardized as the most reliable approach for measuring and evaluating IPTV QoE. However, a majority of these methods are performed in experimental environments and are based on the extremely brief viewing period of approximately ten seconds using original reference videos. It is actually difficult to apply standard evaluation methods based on a ten-second viewing interval to assess real broadcast watching of IPTV or other services that involve a longer time (i.e., more than thirty minutes). In this paper, we therefore propose a method that accommodates actual viewing environments. Using the mean opinion score, we experimentally analyze the effects of evaluation interval changes under actual conditions in which IPTV service is provided. In addition, we propose improvements by applying the results into actual live broadcast IPTV service and by analyzing consumer service QoE.

• Asia pacific journal of information systems
• /
• v.31 no.1
• /
• pp.17-42
• /
• 2021

This study examines the adoption of subscription-based video on demand (SVOD) streaming services among consumers. Primarily, we explore the moderating effect of the two models of streaming services, standalone streaming services and bundled streaming services, on the users' adoption. We employ the Unified Theory of Acceptance and Use of Technology (UTAUT2) model in this study. We utilize the data collected from 337 Indian respondents and find that all constructs of the UTAUT2 model act as motivators of adoption. Gender, age, and experience of the respondent also play a moderating role in the adoption of streaming services. We also find that providing bundled streaming service positively moderates price-value and hedonic motivation of adoption. The study is perhaps the first of its kind that aims to understand the motivations for adoption of SVOD services, particularly in the Indian context, which has the fastest-growing base of internet users in the world.

• Electronics and Telecommunications Trends
• /
• v.14 no.2 s.56
• /
• pp.131-132
• /
• 1999

여러 대의 PC를 활용하여 효율적이고 확장성이 뛰어난 고성능 서버를 구축하는 클러스터링 기술을 기반으로 저렴한 가격으로 동시에 수십 명부터 1,000명(MPEG-1, 1.544Mbps 기준)이상의 사용자에게 멀티미디어 서비스 제공이 가능한 클러스터 기반 대용량 VOD(Video on Demand) 서버 소프트웨어인 MovieRo 개발 내용이다.

• Journal of Korea Multimedia Society
• /
• v.7 no.3
• /
• pp.357-367
• /
• 2004

In VOD systems the number of channels available to a video server is limited since the number of channels, the video server can support, is determined by the communication bandwidth of the video server. Multicast techniques such as batching, patching and batch-patching have been proposed to reduce I/O demand on the video server by sharing multicast data. In this paper, we propose a channel reservation batch-patching technique that first applies the batching technique to hot video requests and then applies the patching technique to the batches of the hot video requests. And the proposed technique reserves a part of the channel capacity of the video server for many hot video requests, so that the hot video requests can be served without defection. The performance of the proposed technique is compared with those of Patching and Batch-Patching techniques in terms of average service latency, defection rate, fairness and frame reduction rate by simulations.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2954-2972
• /
• 1998

It is expected that the transport of compressed video will become a significant part of total network traffic because of the widespread introduction of multimedial services such as VOD(video on demand). Accordingly, VBR(variable bit-rate) encoded video will be widely used, due to its advantages in statistical multiplexing gain and consistent vido quality. Since the transport of video traffic requires larger bandwidth than that of voice and data, the characterization of video source and traffic modeling is very important for the design of proper resource allocation scheme in ATM networks. Suitable statistical source models are also required to analyze performance metrics such as packet loss, delay and jitter. In this paper, we analyzed and described on the characterization and traffic modeling of MPEG video sources. The models are broadly classified into two categories; i.e., statistical models and deterministic models. In statistical models, the models are categorized into five groups: AR(autoregressive), Markov, composite Marko and AR, TES, and selfsimilar models. In deterministic models, the models are categorized into $({\sigma},\;{\rho}$, parameterized model, D-BIND, and Empirical Envelopes models. Each model was analyzed for its characteristics along with corresponding advantages and shortcomings, and we made comparisons on the complexity of each model.

• Journal of Korean Society of Archives and Records Management
• /
• v.20 no.4
• /
• pp.107-128
• /
• 2020

In recent years, many users preferred video records, and as the broadcasting video data becomes necessary, the demand for video records' use has increased. However, most broadcasters' archive agencies currently provide archive services only for internal employees, and for the general public. In this study, the web-based online information services provided to the general public in the archive sites of domestic and foreign public broadcasting companies were examined and analyzed. The evaluation criteria for the web-based records information services were identified in three service areas: online accessibility, search and online browsing, and outreach or expansion services. The overseas public broadcasters' web-based services and the public broadcasting companies' current status were examined for each area. Based on the examination, direction improvements, such as providing online search and records, developing various outreach services, and expanding user levels were proposed for the information services on broadcasting video data in public broadcasting companies for the general public.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.101-103
• /
• 1998

뉴스기사를 구성하는 NOD데이터는 VOD(Video on Demand) 데이터와는 달리 미디어의 종류 및 크기, 시간적인 접근 지역성, 사용자와 상호 작용성 등의 차이점을 가질 뿐만 아니라 새로운 뉴스기사가 수시로 생성되고 사용자가 인기도가 높은 기사와 최신의 뉴스기사에 더 많이 접근하는 특성을 가진다. 본 논문에서는 현재 서비스중인 전자신문의 로그파일을 분석하여 NOD 뉴스기사의 인기도가 Zipf분포와 다름을 보이고, 뉴스기사의 생명주기Lifr Cycle)에 따른 접근 확률분포 제시한다. NOD 데이터의 접근 편기성으로 인하여 데이터 캐싱을 통한 NOD 서버의 성능 향상을 기대할 수 있으나 뉴스기사의 생명주기가 짧고 접근시간대별로 사용자 접근형태가 변하는 등의 이유로 단순히 인기도만 고려한 캐싱은 빈번한 데이터 재배치 문제로 인해 높은 캐시 관리비용을 야기한다. 따라서 본 논문에서는 뉴스 기사의 접근 편기성에 나타나는 인기도(popularity)와 생명주기를 조합한 척도를 제안하고 이를 이용한 재배치를 제안한다.

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

A distributed video-on-demand (VoD) system is one where collection of video data is located at dispersed sites across a computer network. In a single site environment, a local video server retrieves video data from its local storage device. However, in the setting of a distributed VoD system, when a customer requests a movie from the local server, the server may need to interact with other servers located across the network. In this paper, we present three types of presentation plans that a local server must construct in order to satisfy the customer request. Informally speaking, a presentation plan is a temporally synchronized detailed sequence of steps that the local server must perform for presenting the requested movie to the customer. This involves obtaining commitments from other video servers, obtaining commitments from the network service provider, as well as making commitments of local resources, within the limitations of available bandwidth, available buffer, and customer data consumption rates. Furthermore, for evaluating the goodness of a presentation plan, we introduce two measures of optimality for presentation plans: minimizing wait time for a customer, and minimizing access bandwidth is used. We develop algorithms to compute optimal presentation plans for all three types, and carry out extensive experiments to compare their performance. We have also mathematically proved certain results for the presentation plans that had previously been verified experimentally in the literature.