فهرس المقالات Caching

• حرية الوصول المقاله
  • صفحة الملخص
  • نص كامل
  
  1 - A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
  Venus Marza Amir. H JadidiNejad
  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 أکثر

  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. تفاصيل المقالة
• حرية الوصول المقاله
  • صفحة الملخص
  • نص كامل
  
  2 - Improve Replica Placement in Content Distribution Networks with Hybrid Technique
  Davood Mokhlesi Ghanevati Ehsan Khorami Behzad Boukani Mohammad Trik
  The increased using of the Internet and its accelerated growth leads to reduced network bandwidth and the capacity of servers; therefore, the quality of Internet services is unacceptable for users while the efficient and effective delivery of content on the web has an i أکثر

  The increased using of the Internet and its accelerated growth leads to reduced network bandwidth and the capacity of servers; therefore, the quality of Internet services is unacceptable for users while the efficient and effective delivery of content on the web has an important role to play in improving performance. Content distribution networks were introduced to address this issue. Replicating and caching are the two main techniques to find the optimal substitute server for replicating the content in these networks. Most of the past research has focused on these two methods separately. In this paper, first the surrogate server’s storage divides into two regions for dynamic and static contents. Then with combining the cache and replication techniques, a heuristic hybrid method based on the greedy algorithm is proposed to add contents in dynamic or static cache regions. In this technique, any possible content is evaluated in each replication, and the best ones are selected and replicated according to the conditions. At the end the proposed approach evaluated in CDNsim environment and the results shown that the algorithm reduced average response time and maximize hit ratio. تفاصيل المقالة