• Journal of Digital Contents Society
• /
• v.9 no.1
• /
• pp.69-75
• /
• 2008

Video-on-demand (VOD) service allows subscribers to view any video whenever they want. With the development of the high speed computer networks, web-based VOD services are available. To support VOD services, charging scheme is necessary. Pay-per-view is an effective charging scheme for VOD services. Pay-per-view allows the subscribers to pay for what they have viewed. Privacy is another important attribute for VOD services. The subscribers may not want to reveal what they have viewed to anyone including the VOD provider. Anonymity makes it complicated to calculate charge for the VOD service. An approach that achieves both anonymity and pay-per-view charge calculation is necessary. In this paper, anonymous web-based VOD service is proposed. The proposed approach also gives pay-per-view capability.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.737-740
• /
• 1998

Under the worldwide booming internet environment, there has been increasing demand for various multimedia services. Especially the demand for effective video services has been rapidly increased. In this paper, we describe the implementation of video service system for internet use based on H/263 video compression technique and UDP socket on the TCP/IP environment. In addition, by using the plug-in-play technique, the implemented system improved user interface for correct retrieval and easy usage.

• The Journal of Korean Association of Computer Education
• /
• v.5 no.1
• /
• pp.57-66
• /
• 2002

Real time multimedia data services have been made possible by the rapid development of the computer and internet technology. Based on the technology, Many multimedia system developer try to use VOD(Video on Demand) and GVA technologies for distance education. However the system has mainly been developed to provide the video screen of good quality in real time and to compose contents efficiently. Not many researches and developments have been made for providing the users that is taking distance education with various types of service using VOD and GVA. Therefore In this paper we have designed and implemented an active on-demand multimedia service system to improve user-side service quality in distance education using VOD and GVA service. The on-demand multimedia service system can prominently help users to save the time and effort to search and select the studying data by this paper enables off-line search functions through E-mail and periodical current awareness service supported by PUSH technology, user oriented information booking supported by SDI service and feedback service.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.3
• /
• pp.919-940
• /
• 2012

Video on Demand (VOD) is a multimedia service which allows a remote user to select and then view video at his convenience at any time he wants, which makes the VOD become an important technology for many applications. Numerous periodic VOD broadcasting protocols have been proposed to support a large number of receivers. Broadcasting is an efficient transmission scheme to provide on-demand service for very popular movies. This paper proposes a new broadcasting scheme called Popularity Cushion Staggered Broadcasting (PCSB). The proposed scheme improves the Periodic Broadcasting (PB) protocols in the latest mobile VOD system, which is called MobiVoD system. It also, reduces the maximum waiting time of the mobile node, by partitioning the $1^{st}$ segment of the whole video and storing it in the Local Media Forwarder (LMF) exactly in the Pool of RAM (PoR), and then transmitting them when the mobile nodes miss the $1^{st}$ broadcasted segment. The results show that the PCSB is more efficient and better than the all types of broadcasting and caching techniques in the MobiVoD system. Furthermore, these results exhibits that system performance is stable under high dynamics of the system and the viewer's waiting time are less than the previous system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.491-508
• /
• 2010

In peer-to-peer (P2P) on-demand streaming networks, the alleviation of server load depends on reciprocal stream sharing among peers. In general, on-demand video services enable clients to watch videos from beginning to end. As long as clients are able to buffer the initial part of the video they are watching, on-demand service can provide access to the video to the next clients who request to watch it. Therefore, the key challenge is how to keep the initial part of a video in a peer's buffer for as long as possible, and thus maximize the availability of a video for stream relay. In addition, to address the issues of delivering data on lossy network and providing scalable quality of services for clients, the adoption of multiple description coding (MDC) has been proven as a feasible resolution by much research work. In this paper, we propose a novel caching scheme for P2P on-demand streaming, called Dynamic Buffering. The proposed Dynamic Buffering relies on the feature of MDC to gradually reduce the number of cached descriptions held in a client's buffers, once the buffer is full. Preserving as many initial parts of descriptions in the buffer as possible, instead of losing them all at one time, effectively extends peers’ service time. In addition, this study proposes a description distribution balancing scheme to further improve the use of resources. Simulation experiments show that Dynamic Buffering can make efficient use of cache space, reduce server bandwidth consumption, and increase the number of peers being served.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3182-3194
• /
• 2000

