目前針對隨選視訊的同儕多媒體播放系統有很多篇研究在探討。大部分的研究在探討樹的架構和網狀的架構，然而就前者而言，樹的破碎性質是被大家公認的一項缺失，而後者需要相當多的控制訊息來交換影片片段。目前，有一些研究人員建議將樹的架構和網狀架構做一個整合以提昇整體的效能。就目前的研究而言，由於使用者必須強制同時加入兩個系統，這導致不能有效的提升收看品質和降低控制訊息。針對這個問題，我們提出了一個新的應用於隨選視訊多媒體串流的同儕混合系統。此系統最大的特點在於每個使用者會依據他們的收看行為加入樹的架構或是網狀架構。依據我們模擬出來的結果，收看品質和控制訊息數量上都得到了改善。

Many peer-to-peer (P2P) on-demand media streaming systems have been proposed in the recent P2P streaming literature. In most of the cases, the streaming systems adopt either tree-based or mesh-based overlay, of which the former is known to be frangible and the latter suffers from high control overhead. Recently, some researchers suggested a hybrid design to leverage both tree and mesh structures. However, the low quality of experience (QoE) and high control overhead problems are still not well resolved due to current solutions force all of the peers to join both the two overlays. In this thesis, we propose a novel hybrid P2P system for on-demand media streaming service with VCR functions. The primary idea is that most peers join only one overlay based on their behavior. Our simulation results show that our system boosts the streaming quality and also effectively reduces the control overhead.

[1] PPStream: http://www.ppstream.com/
[2] PPLive: http://www.pptv.com/
[3] UUSee: http://www.uusee.com/
[4] Q.F. Yu, T.Y. Xu, S.G. Lu, D.X. Chen, “SkipStream: A Clustered Skip Graph Based On-demand Streaming Scheme over Ubiquitous Environments,” In Proceedings of International Conference on Parallel Processing, Sep. 2009.

[5] W.P. Yiu, X. Jin, S.H. Chan. “VMesh: Distributed Segment Storage for Peer-to-Peer Interactive Video Streaming,” IEEE Journal on Selected Areas in Communications, Dec. 2007.

[6] Y. Guo, K.G. Suh, J. Kurose, D. Towsley, “P2Cast: Peer-to-Peer Patching Scheme for VoD Service,” In Proceedings of ACM, May 2003

[7] M. Zhou, J.C. Liu, “Tree-Assisted Gossiping for Overlay Video Distribution,” Journal on Multimedia Tools and Applications, Jun 2006.

[8] Y. He, Y.H. Liu, “VOVO: VCR-Oriented Video-on-Demand in Large-Scale Peer-to-Peer Networks,” IEEE Transaction on Parallel and Distributed System, Apr. 2009.

[9] T.T. Do, K.A. Hua, M.A. Tantaoui, “P2VoD: Providing Fault Tolerant Video-on-Demand Streaming in Peer-to-Peer Environment,” In Proceedings of IEEE International Conference on Communications, Jun. 2004.

[10] C.Q Xu, G.M. Muntean, E.D Fallon, X.G Li, “DONET-VoD: A Hybrid Overlay Solution for Efficient Peer-to-Peer Video on Demand Services,” In proceedings of IEEE International Conference on Multimedia and Expo, Apr. 2008.

[11] B. Cheng, H. Jin, and X. Liao, “Supporting VCR functions in P2P VoD services using ring-assisted overlays,“ In Proceedings of IEEE international conference on Communications , Jun. 2007.

[12] M. Zhou, J. Liu, “A Hybrid Overlay for Video-on-Demand.” In Proceedings of IEEE International Conference on Communications, May 2005.

[13] T.T. Do, K.A. Hua, and M.A. Tantaoui, “Robust video-on-demand streaming in peer-to-peer environments,” In Proceedings of Computer Communications, Volume 31, Issue 3, pp. 506-519, Feb. 2008.

[14] R. Zhang, A.R. Butt, and Y.C. Hu, “Topology-aware peer-to-peer on-demand streaming,” In Proceedings of the International IFIP-TC6 Networking Conference, May 2005.

[15] X. Zhang, J. Liu, B. Li, Yum, “CoolStreaming/DONet: a data-driven overlay network for peer-to-peer live media streaming,” In Proceedings of INFOCOM, Mar. 2005.

[16] H.V. Jagadish, B.C. Ooi, K.L. Tan, “Speeding up search in peer-to-peer networks with a multi-way tree structure,” In Proceedings of ACM SIGMOD, Jun. 2006.

[17] M. Cha, P. Rodriguez, J. Crowcroft, S. Moon, X. Amatrian, “Watching Television Over an IP Network,” In Proceedings of ACM SIGCOMM, Oct. 2008

[18] H. Yu, D. Zheng, B. Y. Zhao, W. Zheng,”Understanding User Behavior in Large-Scale Video-on-Demand Systems,” In Proceeding of ACM SIGOPS, Apr. 2006

[19] C. N. Lee, Y.C. Kao, M.T Tsai, “A vEB-tree-based architecture for interactive video on dwemand services in peer-to-peer networks,” Journal of Network and Computer Applications, Jul 2010
[20] GT-ITM: http://www.cc.gatech.edu/projects/gtitm/

[21]Floyd-Warshall algorithm:
http://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm

[22] F. L. Piccolo, G. Bianchi, S. Cassella, “Qrp03-4: Efficient simulation of bandwidth allocation dynamics in p2p networks,” In Proceedings of GLOBECOM, Dec. 2006

[23] Poisson distribution: http://en.wikipedia.org/wiki/Poisson_distribution

[24] Exponential distribution: http://en.wikipedia.org/wiki/Exponential_distribution

[25]Gossip protocol: http://en.wikipedia.org/wiki/Gossip_protocol