• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.7
• /
• pp.1638-1656
• /
• 2013

The demand for multimedia streaming services is increasing rapidly. To meet this demand, there has been much research and many practical developments for providing multimedia services. A push-to-talk (PTT) service is one of the multimedia streaming services that have been deployed not only over IP multimedia subsystem (IMS) but also in peer-to-peer (P2P) overlay networks. The benefit of PTT has been demonstrated in the literature. However, the need for using PTT service in communication can be arbitrary among users, regardless what kind of PTT services they use. This demand does not support current PTT systems, so an expansion of PTT services still be limited. Moreover, the combination of PTT services in IMS and P2P networks will help operators to provide more scalable PTT services. Therefore, in this paper, we proposed a model to support PTT service interworking between IMS and P2P overlay networks. We also introduced our system design and some interworking service scenarios. We confirmed our architecture through implementation and testing.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.765-768
• /
• 2007

P2P Video-on-Demand (VoD) is becoming a popular service in the Internet. The first deployments are already in place, and millions of customers worldwide are already using this new medium. But its success is still quite limited and technically, these researches have been deployed in a rush, mostly based on practicality and instability. This paper studies the advantages and potential problems of VoD in peer-to-peer (P2P) network, we propose a system which uses a distributed VoD streaming scheme over P2P network to support media streaming.

• Journal of Korea Multimedia Society
• /
• v.10 no.10
• /
• pp.1328-1337
• /
• 2007

We describe a method for streaming specific section using the section information among peers on P2P network. As peers tend to extract only the part of contents in which they are interested, an indexed file is created based on the section information of multimedia contents and registered in the search server. If a peer requests the streaming of specific parts of the contents to other corresponding peer using the section information that the server returns, the peer streams only separated section of the multimedia contents according to the information. For this process, we implement a function that a peer's PC can play a role as a server, and the peer streams the separated content based on the section information that the server supplies.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1732-1750
• /
• 2016

Recently, Peer-to-Peer (P2P) live streaming assisted by the cloud computing has attracted considerable attention to improve the reliability of the P2P such as the resilience to peer churn and the shortage of upload capacity. The cost of cloud-assistance is comprised of the number of requests issued to the cloud and the amount of data fetched from the cloud. In this paper, we propose three techniques to reduce the cost of such a cloud-assistance.More concretely, in the proposed method, 1) each peer which lost its parent in the overlay can find a new parent by referring to the information registered in the cloud, 2) several peers which proactively fetch chunks from the cloud are dynamically invested, and 3) the number of requests issued to the cloud is reduced by allowing peers to fetch a collection of chunks using a single request. The performance of the proposed method is evaluated by simulation. The simulation results indicate that it reduces the cost of conventional scheme by 46% while guaranteeing the quality of live streaming service.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.33-42
• /
• 2013

In the early stage of P2P, the technology was limited to narrow usage of file sharing, but currently, P2P technology has become essential to maximize the efficiency between associated technologies without additional deployment of high costly infrastructure and also the burden of the server. Especially, P2P media streaming service is a highly attractive service to mobile users. which requires a higher quality in the mobile environment in accordance with the development of technology of wired network as well as better mobile terminals. However, P2P technology should consider the trade-off between 'peer selfishness' and QoE for providing fairness. The P2P system also try to maximize the resource utilization through an incentive mechanism for service differentiation and encourage peers to contribute continuously for improving the overall system performance. In this paper, we propose an point-based incentive mechanism based on peer's contribution level and energy availability for service differentiation. We also introduce that the proposed mechanism efficiently enhances the system performance as the peer with incentive using contribution and energy obtains more effective resource distribution.

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

• The KIPS Transactions:PartA
• /
• v.13A no.2 s.99
• /
• pp.147-156
• /
• 2006

Recently, streaming service accounts for large part of internet traffic and it is becoming the most popular service. Because of P2P's scalability, P2P-based streaming system is proposed. There are frequent leave and join of a node. To overcome the group dynamics, Multiple Multicast Trees Methods were suggested. However, since they did not consider discrepancy in peers' capacity, it may cause the trees to be long and unstable. So we suggest Resilient Capacity-Aware Multicast Tree construction scheme (R-CAT) that promotes superior peer to upper position in the tree and construct more stable and short multicast trees. By simulation we can show that R-CAT cost more overhead packets for tree joining process, but it reduce the end-to-end delay of the resulting tree and the number of packets lost during the node joining and leaving processes much more than SplitStream.

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

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.655-658
• /
• 2007

It is difficult to provide a video on demand (VoD) service to a large number of users via the Internet. This is due to the characteristics of VoD, which require a large bandwidth for a long playing time. The Peer-to-Peer (P2P) concept is proposed to increase the scalability of the VoD service. Many studies have been undertaken to solve this problem. But its success is still quite limited technically, these research have been deployed in a rush, mostly based on practicality and instability. A system which uses a distributed VoD streaming scheme over P2P network is proposed to support media streaming.