1Department of Computer Engineering, West Tehran Branch, Islamic Azad University, Tehran, Iran
2Faculty of Computer and Information Technology Engineering, QazvinBranch, Islamic Azad University, Qazvin, Iran
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popularity distribution. The proposed mechanism has been evaluated on two different kinds of topology, Erdos-Renyi Model and Barabasi-Albert Model. It's necessary to mention that scale-free topologies are much more similar to P2P networks like Internet; so it’s closer to reality much more. However, decreasing waiting time is more tangible in them too. The results demonstrate that how our caching mechanism can reduce delay, improve bandwidth consumption, and decrease transport costs. Finally we came to the conclusion that increasing networks' size and videos' chunks has led to decrease much more delay by using proposed algorithm.