• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.1
• /
• pp.40-47
• /
• 2015

We propose a method to provide a selective VoD service during live streaming sessions. In the proposed method, each peer joined the live streaming session receives video stream packets with P2P manner and stores the packets to provide a VoD service. To mitigate the overhead of each peer node to store the video stream packets, the proposed scheme categorizes peers into three different groups based on their link types. To increase data gathering speed and reduce the network load, we also proposes the P2P transmission scheme within the same AP network for the peers with Wi-Fi link. To evaluate the performance of the proposed method, we implement computer simulator using NS-3. Simulation results show that the proposed method reduces the overhead about 66% and increases the P2P data gathering speed about 50% compared to the conventional schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.1035-1056
• /
• 2015

The efficiency of live Peer-to-Peer (P2P) streaming protocols depends on the appropriateness and the management abilities of their underlying overlay multicast. While a tree overlay structure confines transmission delays efficiently by maintaining deterministic delivery paths, an overlay mesh structure provides adequate resiliency to peers dynamics and easy maintenance. On the other hand, content freshness, playback fluidity and streaming continuity are still challenging issues that require viable solutions. In this paper, we propose a Hybrid Live P2P Streaming Protocol (HLPSP) based on a hybrid overlay multicast that integrates the efficiency of both the tree and mesh structures. Extensive simulations using OMNET++ are conducted to investigate the efficiency of HLPSP in terms of relevant performance metrics, and position HLPSP with respect to DenaCast the enhanced version of the well-known CoolStreaming protocol. Simulation results show that HLPSP outperforms DenaCast in terms of startup delay, end-to-end delay, play-back delay and data loss.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.2 s.40
• /
• pp.253-261
• /
• 2006

In spite of the popularity of P2P technology, a multimedia streaming using the P2P technology has been neglected. The reason for this is that the P2P multimedia streaming has suffered from several inherent problems especially poor bandwidth and unreliable connection among peers. We suggest a Multi-Peer Binding Protocol (MPBP) in this paper that provides a virtual single channel composed of multiple connections to several peers to ease these problems. The protocol enables applications to download data from multiple peers simultaneously, so they can achieve throughput improvement and reliable streaming. For this, the MPBP splits media files into small chunks and provides a mechanism for identifying and transmitting each chunk. Implemented MPBP engine focuses on handling an abrupt disconnection from data sending peers and the evaluation result shows the MPBP is able to handle it gracefully. The MPBP is also desisted to support various media types. To verify this, video and audio applications are implemented using the MPBP engine in this paper.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1571-1579
• /
• 2009

This paper proposes a P2P(Peer-to-Peer) streaming protocol which allows various QoS(Qualify of Service) requirements of video streaming to be supported for various personal IPTV applications in ubiquitous Internet environments. The proposed P2P streaming protocol takes fairly short startup delay, guarantees end-to-end delay bound and bandwidth requirements, and supports reliability level of video streaming for an IPTV application. The QoS-based P2P streaming protocol can properly use not only the advantages of scalability, availability, and ubiquity of P2P streaming but also complement its disadvantages of performance and reliability so that various types of personal IPTV applications can be properly implemented in the existing broadband Internet environments.

• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.286-295
• /
• 2012

To meet the increased demand of video-on-demand (VoD) services, peer-to-peer (P2P) mesh-based multiple video approaches have been recently proposed, where each peer is able to find a video segment interested without resort to the video server. However, they have not considered the constraint of the server's upload bandwidth and the fairness between upload and download amounts at each peer. In this paper, we propose a novel P2P VoD streaming system, named peer cache adaptation (PECAN) where each peer adjusts its cache capacity adaptively to meet the server's upload bandwidth constraint and achieve the fairness. For doing so, we first propose a new cache replacement algorithm that designs the number of caches for a segment to be proportional to its popularity. Second, we mathematically prove that if the cache capacity of a peer is proportional to its segment request rate, the fairness between upload and download amounts at each peer can be achieved. Third, we propose a method that determines each peer's cache capacity adaptively according to the constraint of the server's upload bandwidth. Against the proposed design objective, some selfish peers may not follow our protocol to increase their payoff. To detect such peers, we design a simple distributed reputation and monitoring system. Through simulations, we show that PECAN meets the server upload bandwidth constraint, and achieves the fairness well at each peer. We finally verify that the control overhead in PECAN caused by the search, reputation, and monitoring systems is very small, which is an important factor for real deployment.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.277-285
• /
• 2011

