Network Performance Analysis of Startup Buffering for Live Streaming in P2P VOD Systems for Mesh-Based Topology
This paper explores mesh-based clustering for different start video streaming in P2P systems and estimates the performance of noncluster and clustered models. These models are based on mesh-based topology of P2P streaming consisting of peer join/leave. A
- PDF / 670,615 Bytes
- 9 Pages / 439.37 x 666.142 pts Page_size
- 109 Downloads / 194 Views
Abstract This paper explores mesh-based clustering for different start video streaming in P2P systems and estimates the performance of noncluster and clustered models. These models are based on mesh-based topology of P2P streaming consisting of peer join/leave. A new approach by way of “clustering” peers is proposed to tackle P2P VOD streaming. The proposed models were simulated and verified using OMNET++ V.4. A clustered model for video streaming is proposed and simulated to consider the performance of network under startup buffering for frame loss, startup delay, and end-to-end delay parameters. The results obtained from simulations are compared for both noncluster versus cluster models. The results show the impact of startup buffering on both models is also bounded due to time limits of release buffer and playing buffer under the proposed models, which causes reduction in wait time to view video improving the overall VOD system performance. The proposed model is also able to provide missing parts (of video) to late viewers, which gives the facilities of both live and stored streaming from user’s point of view, therefore it serves to be functionally hybrid and is most useful. Keywords Peer-to-peer (P2P)
Video streaming Video on demand (VOD)
N.C. Barwar (&) Faculty of Engineering, Department of Computer Science & Engineering, M.B.M Engineering College, J N V University, Jodhpur, India e-mail: [email protected]; [email protected] Bhadada Rajesh Faculty of Engineering, Department of Electronics & Communication Engineering, M.B.M Engineering College, J N V University, Jodhpur, India e-mail: [email protected] © Springer Science+Business Media Singapore 2016 S.C. Satapathy et al. (eds.), Proceedings of the International Congress on Information and Communication Technology, Advances in Intelligent Systems and Computing 439, DOI 10.1007/978-981-10-0755-2_29
271
272
N.C. Barwar and Bhadada Rajesh
1 Introduction P2P technology has been able to establish itself as an effective and flexible method for video streaming in dynamic and heterogeneous environments. Over the past few years, P2P-based technique had begun succeeding over the Internet in various applications such as file sharing, file download, and streaming transmission. Successful examples include PPLive and Coolstreaming [1]. By continued research a “cache-and-relay” method has come up, where client caches the recently played data and then keeps that copy of content to serve others. Some researchers have even used this concept for the P2P streaming system [2–4]. So recently, many systems use P2P technology and VOD services in a bundle to reduce the cost of video transmission effectively [4, 5]. Unfortunately, supporting interactive operations such as pause, fast forward, and rewind functions [4, 6, 7] are still at a bottleneck in development. In a P2P network, data is shared among the group of peers and required data is provided by a peer by means of searching through submitting queries to neighbors or to directory server. When the requisite
Data Loading...
