• Journal of the Korea Society of Computer and Information
• /
• v.16 no.2
• /
• pp.121-129
• /
• 2011

With advances in wireless networks and advent of powerful mobile devices such as smart phones, the demand for mobile IPTV services has been increasing. It is essential to minimize the energy consumption of mobile devices because their battery capacity is limited. In this paper, we therefore propose a new streaming structure in P2P-based mobile IPTV systems to minimize the energy consumption of mobile peers using agent peers. Agent peers can decrease the energy consumption of mobile peers significantly by performing streaming functionality and exchanging control messages for joining and leaving overlay networks in place of corresponding mobile peers. Finally, by simulation experiments using an energy model, we show that our proposed streaming structure can increase the lifetime of mobile peers using agent peers.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.95-103
• /
• 2012

In this paper, we propose an efficient mobile P2P streaming architecture to minimize playback jitters in P2P overlay networks based on wired/wireless networks even though mobile peers experience the handover. In this architecture, mobile peers receive data in a push manner to maximize the data receiving speed before and after the handover. In addition, they can maintain the buffering above a specific level through handover prediction and re-selection of neighbor peers. By simulation experiments, we show that our proposed architecture can improve the performance significantly when the handover occurs compared to the existing mesh structure.

• The KIPS Transactions:PartC
• /
• v.18C no.1
• /
• pp.51-60
• /
• 2011

In this paper, we propose a P4P based P2P system for live multimedia streaming services. In order to satisfy the strict requirement of delay in live multimedia streaming, in the proposed scheme, the P4P server of network provider provides the network status information related to delay and congestion links to P2P system in addition to the information to optimize the network resource utilization. The P2P system server, then, makes the peering suggestion based on the information from the network server. Also, we propose a playback synchronization mechanism that enable each peer to start the playback within the limited variation from the playback positions of source peer. Through the simulation results, it is shown that the proposed scheme not only deals with the original objective of the P4P framework, i.e., effective network utilization, but also the live multimedia streaming requirements. It enhances the playback continuity, and reduces the playback start-up latency and the control overhead. In addition, the proposed scheme reduces the variation in playback positions of the peers.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.11a
• /
• pp.29-31
• /
• 2014

스트리밍 전송을 위한 P2P 구조는 크게 메쉬구조와 트리 구조로 구분된다. 실시간 스트리밍에 유리한 트리 구조의 단점을 보완하기 위해 많은 연구가 진행되고 있다. 대표적으로 두개 이상의 트리 구조를 유지하는 다중 트리구조와 사용자들 중에서 안정적인 사용자를 트리의 중심에 위치시키는 백본 트리 구조가 있다. 다중 트리 구조는 단일트리의 단점을 극복하기 위해 트리와 메쉬 구조를 혼용한 구조로 안정적인 반면, 사용자들의 출입이 잦아지면 구조를 유지하기가 어려워지는 단점이 있다. 백본 트리 구조는 안정적인 사용자들로 트리의 중심 빼대를 구축한 후 나머지 사용자를 뼈대의 가지에 위치시키는 방법이다. 본 논문에서는 새롭게 설계한 분산형 스트리밍 전송기술을 위한 프로토콜의 구조에 대해서 설명하고, 제안된 프로토콜을 시뮬레이션을 통해 P2P 기반의 스트리밍 서비스의 가능성을 본다.

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

클라이언트-서버 구조의 스트리밍 시스템은 서버의 가용 능력에 따라 클라이언트의 개수가 제한되는 단점을 가진다. 본 논문에서는 인터넷 방송 시스템의 확장성과 안정성을 지원하기 위해 P2P에 기반한 모델을 제시한 후, 프로토타입 시스템을 설계 및 구현하였다. 본 논문에서 구현한 시스템 OmniCast264는 H.264 비디오 스트림을 제공하는 인코딩서버와 스트리밍서버, 피어노드, 프록시 서버로 구성된다. OmniCast264는 스트리밍 부하의 분산화, 실시간성, 에러 발생에 따른 강건함, 계층의 모듈화등의 개념을 가지고 있기 때문에 대용량의 인터넷 방송에 적합하다고 할 수 있다. 마지막으로 PC들을 병렬 및 직렬 구조의 유형으로 나누어 P2P를 구성한 후, OmniCast264의 성능을 평가하여 실시간 재생이 가능함을 검증하였다.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.4
• /
• pp.65-77
• /
• 2013

Recently the ratio of the Internet traffic generated by video streaming applications including video-on-demand (VOD) is getting higher and higher, while P2P-based naive content distribution has been the main source of the Internet traffic in the past. As a result, the paradigm of cooperatively distributed systems (e.g., P2P) is changing to support streaming applications. Most P2P assisted approaches for video streaming today are based on Bit Torrent thanks to its simplicity of implementation and easy adaptability. They, however, have immanent vulnerability to free-riding inherited from Bit Torrent, which inevitably hurts their performance under limited system resources with free-riding. This paper studies the weakness to free-riding of existing Bit Torrent-based video streaming applications and investigates the adaptability of T-Chain (which was originally designed to prevent free-riding in cooperatively distributed systems) to video streaming applications. Our experiment results show that the video streaming approach based on T-Chain outperforms most existing Bit Torrent-based ones by 60% on average under limited system resources with free-riding.

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

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.3
• /
• pp.81-86
• /
• 2014

According to the development of streaming services with P2P and mobile network technologies, researches to enhance the service quality in mobile environment have been proposed. However, streaming services considering high-speed mobile environment and characteristics of heterogenous terminals have been hindered from being provided with the required quality from user because of bandwidth congestion between selfish peers of existing P2P system. It is also prone to long delay and loss in accordance with the repeated traffic amounts because there are no optimized solution for traffic localization. The structure to enhance peer contribution for service differentiation and peer selection with clustering scheme with location information of terminal can satisfy both users and service providers with service quality and efficiency. In this paper, we propose an incentive mechanism and resource distribution scheme with user contribution and traffic cost information based on user location, which make mobile users increase the satisfaction of service quality in LTE environments.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06d
• /
• pp.375-377
• /
• 2012

본 논문은 P2P 환경에서 파운틴 코드를 이용하여 효율적으로 비디오 스트리밍 서비스를 제공하는 멀티캐스트 시스템을 제안한다. 제안하는 시스템은 멀티캐스트 트리 전체의 전송 지연과 복구 지연의 합을 최소화하는 초기 코드율과 복구 노드 벡터를 결정하고, 부분 부호화 복구 기법을 사용하여 복구 지연을 감소시킨다. 실험 결과를 통해 제안한 시스템이 오버레이 멀티캐스트 트리 상에서 빠르고 효율적으로 비디오 스트리밍 서비스를 제공함을 보인다.

• The KIPS Transactions:PartB
• /
• v.17B no.3
• /
• pp.189-196
• /
• 2010

Peer-to-Peer (P2P) has attracted attention as an alternative way to enable streaming videos on the Internet. Although P2P systems depend on bandwidth contribution from peers, peers are likely to refuse to contribute their bandwidth. In this paper, we proposed a P2P streaming system that encourages peers to contribute their upstream bandwidth by maintaining fairness among peers and providing different video quality between cooperative peers and selfish peers with a manageable way. Our proposed system determines if peers are cooperative or selfish by a rating mechanism based on their contributed upstream bandwidth, and offers a high quality video to cooperative peers as an incentive. Also we propose a tree reconstruction algorithm to make the system work effectively. Through simulation, we show that the tree reconstruction algorithm works effectively, and our incentive mechanism allocates more downstream bandwidth to cooperative peers and punished selfish peers with low quality video.