• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.12
• /
• pp.1141-1153
• /
• 2010

This paper introduces ONLIS(Overlay Multicast Network for Live IPTV Service), a novel overlay multicast network optimized to deliver live broadcast IPTV stream. We analyzed IPTV reference model of ITU-T IPTV standardization group in terms of network and stream delivery from the source networks to the customer networks. Based on the analysis, we divide IPTV reference model into 3 networks; source network, core network and access network, ION(Infrastructure-based Overlay Multicast Network) is employed for the source and core networks and PON(P2P-based Overlay Multicast Network) is applied to the access networks. ION provides an efficient, reliable and stable stream distribution with very negligible delay while PON provides bandwidth efficient and cost effective streaming with a little tolerable delay. The most important challenge in live P2P streaming is to reduce end-to-end delay without sacrificing stream quality. Actually, there is always a trade-off between delay & stream quality in conventional live P2P streaming system. To solve this problem, we propose two approaches. Firstly, we propose DSPT(Distributed Streaming P2P Tree) which takes advantage of combinational overlay multicasting. In DSPT, a peer doesn't fully rely on SP(Supplying Peer) to get the live stream, but it cooperates with its local ANR(Access Network Relay) to reduce delay and improve stream quality. When RP detects bandwidth drop in SP, it immediately switches the connection from SP to ANR and continues to receive stream without any packet loss. DSPT uses distributed P2P streaming technique to let the peer share the stream to the extent of its available bandwidth. This means, if RP can't receive the whole stream from SP due to lack of SP's uploading bandwidth, then it receives only partial stream from SP and the rest from the ANR. The proposed distributed P2P streaming improves P2P networking efficiency.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.95-103
• /
• 2012

In this paper, we propose an efficient mobile P2P streaming architecture to minimize playback jitters in P2P overlay networks based on wired/wireless networks even though mobile peers experience the handover. In this architecture, mobile peers receive data in a push manner to maximize the data receiving speed before and after the handover. In addition, they can maintain the buffering above a specific level through handover prediction and re-selection of neighbor peers. By simulation experiments, we show that our proposed architecture can improve the performance significantly when the handover occurs compared to the existing mesh structure.

• The KIPS Transactions:PartC
• /
• v.18C no.1
• /
• pp.51-60
• /
• 2011

In this paper, we propose a P4P based P2P system for live multimedia streaming services. In order to satisfy the strict requirement of delay in live multimedia streaming, in the proposed scheme, the P4P server of network provider provides the network status information related to delay and congestion links to P2P system in addition to the information to optimize the network resource utilization. The P2P system server, then, makes the peering suggestion based on the information from the network server. Also, we propose a playback synchronization mechanism that enable each peer to start the playback within the limited variation from the playback positions of source peer. Through the simulation results, it is shown that the proposed scheme not only deals with the original objective of the P4P framework, i.e., effective network utilization, but also the live multimedia streaming requirements. It enhances the playback continuity, and reduces the playback start-up latency and the control overhead. In addition, the proposed scheme reduces the variation in playback positions of the peers.

• Journal of IKEEE
• /
• v.22 no.3
• /
• pp.570-577
• /
• 2018

With the increasing number of network nodes, traditional client/server node selection mechanisms are under tremendous pressure. In order to select efficient cooperative nodes in a highly dynamic P2P network topology, this article uses greedy algorithm to translate the overall optimization into multiple local optimal problems, and to quickly select service nodes. Therefore, the service node with the largest comprehensive capacity is selected to reduce the transmission delay and improve the throughput of the service node. The final simulation results show that the node selection strategy based on greedy algorithm can effectively improve the overall performance of P2P streaming media system.

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

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.3
• /
• pp.81-86
• /
• 2014

