• Journal of Broadcast Engineering
• /
• v.25 no.1
• /
• pp.94-104
• /
• 2020

Currently media consumption over fixed/mobile Internet is mostly conducted by adaptive media streaming technology such as DASH (Dynamic Adaptive Streaming over HTTP), which is an ISO/IEC MPEG (Moving Picture Experts Group) standard, or some other technologies similar to DASH. All these heavily depend on the HTTP caches that ISPs (Internet Service Providers) are obliged to provide sufficiently to make sure fast enough Web services. As a result, as the number of media streaming users increases, ISPs' burden for HTTP cache has been greatly increased rather than CDN (Content Delivery Network) providers' server burden. Hence ISPs charge traffic cost to CDN providers to compensate for the increased cost of HTTP caches. Recently in order to reduce the traffic cost of CDN providers, P2P (Peer-to-Peer)-assisted DASH system was proposed and a peer selection algorithm that maximally reduces CDN provides' traffic cost was investigated for this system. This algorithm, however, tends to concentrate the burden upon the selected peer. This paper proposes a new peer selection algorithm that distributes the burden among multiple peers while maintaining the proper reduction level of the CDN providers' cost. Through implementation of the new algorithm in a Web-based media streaming system using WebRTC (Web Real-Time Communication) standard APIs, it demonstrates its effectiveness with experimental results.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.4
• /
• pp.82-88
• /
• 2009

Video proxy server which is located near clients can store the frequently requested video data in storage space in order to minimize initial latency and network traffic significantly. However, due to the limited storage space in video proxy server, an appropriate video selection method is needed to store the videos which are frequently requested by users. Thus, we present a virtual caching technique to efficiently store the video in video proxy server. For this purpose, we employ a virtual memory in video poky server. If the video is requested by user, it is loaded in virtual memory first and then, delivered to the user. A video which is loaded in virtual memory is deleted or moved into the storage space of video poxy sewer depending on the request condition. In addition, virtual memory is divided into each segment area in order to store the segments efficiently and to avoid the fragmentation. The simulation results show that the proposed method performs better than other methods in terms of the block hit rate and the number of block deletion.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3B
• /
• pp.517-525
• /
• 2010

The IPTV Service provides various interactive services beyond the level of being able to substitute cable TV. The IPTV system is to be decentralized gradually in which one server conducts all tasks. Primarily, deliberation of media needs to be changed into a system in which relayer and peer from the central server is utilized. Secondarily, the way of controling IPTV network need to be decentralized. Unlike the current client-server system, P2P(Peer To Peer), the main technology of decentralized IPTV is able to provide a service by cooperation of each node. Dealing with live streaming IPTV system which is based on the P2P protocol, this paper design the pure P2P IPTV structure and does verify the performance of P2P IPTV structure by realizing real system.

• 대한공업교육학회지
• /
• v.32 no.2
• /
• pp.199-216
• /
• 2007

Stream Control Transmission Protocol(SCTP) is a transport layer protocol to support the data transmission. SCTP is similar to Transmission Control Protocol(TCP) in a variety of aspects. However, several features of SCTP including multi-homing and multi-streaming incur the performance difference from TCP. This paper highlights the data transfer during the initial slow start phase in SCTP congestion control composed of slow start phase and congestion avoidance phase. In order to compare the mean transfer time between SCTP and TCP, we experiment with different performance parameters including bandwidth, round trip time, and data length. By varying data length, we also measure the corresponding initial window size, which is one of factors affecting the mean transfer time. For the experiment, we have written server and client applications by C language using SCTP socket API and have measured the transfer time by ethereal program. We transferred data between client and server using round-robin method. Analysis of these experimental results from the testbed implementation shows that larger initial window size of SCTP than that of TCP brings the reduction in the mean transfer time of SCTP compared with TCP by 15 % on average during the initial slow start phase.

• Journal of Internet Computing and Services
• /
• v.8 no.2
• /
• pp.77-87
• /
• 2007

A typical VOD service allows that a number of remote clients playback a desired video from a large collection of videos stored in one or more video servers. The main bottleneck for a VOD service is the network bandwidth connecting to the VOD server to the client due to the high bandwidth requirements. Many previous researches have shown that VOD server can be greatly improved through the use of multicast, broadcast, or P2P scheme. Broadcast is one of the most efficient techniques because it can transmit a stream to many users without additional network bandwidth. But the broadcast has long latency time. In order to overcome the drawback, in this paper, we propose P2Prefix broadcast scheme that can solve the service latency time, which is the problem of broadcast scheme, by using P2P caching as well as minimizing the client buffer requirement.

