• 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 the Korea Society of Computer and Information
• /
• v.17 no.1
• /
• pp.151-159
• /
• 2012

In this paper, we propose a new peer grouping scheme to consider locality among peers using TTL values in P2P-based IPTV systems. This scheme can select neighbor peers to minimize the number of intermediate routers between each pair of peers. Thus, it can save the network bandwidth as much as the amount of data that the reduced number of routers should transmit In addition, we have conducted various simulation experiments to show that our proposed TTL-based peer grouping scheme can outperform the conventional RTT-based grouping scheme. The experimental results show that our proposed scheme can reduce the jitter ratio as well as the number of data and control packets that all routers should transmit.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4207-4222
• /
• 2016

In a P2P (Peer-to-Peer) VoD (video-on-Demand) streaming system, the nodes' load is an important factor which affects the system performance. In the system, some nodes may receive too many requests, which leads to overload. On the other hand, some other nodes may receive too few requests, which leads to low utilization. Therefore, designing a reasonable load balancing strategy is important. However, existing related studies cannot handle this problem effectively, because they don't have an efficient dynamic load information management mechanism, and they don't distinguish the difference of requests when transfer the nodes' load. In this paper, to manage the dynamic load information efficiently, we design a load management table for each node. Based on the load information, we propose a load balancing strategy which uses a request migration algorithm (LBRM). Through simulations, our scheme can handle the load imbalance problem effectively and improve the users' playback fluency.

• 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을 이용하여 다른 피어의 요청에도 대처할 수 있다.

• 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 메시지의 브로드캐스트로 인한 시그널링 오버헤드를 비약적으로 줄일 수 있음을 보였다.

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

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

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2922-2945
• /
• 2018

Achieving efficient authentication is a crucial issue for stream data commonly seen in content delivery, peer-to-peer, and multicast/broadcast networks. Stream authentication mechanisms need to be operated efficiently at both sender-side and receiver-side at the same time because of the properties of stream data such as real-time and delay-sensitivity. Until now, many stream authentication mechanisms have been proposed, but they are not efficient enough to be used in stream applications where the efficiency for sender and receiver sides are required simultaneously since most of them could achieve one of either sender-side and receiver-side efficiency. In this paper, we propose an efficient stream authentication mechanism, so called TIM, by integrating Trapdoor Hash Function and Merkle Hash Tree. Our construction can support efficient streaming data processing at both sender-side and receiver-side at the same time differently from previously proposed other schemes. Through theoretical and experimental analysis, we show that TIM can provide enhanced performance at both sender and receiver sides compared with existing mechanisms. Furthermore, TIM provides an important feature for streaming authentication, the resilience against transmission loss, since each data block can be verified with authentication information contained in itself.

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

As VOD service over the Internet becomes popular, a large sealable VOD system in P2P streaming environment has become increasing important. In this paper, we propose a new proxy caching scheme, called P2Proxy, to replace the traditional proxy with a sealable P2P proxy in P2P streaming environment. In the proposed scheme, each client in a group stores a different part of the stream from a server into its local buffer and then uses a group of clients as a proxy. Each client receives the request stream from other clients as long as the parts of the stream are available in the client group. The only missing parts of the stream which are not in the client group are directly received from the server. We represent the caching process between clients in a group and a server and then describe a group creation process. This paper proposes the directory structure to share the caching information among clients. By using the directory information, we minimize message exchange overload for a stream caching and playing. We also propose a recovery method for failures about the irregular behavior of P2P clients. In this paper, we evaluate the performance of our proposed scheme and compare the performance with the existing P2P streaming systems.

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