Keynan Pratt
Carey Williamson
ABSTRACT
Multimedia streaming services such as YouTube and Netflix consume a staggering amount of Internet bandwidth [1]. Furthermore, traditional mechanisms such as proxy caches, content distribution networks, and redundant traffic elimination are rendered ineffective by copyright concerns, regulatory issues, and the growing prevalence of end-to-end encryption. One possible solution is a peer-to-peer caching system with social relationships at the core of its topology construction. A social topology carries an implicit level of trust, and induces a relatively high degree of correlation between users that can be exploited by the system as a whole. For example, two users with shared interests are more likely to have relevant videos in cache for each other. This short paper discusses the design of a simulator for such a system to provide insight into the performance of different cache management policies.
- V. Adhikari, Y. Guo, F. Hao, V. Hilt, Z. Zhang, M. Varvello, and M. Steiner. Measurement study of netflix, hulu, and a tale of three cdns. IEEE/ACM Transactions on Networking, 23(6):1984--1997, Dec 2015.Google Scholar
Digital Library
- J. Armstrong. Erlang. Communications of the ACM, 53(9):68, 2010. Google ScholarDigital Library
- A. Barabási and R. Albert. Statistical mechanics of complex networks. Reviews of Modern Physics, 74(January):48--94, 2002.Google Scholar
- B. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422--426, 1970. Google ScholarDigital Library
- I. Clarke, O. Sandberg, B. Wiley, and T. Hong. Freenet: A distributed anonymous information storage and retrieval system. Designing Privacy Enhancing Technologies., pages 46--66, 2001. Google ScholarDigital Library
- F. Comellas, G. Fertin, and A. Raspaud. Recursive graphs with small-world scale-free properties. Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, 69(3 2):2--5, 2004.Google Scholar
- M. Duggan and A. Smith. Social media update 2013. Pew Internet and American Life Project, 2013.Google Scholar
- P. Erdös and A. Rényi. On random graphs. Publicationes Mathematicae, 6:290--297, 1959.Google ScholarCross Ref
- P. Erdos and A. Renyi. The evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci, 5(1):17, 1961.Google Scholar
- M. Laterman.textitNetFlix and Twitch Traffic Characterization. Master's thesis, University of Calgary, 2015.Google Scholar
- P. L'Ecuyer and R. Simard. TestU01: A c Library for empirical testing of random number generators. ACM Transactions on Mathematical Software, 33(4), 2007. Google ScholarDigital Library
- Q. Telesford, K. Joyce, S. Hayasaka, J. Burdette, and P. Laurienti. The Ubiquity of Small-World Networks. Brain Connectivity, 1(5):367--375, Dec. 2011.Google ScholarCross Ref
- D. Watts and S. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393(6684):440--2, 1998.Google ScholarCross Ref
Index Terms
- A Simulator for Distributed Cache Managementin Friend-to-Friend Networks
Recommendations
An Efficient Hybrid Peer-to-Peer System for Distributed Data Sharing
Peer-to-peer overlay networks are widely used in distributed systems. Based on whether a regular topology is maintained among peers, peer-to-peer networks can be divided into two categories: structured peer-to-peer networks in which peers are connected ...
Subjective and Objective Types of Trustworthiness in Peer-to-Peer(P2P) Overlay Networks
WAINA '10: Proceedings of the 2010 IEEE 24th International Conference on Advanced Information Networking and Applications WorkshopsSystems using peer-to-peer (P2P) overlay networks are getting a central position in information systems. P2P systems are in nature fully distributed with no centralized coordinator and each peer is autonomous. Each peer has to obtain information on ...
Comments