• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.9
• /
• pp.2268-2283
• /
• 2013

Scalable video coding can handle peer heterogeneity of P2P streaming applications, but there is still a lack of comprehensive studies on how to use it to improve video playback quality. In this paper we propose a capacity aware scalable video coding mechanism for P2P on demand streaming system. The proposed mechanism includes capacity based neighbor selection, adaptive data scheduling and streaming layer adjustment, and can enable each peer to select appropriate streaming layers and acquire streaming chunks with proper sequence, along with choosing specific peers to provide them. Simulation results show that the presented mechanism can decrease the system's startup and playback delay, and increase the video playback quality as well as playback continuity, and thus it provides a better quality of experience for users.

• The KIPS Transactions:PartD
• /
• v.14D no.5
• /
• pp.555-564
• /
• 2007

Internet streaming systems consist of a media server, a streaming sewer, and terminals. The media server delivers multimedia contents such as video and/or audio to the streaming server, which distributes the contents to terminals as well. Existing Internet streaming systems have a bottleneck problem in the streaming server because of the limit of the processing capacity of the streaming server and therefore a streaming server can not accomodate more terminals than the limit. As a solution to this problem, P2P streaming systems have been lately proposed and investigated, using P2P distributed architectures. Actually, however, there exist many difficulties in the design and implementation of P2P streaming systems, because it needs many real computers and various network constructions. In this paper, we have proposed and defined a P2P streaming system model such as the architectural model, the timing model, the behavior model, and the performance metrics. And also we have implemented an NS2 based P2P streaming system simulator called P2PStreamSim. Finally, we have verified it through test simulations and analyzed the results.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.116-119
• /
• 2009

In this paper, a P2P streaming system for community TV service which requires realtime interactions was designed and implemented. The proposed system constructs a short delay tree-based P2P network in order to effectively support various community TV services within end-to-end delay bounds. Because a community service based on conversation requires a short delay. The P2P network of this paper was constructed by using an algorithm which utilizes locality and delay information. The implemented P2P streaming system is composed of a Web server and a application, each of which was implemented using Asp.Net and C#.Net respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12B
• /
• pp.758-766
• /
• 2007

IStreaming services with a client-server architecture have scalability problem because a server cannot accomodate clients more than its processing capability. This paper introduces a case study for implementing H.264 streaming system based on P2P architecture in order to provide scalable and stable broadcast streaming services over the internet. The prototype system called OmniCast264 consists of the H.264 encoding server, the streaming server, the proxy server, and peer nodes. The proxy server dynamically manages placement of the peer nodes on the P2P network. Omnicast264 has the concepts of distributed streaming loads, real-time playback, error-robustness and modularity. Thus, it can provide large-scale broadcast streaming services. Finally, we have built P2P streaming systems with 12 PCs connected serially or in parallel. The experiment shows that OmniCast264 can provide real-time playback.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11C
• /
• pp.955-962
• /
• 2008

Multicast Strategy is one of the cost-saving methods in the large scale VOD environment. However, it does involve complicated problems to implement VCR-like interactions for user's convenience in the multicast streaming system under considering the limited-server and the network's bandwidth in the multicast-transmission system. Therefore, the proper solution of settling such a problem is necessary. Thus, this paper which revised P2Patching[l] proposes LGST(Level Group Streaming Technique) which supports the VCR's function through cooperation among peers with heterogeneous bandwidth under the environment of P2P. This strategy can reduce latency by improving the acceptance of server and using the bandwidth of network efficiently. And for evaluate the proposed scheme's performance, I simulated the performance of streaming delivery topology and streaming quality in comparison with P2Patching. In evaluation to service request refusal ratio and service quality according to bandwidth decrement, the result of simulation shows that proposed LGST improves about $11{\sim}18%$ of performance than P2Patching. In the test of latency recovery according to fault probability and influence of VCR function operation duration, it shows similar performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.3
• /
• pp.567-574
• /
• 2013

Recently, many researches on P2P overlay network-based multimedia streaming services have been actively performed because of their high scalability and cost-efficiency advantages. However, P2P overlay networks also have the shortcoming of generating higher traffic owing to their unicast-based one-to-many multimedia deliveries. In order to reduce the traffic generated by the P2P streaming overlay network, we propose an ISP and locality-based parent node discovery method and check its feasibility through an implementation of a prototype streaming system. The measurement of RTTs and hop counts for random nodes having different ISPs and localities shows the proposed method to be able to shorten about 32% RTTs and about 17% Hop counts.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.325-332
• /
• 2004

For a P2P network, the contents distribution is a very important service because the contents provider is not fixed. And in the P2P media streaming, a request peer replays and saves media data simultaneously, and after streaming it acts as a new source peer providing media files to other peers. Therefore streaming and file saying operations should be simultaneously carried out in order to distribute contents through the P2P network. In this paper, a P2P multi-source media streaming system which can replay the contents data during downloading is proposed and implemented. The system reduces the user response time and the number of simultaneous user increases more than two times. Moreover, transmitting a part of media file makes fast distribution and diffusion of contents possible.

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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.11
• /
• pp.2166-2171
• /
• 2007

In this paper, we proposed a Sequential Download System(SDS) to provide high steaming QoS in p2p network. SDS is able to receive a media file simultaneously from multiple source peer by download manager and deal with unexpected leave of source peer. Also It can provide stable streaming services with minimum buffering delay and manage request of other peer by memory map in process of downloading.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.11
• /
• pp.2143-2159
• /
• 2011

The hybrid architecture of content delivery networks (CDN) and peer-to-peer overlay networks (P2P) is a promising technology enables effective real-time streaming services. It complements the advantages of quality control and reliability in a CDN, and the scalability of a P2P system. With real-time streaming services, however, high connection setup and media delivery latency are becoming the critical issues in deploying the CDN-P2P system. These issues result from biased peer selection without location awareness or content awareness, and can lead to significant service disruption. To reduce service disruption latency, we propose a group-based CDN-P2P hybrid architecture (iCDN-P2P) with a location/content-aware selection of peers. Specifically, a SuperPeer network makes a location-aware peer selection by employing a content addressable network (CAN) to distribute channel information. It also manages peers with content awareness, forming a group of peers with the same channel as the sub-overlay. Through a performance evaluation, we show that the proposed architecture outperforms the original CDN-P2P hybrid architecture in terms of connection setup delay and media delivery time.