• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.3
• /
• pp.603-612
• /
• 2010

Recently, with the advance of computing and networking technique, the high speed internet becomes widespread, however, it is still hard job to do streaming the media which requires high network bandwidth over the internet. Previous VoD system researches for streaming over the internet mainly proposed techniques that controls the QoS(Quality of Service) of the media in proportion to the network status. Though, this could be the solution for the service provider while the service user who wants constant QoS may not satisfy with variable QoS. In the paper, we propose greedy precedent frame transmission technique, GPFT, for guarantee of constant QoS. In GPFT, Streaming VoD server prefetches precedent frames and transmits the frame greedily by increasing the frame transmission rate while the available network bandwidth is high. The GPFT uses the prefetched precedent frames to guarantee the QoS while the available network bandwidth is low. The experiment result shows that the proposed GPFT could guarantee the constant QoS by prefetching the frames adaptively to the network bandwidth with the characteristic of video stream.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.1960-1971
• /
• 1998

The researches and developments to provide multimedia communication services such as Video on Demand(VoDJ), real time video phonc and multipoint vidco conferencing on broadband ISDN environmcnts have been proceeded with activity. Specifications for Vol) services which is worked by Digital Audio-Visual Council(DAVIC) to support detail technologies including total service system that is consist of VoD server. delive[\! networl, and Set-Top Box(STB) had been already finished and ITU-T SG16 also recommended the standards of H.300 series terminal aspects for conversational multimedia services, But the architectures of multimedia tenninals recommended and specified by these organizations do not have an efficient st11lcture to provide all of retrieval, distrihution and conversational service due to a different point of view about multimedia terminals and services. In this paper, we analyzed the recornmendatio!E and the specifications of intemational public and private organizations like lTU-T, DAVIC and ATM forum. As a result of these analysis. we propose an efficient terminal architecture, and then we have designed, lmplemented the multimedia communication terminal for offering VoI) and real- time conversation ,,, functional module test according to the individual commumication service session and confirined the validiry or terminal implemented to be used on broadband ISDK environments.

• Journal of information and communication convergence engineering
• /
• v.18 no.2
• /
• pp.100-105
• /
• 2020

With the advent of the 5G era, the rapid growth in demand for mobile content services has increased the need for additional backhaul investment. To meet this demand, employing a content delivery network (CDN) and optical access solution near the last mile has become essential for the configuration of 5G networks. In this paper, a cache-enabled architecture using the passive optical network (PON) is presented to serve video on demand (VoD) for users. For efficient use of mobile backhaul, I propose a request deduplication scheme (RDS) that can provide all the requested services missed in cache with minimum bandwidth by eliminating duplicate requests for movies within tolerable range of the quality of service (QoS). The performance of the proposed architecture is compared with and without RDS in terms of the number of requests arriving at the origin server (OS), hit ratio, and improvement ratio according to user requests and cache sizes.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.12
• /
• pp.660-673
• /
• 2001

In Video-on-Demand (VoD) servers, disk throughput is an important system design parameter because it is directly related to the number of user requests that can be served simultaneously. In this paper, we propose an efficient periodic request grouping scheme for disk array-based VoD servers that reduces the disk seek time, thus improving the disk throughput of VoD disk arrays. To reduce the disk seek time, the proposed scheme groups the periodic requests that access data blocks stored in adjacent regions into one, and arranges these groups in a pre-determined order (e.g., in left-symmetric or right-symmetric fashion). Our simulation result shows that the proposed scheme reduces the average disk bandwidth required by a single video stream and can serve more user requests than existing schemes. For a data block size of 192KB, the number of simultaneously served user requests is increased by 8% while the average waiting time for a user request is decreased by 20%. We also propose an adaptation technique that conforms the proposed scheme to the user preference changes for video streams.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06b
• /
• pp.79-84
• /
• 1998

This paper describes implementation of the core DSM-CC UU interface. It briefly describes the reference model for the DSM-CC and related standards that should be reviewed for the implementation. The Common Object Request Broker Architechture, Revision 2.0 (CORBA 2.0) is sued as a remote procedure call (RPC) scheme for the UU Interface. Entire system was implemented with C++ on Windows NT platforms. The implementation procedure has been decomposed ito two tasks. The first task is to implement the Naming Service for service navigation. The Naming Service is one of the CORBA Services that extend the core CORBA specification. A client GUI is implemented for easy navigation among various services. The second task is to construct multimedia server and client for a Video-on-Demand (VoD) system. MPEG-2 Transport Stream is transported via ATM AAL5 using the Windows Socket 2.2 ATM extension API. A GUI enables the user to navigate the service domain and select a program. After the selection the user can control the MPEG-2 stream with VCR-like buttons.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.6
• /
• pp.53-67
• /
• 2002