It is strongly beliefed that Video on Demand(VOD) will become one of the most promising services in Broadband Integrated Services Digital Network(B-ISDN) for the nest generation VOD service can be classified into two types of services 'Near VOD(NVOD) and Interactive VOD(IVOD). For both services, some video servers should be installed at some nodes(especially, at the root node for NVOD service) in the tree structued VOD network,so that each node with video server stores video programs and distribules stored programs to customers. We consider thre kinds of cost.a program transmission cost, a program storage cost, and a video server installation cost. There exists a trade-off relationship among those three costs according to locationsl of video servers and the kinds of programs stord at each video server. Given a tree structured VOD network, and the total number of programs being served in the network, the resource allocation problem in a VOD network providing both IVOD and NVOD services is to determine where to install video servers for IVOD service, which and how many programs should be stored at each video server for both IVOD and NVOD services, so as to minunize the total cost which is the sum of three costs for both IVOD and NVOD services. In this paper we develop an efficient cynamic programming algorithm for solving the problem. We also implement the algorithm based on a service policy assumed in this paper.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2790-2796
• /
• 1999

In video-on-demand systems, the I.O bandwidth of video servers is the critical resource which contributes to increase in latency. Several approaches: bridging, piggybacking are used to reduce the I/O demand on the video server through sharing. Batching delays the requests for the different videos for a batching window so that more requests for the same video arriving during the current batching window may be served using the same stream. In this paper, we propose an adaptive reservation-based batching policy which dynamically reserves video server capacity for popoular videos according to video server loads. The performance of the proposed policy is evaluated through a simulation, and is compared with simple batching and static reservation-based batching policies. As the result, we know that the adaptive reservation-based batching policy more improves service ratio and average waiting time than simple batching and simple reservation-based batching policy more improves service ratio and average waiting time than simple batching and simple reservation-based batching polices.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.8
• /
• pp.2080-2091
• /
• 1997

It is generally recognized that Video On Demand (VOD) service will become a promising interactive service in the emerging broadband integrated services digital networks. A centralized VOD system, all programs are stored in a single VOD server which is linked to each user via exchanges, is applicable when a small number of users enjoys the VOD service. However, in case of large service penetration, it is very important to solve the problems of bandwidth and load concentrating in the central video server(CVS) and program transmission network. In this paper, the architecture of the video distribution service network is studied, then a traffic characteristics and models for VOD system are established, and proposed program allocation method to video servers. For this purpose, we present an analysis of program storage amount in each LVS(Local Video Server), transmission traffic volume between LVSs, and link traffic volume between CVS and LVSs, according to changing the related factors such as demand, the number of LVS, vision probability, etc. A method for finding out storage capacity in LVSs is also presented on the basis of the tradeoffs among program storage cost, link traffic cost, and transmission cost.

• Journal of Information Processing Systems
• /
• v.6 no.4
• /
• pp.575-596
• /
• 2010

Video-on-Demand services are increasing rapidly nowadays. The load on servers can be very high, even exceeding their capacity. For popular contents, we can use a Periodic Broadcast (PB) strategy using multicast to serve all clients. Recent development of PB uses multiple channels broadcasting for segments of movies in certain patterns, so that users only need to wait for a small segment to start the service. However, users need higher download capacity to download multiple segments at a time. In order to compensate for this, a proxy server can help to reduce download bandwidth requirements by holding some segments for a certain time. This research will focus on more recent PB schemes that couldn't be covered by previous Proxy-Assisted Periodic Broadcast strategies.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.89-92
• /
• 1996

It is generally recognized that Video On Demand (VOD) service will become a promising interactive service in B-ISDN. We consider a hierarchical two level network architecture for VOD service. The first level consists of connected Local Video Servers(LVSs) in which a limited number of high vision programs are stored. The second level has one Central Video Server(CVS) containing all the programs served in the network. The purpose of this paper is to analyze the network traffic and to propose the storage policy for LVSs. For this purpose, we present an analysis of program storage amount in each LVS, transmission traffic volume between LVSs, and link traffic volume between CVS and LVSs, according to changing the related factors such as demand, the number of LVSs is also presented on the basis of the tradeoffs among program storage cost, link traffic cost, and transmission cost.