• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.5
• /
• pp.619-627
• /
• 1999

To support multimedia services between network domains with different environments, it is required to map the functionalities in many aspects. In this paper, we implemented interworking gateway which provides protocol conversion and QoS(Quality of Service) adaptation to interwork DAVIC services based on ATM(Asynchronous TRansfer Model )network and Internet AV services. The interworking gateway converts RTSP(Real-Time Streaming Protocol ) message into DSM-CC(Digital Storage Media Command & Control) messages to control the stream that is served in ATM network, and transmits data stream by using RTP(Real-Time Transport Protocol) The interworking gateway provides QoS adaptation functionalities by QoS monitoring and MPEG filtering to meet the variation of network bandwidth.

• Journal of Internet Computing and Services
• /
• v.23 no.5
• /
• pp.59-68
• /
• 2022

As real-time live streaming broadcasting and non-face-to-face classes are spreading in the Corona era, it is time to take academic interest in online streaming classes. In particular, it is important to clarify why users use online streaming classes. Therefore, this study proposes social presence, interest, convenience of use, and interactivity as characteristics of online streaming classes, and aims to verify how these characteristics affect learning satisfaction and furthermore, recommendation intention. As a result of conducting a survey on 338 Chinese collegestudents, it was found that interactivity, social presence, and interest had a positive effect on learning satisfaction, but the effect of ease did not appear. On the other hand, it was confirmed that learning satisfaction had a positive effect on the online streaming class recommendation intention.

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

• International Journal of Internet, Broadcasting and Communication
• /
• v.10 no.3
• /
• pp.26-34
• /
• 2018

In this paper, we propose a scheduling scheme that can efficiently serve I/O requests having deadlines in flash storage. The I/O requests with deadlines, namely, real-time requests, are assumed to be issued for streaming services of continuous media. Since a Web-based streaming server commonly supports downloads of HTMLs or images, we also aim to quickly process non-real-time I/O requests, together with real-time ones. For this purpose, we adopt the well-known rate-reservation EDF (RR-EDF) algorithm for determining scheduling priorities among mixed I/O requests. In fact, for the use of an EDF-style algorithm, overhead of task's switching should be low and predictable, as with its application of CPU scheduling. In other words, the EDF algorithm is inherently unsuitable for scheduling I/O requests in HDD storage because of highly varying latency times of HDD. Unlike HDD, time for reading a block in flash storage is almost uniform with respect to its physical location. This is because flash storage has no mechanical component, differently from HDD. By capitalizing on this uniform block read time, we compute bandwidth utilization rates of real-time requests from streams. Then, the RR-EDF algorithm is applied for determining how much storage bandwidth can be assigned to non-real-time requests, while meeting deadlines of real-time requests. From this, we can improve the service times of non-real-time requests, which are issued for downloads of static files. Because the proposed scheme can expand flexibly the scheduling periods of streams, it can provide a full usage of slack times, thereby improving the overall throughput of flash storage significantly.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.11b
• /
• pp.767-770
• /
• 2002

본 논문에서는 RTSP 프로토콜을 제어하기 위한 서버 시스템을 IOCP 기반의 Multi-Thread 기법을 이용하여 구현하는 방법을 소개한다. 다수의 클라이언트에 대한 응답을 Thread로 구성하는 부분에서 Multi-Threading을 이용함으로써 수행 속도를 높이고 Winsock2에서 제공하는 IOCP(T/O Completion Port)를 이용하여 견고하고 확장이 용이한 RTSP(Real Time Streaming Protocol) 스트리밍 서버를 개발하였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2019.06a
• /
• pp.144-146
• /
• 2019

Recently, according to the rapid development of surveillance information, closed-circuit television (CCTV) has become an indispensable component in security systems. A lot of advanced technologies of encryption and compression are implementing to improve the performance and security levels of the CCTV system. Especially, 360 video CCTV streaming is promising for surveillance without blind areas. However, compared to previous systems, 360 CCTV requires large bandwidth and low latency. Therefore, it requires more efficiently effort to improve the CCTV system performance. In order to meet the demands of 360 CCTV streaming, transcoding is an essential process to enhance the current CCTV system. Moreover, encryption algorithm is also an important priority in security system. In this paper, we propose a real-time transcoding solution in combination with the ARIA and AES algorithms. Experimental results prove that the proposed method has achieved around 195% speed up transcoding compared to FFMPEG libx265 method. Furthermore, the proposed system can handle multiple transcoding sessions simultaneously at high performance for both live 360 CCTV system and existing CCTV system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2513-2530
• /
• 2021

With the fast development of information and communication technologies, video streaming services and applications are increasing rapidly. However, the network condition is volatile. In order to provide users with better quality of service, it is necessary to develop an accurate and low-complexity model for Quality of Experience (QoE) prediction of time-varying video. Memory effects refer to the psychological influence factor of historical experience, which can be taken into account to improve the accuracy of QoE evaluation. In this paper, we design subjective experiments to explore the impact of Short-Term Memory (STM) on QoE. The experimental results show that the user's real-time QoE is influenced by the duration of previous viewing experience and the expectations generated by STM. Furthermore, we propose analytical models to determine the relationship between intrinsic video quality, expectation and real-time QoE. The proposed models have better performance for real-time QoE prediction when the video is transmitted in a fluctuate network. The models are capable of providing more accurate guidance for improving the quality of video streaming services.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.287-292
• /
• 2001

Multimedia service systems should have efficient capacity to serve the growing clients and new data. In the general streaming services, users can endure the small amount of time delay at the beginning of service. But they want to have good quality of service. A streaming server tries to transfer video files to clients from a repository of files in real time. The server must guarantee concurrent and uninterrupted delivery of each video stream requested from clients. To achieve its purpose, many stream servers adopt multi-processors, sufficient memory, and RAID or SAN in their systems. In this paper, we propose a Linux-based parallel media streaming server. It is superior to the other systems in the storing structure, fault-tolerance, and service capacity. Since this system supports the web interlace, users can operate easily through the www. This system uses unique striping policy to distribute multimedia files into the parallel storage nodes. If a service request occurs, each storage node transmits striped files concurrently to the client. Its performance is better than the single media streaming service because of the parallel architecture.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.385-389
• /
• 2009

Multi-hop wireless mesh networks (WMNs) suffer from significant packet losses due to insufficient available bandwidth and high channel error probability. To conquer packet losses, end-to-end (E2E) error control schemes have been proposed. However, in WMNs, E2E error control schemes are not effective in adapting to the time-varying network condition due to large delay. Thus, in this paper, we propose a network-adaptive error control for video streaming over WMNs that flexibly operates E2E and hop-by-hop (HbH) error control according to network condition. Moreover, to provide lightweight support at intermediate nodes for HbH error control, we use path-partition-based adaptation. To verify the proposed scheme, we implement it and evaluate its transport performance through MPEG-2 video streaming over a real IEEE 802.11a-based WMN testbed.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.538-541
• /
• 2006

Recently researches of P2P media streaming have been actively published, but the research what kind of P2P overlay networks are better to delivering media data has not been attended. This paper designs a P2P streaming media system model. In this system, we constructs a Half-Structure P2P overlay protocol based on node's capability as the infrastructure of streaming application, which utilizes the heterogeneity of the nodes to maintain topology, presents a active contents diffusing algorithm and Two-stage search algorithm, make it possible for nodes in P2P system to collect information according their capacity and reduces the number of forwarding packet compared with flooding. Also, we give an optimal scheme to scheduling media data.