• Journal of Korea Game Society
• /
• v.12 no.4
• /
• pp.13-22
• /
• 2012

The wide-spread use of the broadband Internet service makes the cloud computing-based gaming service possible. A game program is executed on a cloud node and its live image is fed into a remote user's display device via video streaming. The user's input is immediately transmitted and applied to the game. The minimization of the time to process remote user's input and transmit the live image back to the user and thus satisfying the requirement of instant responsiveness for gaming makes it possible. However, the cost to build its servers can be very expensive to provide high quality 3D games because a general purpose graphics system that cloud nodes are likely to have for the service supports a single 3D application at a time. Thus, the server must have a technology of 'realtime multiple rendering' to execute multiple 3D games simultaneously. This paper proposes a new architecture of 2-tier servers of clouds nodes of which one group executes multiple games and the other produces game's live images. It also performs a few experimentations to prove the feasibility of the new architecture.

• Journal of Broadcast Engineering
• /
• v.20 no.4
• /
• pp.619-631
• /
• 2015

In this paper, we propose a new online content editing system to edit the broadcasting and personal contents. The proposed editing system consists of the content management server and the content editor, in which the content management server is used for storing the contents, while the content editor is used for editing the contents via the user interface. Unlike the existing content editing methods which edit the downloaded contents, the proposed editing system edits the contents stored in the content management server while the content editor plays them by using the streaming technology. However, it is not effective to edit the whole segments of contents while playing them by using the streaming technology. To resolve the problem, the proposed editing system performs the scene detection of the contents, and the detected scene information is used for playing and editing of contents. After completing the content editing, the edited information is uploaded to the content management server as a metadata format. In the proposed editing system, both scene and edited information are represented only as the metadata format, and the physical content segmentation according to the scene and edited information is not performed. The implementation results show that the proposed editing system provides similar performances with the existing content editing methods which use the content download and editing methods.

• Journal of Internet Computing and Services
• /
• v.6 no.6
• /
• pp.127-137
• /
• 2005

This paper presents implementation of client-based VOD service using multicast delivery, Conventional system provide server-based system in multicast delivery but implemented system provides on-demand client-based multicast system. The Multicast Agent Scheduler aggregates clients' request and it generate multicast group addresses and port numbers according to requested video items and service request time. Then it transmits immediately multicast address to VOD server and client who request service. And then VOD server transmits requested streams with a multicast group address and the client joins the group automatically. The Multicast Agent Scheduler assigns the same multicast group address when other clients request an identical video within the same scheduling duration. The proposed system can reduce load of server and support many clients at the same time and applies it to WMT(window media technology) of Microsoft.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4B
• /
• pp.659-669
• /
• 2010

The P2P IPTV will create a new paradigm for the Internet services. However, it cannot guarantee the reliability of their server and QoS because of using common Internet users(peers) for SIP server or relay server, though the infrastructural cost is low. This paper proposes the ISP-based P2P IPTV architecture which can solute the limitations of conventional P2P-based IPTV. In this model, ISP can build P2P overlay network with ISP servers and directly manage each server needed for session connection. So, the servers have higher performance and better reliability than previous one. Besides, robustness is improved because each sever is set by P2P overlay network. To evaluate the characteristics of the ISP-based P2P IPTV architecture, we simulate it for some parameters which are end-to-end streaming delay time, connection delay time and traffic amount. We compared the proposed architecture with the conventional P2P architecture about video service and confirmed that the performance of ISP-based P2P IPTV is better than conventional P2P based IPTV.

• Journal of Korea Multimedia Society
• /
• v.8 no.5
• /
• pp.707-741
• /
• 2005

In the multimedia streaming technology, the unicast method require additional cost by an increase traffic according to increase a number of users. The multicast method can solve this problem, but it don't have connection and control information of clients. Now, the most routers support only unicast. Also it has a problem with an exchange of service in other ISP. This paper proposes traffic agent system which is applied unicast and P2P(Peer to Peer) for distance video teaming to overcome this problem. The proposed system decrease the traffic of stream server by control agent, and cut down expenses of network. This system is tested under the distance video leaning using JMF and application software.