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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.12
• /
• pp.2179-2187
• /
• 2008

The P2P technology has been widely used to distribute files efficiently, and its use in streaming is rapidly increasing. P2P streaming has issues about startup-delay, scalability, and real-time playback, however, what affects these factors has not been researched sufficiently. This paper suggests a buffering model for progressive download within mesh-based P2P system, which corresponds to downloading and playing the content at the same time. It is used to analyze PDF(Playback Deadline First), Rarest algorithms which are block-selection strategies of P2P streaming and proposes a mixed selection of them. The mixed block selection strategy dynamically performs different strategies based on whether the blocks to be played are received or not. In consequence, it enhances the QoS of streaming in a single peer point of view, as well as improving block distributions in an overlay network.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.411-414
• /
• 2006

최근 몇 년 사이 인터넷의 발전으로 인해 대용량의 멀티미디어 서비스가 가능해졌다. 특히 요즘에는 컨텐츠 공급자들의 저작권을 고려함으로 인해 스트리밍 서비스를 선호하는 추세이다. 이러한 추세는 사용자가 스트리밍 컨텐츠에 존재하는 정보를 보다 편하게 추출할 수 있는 방법에 대한 요구를 증대시키고 있다. 이에 따라 본 논문에서는 각각의 스트리밍 컨텐츠에 존재하는 정보들 중에서 사용자가 원하는 정보가 있는 구간들을 인덱싱 할 수 있는 도구를 제공하고 인덱싱 된 정보 구간을 스트리밍 할 수 있는 시스템을 구현하였다. 본 논문에서는 특히 P2P 환경에서 사용자간에 정보 공유를 목적으로 하는 시스템의 구현에 초점을 맞추었다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.489-492
• /
• 2007

본 논문에서는 P2P 네트워크 상에 분산되어 있는 파일들을 수집하고 피어의 신뢰도가 낮은 접속에도 끊김 없는 스트리밍 서비스를 제공하기위해 Sequential Download System(SDS)을 제안하였다. SDS는 Download Manager를 이용하여 여러 피어로부터 파일을 수신하고, 파일 수신 시에 피어의 갑작스런 이탈에 대처하며 스트리밍 시 발생하는 버퍼링 시간을 최소화하여 안정된 스트리밍을 제공하게 된다. 또한 Memory map을 이용하여 다른 피어의 요청에도 대처할 수 있다.

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

• The KIPS Transactions:PartA
• /
• v.11A no.7 s.91
• /
• pp.511-520
• /
• 2004

A peer-to-peer model is very useful in solving the server link bottleneck problem of a client-server model. In this work, we discuss the problems of distributing multimedia content over peer-to-peer network. We focus on two problems in peer-to-peer media content distribution systems. The first is the transmission scheduling of the media data for a multi-source streaming session. We present a sophisticated scheduling scheme called fixed-length slotted scheduling, which results in minimum buffering delay. The second problem is on the fast distribution of media content in the peer-to-peer system that is self-growing. We propose a mechanism accelerating the speed at which the system's streaming ca-pacity increases, called FAST.

• Journal of Advanced Navigation Technology
• /
• v.15 no.3
• /
• pp.364-371
• /
• 2011

In P2P distribution mobile networks, QoS of streaming media services are under heavy influence from overheads such as congestion, latency, and interference. The problem is further complicated by the fact that the popularity of media objects changes over time. This paper proposes a new FSMS+ (Fuzzy Similarity-based Multi-level Streaming Scheme) which minimizes performance degradation of streaming services due to overhead. We then utilize fuzzy similarity-based relevance that can dynamically stream the streaming media object with minimum overhead. The simulation result showed that the proposed scheme has better performance in retransmission rate, congestion control rate and latency rate than the other existing methods of distance method, DC (disk caching) method, and prefix method.

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

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

• The KIPS Transactions:PartB
• /
• v.12B no.7 s.103
• /
• pp.783-788
• /
• 2005

Recently researches that apply P2P networks to VOD streaming have been actively published In the previous works on VOD streaming, they aimed at achieving two major goals, which are zero-delay transmission and minimization of service rejection ratio. This paper proposes a new method, called ForwardCast, for VOD streaming based on a P2P-based multicasting tree in order to achieve theses two goals. In this method,- basically a new client selects one of the preceding clients and starts receiving a whole video from the selected one without any delay. In some situation, two preceding clients are selected to transfer the ending part of the video and its the remaining part simultaneously. In our experiment, ForwardCast can reduce the rejection ratio compared to previous works without increasing server stress.

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