The multimedia synchronization is one of the key issues to be resolved in order to provide a good quality of multimedia related services, such as Video on Demands(VoD), Lecture on Demands(LoD), and tele-conferences. In this paper, we introduce an adaptive multimedia synchronization algorithm using the level of buffers and load of servers, which are modeled and analyzed by ExSpect, a Petri net based simulation tool. In the proposed algorithm, the audio and video buffers are divided to 5 different levels, and the pre-defined play-out speed controller tries to make the buffer level to be normal in different temporal relations between multimedia streams using buffer levels and server loads. Because each multimedia packet is played by the pre-defined play-out speed, the media data can be reproduced within the permissible limit of errors while preserving the level of buffers to be normal. The proposed algorithm is able to handle and support various communication restrictions between providers and users, and offers little jitter play-out to many users in networks with the limited transmission capability. The performance of the developed algorithm is analyzed in various network conditions using a Petri net simulation tool.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.200-205
• /
• 2005

전통적인 컴퓨터 시스템은 클라이언트-서버 구조로 클라이언트가 데이터를 요청하면 데이터를 관리하는 서버가 이를 제공한다. 이러한 구조에서 데이터를 요청하는 사용자 수 증가하면 단일 서버(single server)만으로는 모든 사용자의 요청을 처리할 수 없기 때문에 다중 서버로 서비스를 제공하는 방법들이 제안되었다. 다중 서버를 가지는 시스템은 모든 데이터에 대해서 균등한 사용자 요청이 들어오면 최적의 성능을 내지만, VoD(Video On Demand) 서비스와 같이 인기 많은 데이터(hot data)에 대한 요구와 인기 없는 데이터(cold data)에 대한 요구가 현저하게 차이가 나면 인기 많은 데이터를 가지고 있는 서버는 사용자요청을 제대로 처리하지 못하는 반면에 인기 없는 데이터만을 가지는 서버는 시스템 자원을 낭비하는 단점을 가진다. 이 논문은 NS 카드를 장착한 시스템에서 인기 많은 비디오데이터를 QoS와 저장공간의 효율을 위해 부분 컨텐츠 복제 기법을 제안한다. 이 방법은 기존의 전체 컨텐츠를 복제하여 서비스하는 방법과는 달리 컨텐츠의 부분을 복제하고 서비스 시점에서 나머지 부분을 복제함으로써 사용자의 서비스 지연시간이 늘어나지 않으면서 저장공간의 효율성을 높일 수 있다.

• The KIPS Transactions:PartB
• /
• v.12B no.7 s.103
• /
• pp.783-788
• /
• 2005

Recently researches that apply P2P networks to VOD streaming have been actively published In the previous works on VOD streaming, they aimed at achieving two major goals, which are zero-delay transmission and minimization of service rejection ratio. This paper proposes a new method, called ForwardCast, for VOD streaming based on a P2P-based multicasting tree in order to achieve theses two goals. In this method,- basically a new client selects one of the preceding clients and starts receiving a whole video from the selected one without any delay. In some situation, two preceding clients are selected to transfer the ending part of the video and its the remaining part simultaneously. In our experiment, ForwardCast can reduce the rejection ratio compared to previous works without increasing server stress.

• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1066-1077
• /
• 2004

Dramatic increase in the number of Internet users want highly qualified service of continuous media contents on the web. To solve these problems, we present two network caching schemes(PPC, PPCwP) which consider the characteristics of continuous media objects and user access pattern in this paper. While there are plenty of reasons to create rich media contents, delivering this high bandwidth contents over the internet presents problems such as server overload, network congestion and client-perceived latency. PPC scheme periodically calculates the popularity of objects based on the playback quantity and determines the optimal size of the initial fraction of a continuous media object to be cached in proportion to the calculated popularity. PPCwP scheme calculates the expected popularity using the series information and prefetches the expected initial fraction of newly created continuous media objects. Under the PPCwP scheme, the initial client-perceived latency and the data transferred from a remote server can be reduced and limited cache storage space can be utilized efficiently. Trace-driven simulation have been performed to evaluate the presented caching schemes using the log-files of iMBC. Through these simulations, PPC and PPCwP outperforms LRU and LFU in terms of BHR and DSR.