According to the development of streaming services with P2P and mobile network technologies, researches to enhance the service quality in mobile environment have been proposed. However, streaming services considering high-speed mobile environment and characteristics of heterogenous terminals have been hindered from being provided with the required quality from user because of bandwidth congestion between selfish peers of existing P2P system. It is also prone to long delay and loss in accordance with the repeated traffic amounts because there are no optimized solution for traffic localization. The structure to enhance peer contribution for service differentiation and peer selection with clustering scheme with location information of terminal can satisfy both users and service providers with service quality and efficiency. In this paper, we propose an incentive mechanism and resource distribution scheme with user contribution and traffic cost information based on user location, which make mobile users increase the satisfaction of service quality in LTE environments.

• The KIPS Transactions:PartB
• /
• v.17B no.3
• /
• pp.189-196
• /
• 2010

Peer-to-Peer (P2P) has attracted attention as an alternative way to enable streaming videos on the Internet. Although P2P systems depend on bandwidth contribution from peers, peers are likely to refuse to contribute their bandwidth. In this paper, we proposed a P2P streaming system that encourages peers to contribute their upstream bandwidth by maintaining fairness among peers and providing different video quality between cooperative peers and selfish peers with a manageable way. Our proposed system determines if peers are cooperative or selfish by a rating mechanism based on their contributed upstream bandwidth, and offers a high quality video to cooperative peers as an incentive. Also we propose a tree reconstruction algorithm to make the system work effectively. Through simulation, we show that the tree reconstruction algorithm works effectively, and our incentive mechanism allocates more downstream bandwidth to cooperative peers and punished selfish peers with low quality video.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.4
• /
• pp.65-77
• /
• 2013

Recently the ratio of the Internet traffic generated by video streaming applications including video-on-demand (VOD) is getting higher and higher, while P2P-based naive content distribution has been the main source of the Internet traffic in the past. As a result, the paradigm of cooperatively distributed systems (e.g., P2P) is changing to support streaming applications. Most P2P assisted approaches for video streaming today are based on Bit Torrent thanks to its simplicity of implementation and easy adaptability. They, however, have immanent vulnerability to free-riding inherited from Bit Torrent, which inevitably hurts their performance under limited system resources with free-riding. This paper studies the weakness to free-riding of existing Bit Torrent-based video streaming applications and investigates the adaptability of T-Chain (which was originally designed to prevent free-riding in cooperatively distributed systems) to video streaming applications. Our experiment results show that the video streaming approach based on T-Chain outperforms most existing Bit Torrent-based ones by 60% on average under limited system resources with free-riding.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.3 no.4
• /
• pp.240-246
• /
• 2008

This paper propose a method to enhance the performance of digital contents streaming services with the improve DRM system by maximizing the distribute computing performance and minimizing the overheads of security threatens caused by increasing users and sharing contents in P2P environments. By improving authentication protocols and license protocols to perform decryption and execution simultaneously by only download of the license, streaming services are more enhanced rather than existing DRM systems. For evaluate the performance, this paper compared execution time of existing DRM systems which decrypt the encrypted data file before execute with improved DRM system which execute and decrypt the encrypted data file simultaneously. In experiment, improved DRM system can maintain steady bandwidth and reduce the execution time in compare to existing DRM systems.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2011.01a
• /
• pp.307-310
• /
• 2011

IPTV의 스트리밍 서비스를 위해 P2P를 이용하는 방법이 활발하게 연구되어지고 있다. 이 논문에서는 topology를 최적화하는 방안으로 P2P에서 각 peer 간에 연결 및 전송 정보를 이용하는 방법을 제안한다. 제안하는 방법은 mesh-network에서 각 peer에 연결된 link의 수를 이용하여 업로드 대역폭을 추정하는 알고리즘을 기반으로 한다. 이 방법은 자원의 관리를 위해 업로드 대역폭을 판단하기 위한 메시지 과부하를 효과적으로 줄여주지만 스트리밍에서 주어진 연산만을 수행할 경우 업로드 대역폭과 무관한 형태로 network topology가 잘못 구성될 가능성을 가지고 있다. 본 논문에서는 기존 연구에서 부족했던 부분들을 정리하고 극복할 수 있는 각각의 알고리즘들과 적용했을 시에 예상되는 결과를 제시한다.