STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Long-term movie popularity models in video-on-demand systems: or the life of an on-demand movie
MULTIMEDIA '97 Proceedings of the fifth ACM international conference on Multimedia
Efficient, distributed data placement strategies for storage area networks (extended abstract)
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
ARIMA time series modeling and forecasting for adaptive I/O prefetching
ICS '01 Proceedings of the 15th international conference on Supercomputing
Compact, adaptive placement schemes for non-uniform requirements
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
P2Cast: peer-to-peer patching scheme for VoD service
WWW '03 Proceedings of the 12th international conference on World Wide Web
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Pagoda: a dynamic overlay network for routing, data management, and multicasting
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Networking requirements for interactive video on demand
IEEE Journal on Selected Areas in Communications
Division-of-labor between server and P2P for streaming VoD
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
On replication algorithm in P2P VoD
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Peer to peer applications have gained high popularity in the past years. In particular, P2P media streaming architectures have attracted much attention, so that audio and video sharing is causing a large fraction of the Internet traffic today. In this paper we introduce a new peer to peer architecture that focuses on distributed video on demand file sharing and that is based on point-to-point file delivery between the peers. The P2P architecture includes dynamic data distribution and replication schemes that are able to guarantee a fair load balancing among the peers. This load balancing enables the P2P architecture to avoid hot spots inside the distribution network and to ensure a nearly optimal throughput. A main component of the P2P architecture is an ARIMA based forecasting module, that is able to predict the access probability of individual files. This forecasting module has an impact on the location of documents concerning the characteristic of peers and in addition is used to control the number of replicas of each file. In this paper we present some simulation results indicating not only the feasibility of this architectural approach but also the benefits resulting from dynamic content distribution.