Real-time multimedia streaming over the Internet is rapidly increasing with the popularity of user-created contents, Web 2.0 trends, and P2P (peer-to-peer) delivery support. While many homes today are broadband-enabled, the quality of experience (QoE) of a user is still limited due to frequent interruption of media playout. The vulnerability of TCP (transmission control protocol), the popular transport-layer protocol for streaming in practice, to the packet losses, retransmissions, and timeouts makes it hard to deliver a timely and persistent flow of packets for online multimedia contents. This paper presents TCP-real-time online multimedia environment (ROME), a novel transport-layer framework that allows the establishment and coordination of multiple many-to-one TCP connections. Between one client with multiple home addresses and multiple co-located or distributed servers, TCP-ROME increases the total throughput by aggregating the resources of multiple TCP connections. It also overcomes the bandwidth fluctuations of network bottlenecks by dynamically coordinating the streams of contents from multiple servers and by adapting the streaming rate of all connections to match the bandwidth requirement of the target video.

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

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.310-313
• /
• 2013

BitTorrent는 파일 공유를 위하여 가장 널리 사용되고 있는 P2P (Peer to Peer)프로토콜로서, Mesh-Pull 구조를 채용하여 라이브 스트리밍에 대한 연구가 꾸준히 이루어지고 있다. BitTorrent에서는 Peer Wire Protocol을 사용하여 피어들간에 파일조각들을 교환하게 되는데, 이를 위하여 주기적으로 버퍼맵 정보를 HAVE 메시지를 사용하여 브로드캐스트 하는데, 피어의 수가 증가할수록 이로 인한 시그널링 오버헤드가 크게 증가하는 문제를 갖고 있다. 본 논문에서는 이러한 문제를 극복하고 라이브 스트리밍의 성능을 개선하기 위하여 HAVE 메시지를 선택적으로 전송하는 방법을 제안한다. 실험을 통하여, 제안 방식은 기존의 BitTorrent 기반 Mesh-Pull 구조를 채용하는 라이브 스트리밍 방식과 비교하여 HAVE 메시지의 브로드캐스트로 인한 시그널링 오버헤드를 비약적으로 줄일 수 있음을 보였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.208-211
• /
• 2011

향후 인터넷 기반 애플리케이션에는 확장성, 보안 및 신뢰성, 새로운 서비스에 대한 유연성 및 QoS 등의 요구사항이 중요하다. 기존 클라이언트-서버 방식에서 이러한 요구 사항의 만족을 위해서는 복잡성 및 고비용 문제가 제기된다. 반면, 모든 형태의 분산 자원 접근이 가능한 P2P 통신 방식에서는 보다 간단한 해결방안을 제시함으로써 인터넷 기반 애플리케이션에 새로운 가능성을 제시하고 있다. 인터넷의 전통적인 클라이언트-서버 패러다임과는 달리 완전 분산 및 자율 조직 특성을 가진 P2P 개념은 확장성 및 신뢰성 측면에서 장래의 애플리케이션, 시스템 요소, 인프라 서비스를 위한 기본 설계지침으로 제시되고 있다. 본 논문에서는 P2P 실시간 스트리밍 프로토콜의 새로운 모델인 PREP 프로토콜을 설계 및 구현한다. 제안된 P2P 실시간 스트리밍 프로토콜을 NS-2를 통해서 설계하고 시뮬레이션을 통해 P2P 기반의 스트리밍 서비스의 가능성을 확인한다.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.268-281
• /
• 2008

It is difficult to construct streaming services based on the overlay networks without any loss of scalability. DONet is one of the most representative streaming overlay network protocols without managing any specific structure. Since DONet does not support the nodes on private networks, it can be considered that the performance of the overlay is not the best. Hole Punching is one of the famous techniques participating the nodes on private networks to streaming overlay networks by using a rendezvous server. However, using only a single rendezvous server cannot be suggested in P2P environment, because it can cause problems in terms of scalability and so on. In this paper, we propose DONet-p, an extension of DONet with Distributed Hole Punching techniques. It supports the nodes on private networks without toss of scalability. The experimental results show the better performance and scalability than DONet with a minimum overhead for additional control messages.