Abstract
Contemporary systems use centralized as well as peer-to-peer mechanisms for the large scale distribution of media objects. In this work, we investigate a serendipitous mechanism for directly sharing media objects among a local community of wireless users. This localized sharing is attractive when wide area network connectivity is undesirable, expensive or unavailable; especially when the shared media objects are large. With some restrictions, such localized sharing of media objects is also acceptable to content owners. However, localized sharing has to contend with far fewer media providers who may also not offer the variety of objects available from wide-area services. We collected empirical data from the widely deployed Apple iTunes application for our analysis. We showed that users are already making a significant amount of media objects available for serendipitous sharing. Our analysis showed that the shared object annotations exhibited a Zipfian long tail distribution. The availability patterns of wireless iTunes users and the object annotations makes serendipitous sharing inappropriate for scenarios that require access to a specific object. Instead, mechanisms that allow the user to specify classes of interesting objects are better suited for such users. Also, given the smaller scale of these systems, serendipitous sharing can benefit from approaches that allow users to disseminate a compact representation of their shared objects. Though the wireless user availability rates was not as high as what was observed in a corporate desktop setting, a large fraction of the users showed high temporal consistency. This allows for high availability with reasonable replication during weekday daytime hours. We answer important questions regarding the viability of a campus-wide media sharing system.
- Acosta, W. and Chandra, S. 2007. Trace-driven analysis of the long term evolution of Gnutella peer-to-peer traffic. In Proceedings of the 8th Passive and Active Measurement Conference (PAM'07). Google Scholar
Digital Library
- Acosta, W. and Chandra, S. 2008a. On the need for query-centric unstructured peer-to-peer overlays. In Proceedings of the IEEE Conference on Hot Topics in Peer-to-Peer Systems (HotP2P'08).Google Scholar
- Acosta, W. and Chandra, S. 2008b. Understanding the practical limits of the gnutella p2p system: An analysis of query terms and object name distributions. In Proceedings of the ACM/SPIE Conference on Multimedia Computing and Networking (MMCN'08).Google Scholar
- Adya, A., Bolosky, W. J., Castro, M., Cermak, G., Chaiken, R., Douceur, J. R, Howell, J., Lorch, J. R, Theimer, M., and Wattenhofer, R. P. 2002. Farsite: Federated, available, and reliable storage for an incompletely trusted environment. SIGOPS Oper. Syst. Rev. 36, 1--14. Google Scholar
Digital Library
- Aubrey, S. 2003. Adventures in higher education: ipod envy. The Wesleyan Argus. http://www.wesleyan.edu/argus/archives/nov042003/dateyear/w1.html.Google Scholar
- Balazinska, M. and Castro, P. 2003. Characterizing mobility and network usage in a corporate wireless local-area network. In Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'03). 303--316. Google Scholar
Digital Library
- Bolosky, W. J., Douceur, J. R., Ely, D., and Theimer, M. 2000. Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs. In Proceedings of the ACM SIGMETRICS. Joint International Conference on Measurement and Modeling of Computer Systems. 34--43. Google Scholar
Digital Library
- Broder, A. and Mitzenmacher, M. 2004. Network applications of Bloom filters: A survey. Internet Math. 1, 4, 485--509.Google Scholar
Cross Ref
- Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Gass, R., and Scott, J. 2006. Impact of human mobility on the design of opportunistic forwarding algorithms. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'06). 1--13.Google Scholar
- Chandra, S. and Yu, X. 2007. Share with thy neighbors. In Proceedings of the ACM/SPIE Conference on Multimedia Computing and Networking (MMCN'07).Google Scholar
- Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., and Shenker, S. 2003. Making Gnutella-like p2p systems scalable. In Proceedings of the ACM SIGCOMM Data Communications Festival (SIGCOMM'03). 407--418. Google Scholar
Digital Library
- Chazelle, B., Kilian, J., Rubinfeld, R., and Tal, A. 2004. The bloomier filter: an efficient data structure for static support lookup tables. In Proceedings of the 15th annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04). SIAM, Philadelphia, PA, 30--39. Google Scholar
Digital Library
- Davies, C. Applerecords. www.cdavies.org/applerecords.html.dnssd. Dns service discovery. http://www.dns-sd.org/.gnutella-y04. The Gnutella protocol specification v0.4. http://dss.clip2.coml_Gnutel1aProtocol04.pdf.Google Scholar
- Graham, J. 2006. RIAA chief says illegal song-sharing ‘contained’. USA Today (6/12/06).Google Scholar
- Gummadi, K. P., Dunn, R. J., Saroiu, S., Gribble, S. D., Levy, H. M., and Zahorjan, J. 2003. Measurement, modeling, and analysis of a peer-to-peer file-sharing workload. In Proceedings of the 19th ACM Symposium on Operating Systems Principles. 314--329. Google Scholar
Digital Library
- Guttman, E. 2001. Autoconfiguration for IP networking: Enabling local communication. IEEE Internet Comput. 5, 3, 81--86. Google Scholar
Digital Library
- Henderson, T., Kotz, D., and Abyzov, I. 2004. The changing usage of a mature campus-wide wireless network. In Proceedings of the Annual International Conference on Mobile Computing and Networking (MobiCom'04). 187--201. Google Scholar
Digital Library
- Hui, P., Chaintreau, A., Scott, J., Gass, R., Crowcroft, J., and Diot, C. 2005. Pocket switched networks and human mobility in conference environments. In Proceedings of the ACM SIGCOMM Workshop on Delay-Tolerant Networking. 244--251. Google Scholar
Digital Library
- Hui, P. and Crowcroft, J. 2007. How small labels create big improvements. In Proceedings of the IEEE International Conference on Pervasive Computing and Communications Workshops. 65--70. Google Scholar
Digital Library
- Hsu, W.-J. and Helmy, A. 2005. Impact: Investigation of mobile-user patterns across university campuses using wlan trace analysis. Tech. rep. 05-858, USC.Google Scholar
- Kirovski, D. and Jain, K. 2006. Off-line economies for digital media. In Proceedings of the ACM International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV'06). 118--123. Google Scholar
Digital Library
- Kotz, D. and Essien, K. 2002. Analysis of a campus-wide wireless network. In Proceedings of the Annual International Conference on Mobile Computing and Networking (MobiCom'02). 107--118. Google Scholar
Digital Library
- Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Wells, C., and Zhao, B. 2000. Oceanstore: An architecture for global-scale persistent storage. In Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems. 190--201. Google Scholar
Digital Library
- Lovitt, R. 2008. In-flight internet access takes off. http://msnbc.msn.com/id/25463095/.Google Scholar
- Manolios, P. Bloom filter calculator. http://www-static.cc.gatech.edu/~manolios/bloom-filters/calculator.html.Google Scholar
- Massoulie, L., Merrer, E. L., Kermarrec, A.-M., and Ganesh, A. 2006. Peer counting and sampling in overlay networks: random walk methods. In Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing (PODC'06). 123--132. Google Scholar
Digital Library
- Mickens, J. W. and Noble, B. D. 2005. Modeling epidemic spreading in mobile environments. In Proceedings of the 4th ACM Workshop on Wireless Security (WiSe'05). 77--86. Google Scholar
Digital Library
- Missouri 2009. Audio-video player with web browser requirement undergraduate program. http://journalism.missouri.edu/undergraduate/web-media-player.html.Google Scholar
- Mitzenmacher, M. 2001. Compressed Bloom filters. In Proceedings of the 20th annual ACM Symposium on Principles of Distributed Computing (PODC'01). 144--150. Google Scholar
Digital Library
- Rowstron, A. and Diwshel, P. 2001. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of the 18th IFIP/ACM Conference on Distributed Systems Platforms (Middleware'01). 329--350. Google Scholar
Digital Library
- Saroiu, S., Gummadi, P. K., and Gribble, S. D. 2002. A measurement study of peer-to-peer file sharing systems. In Proceedings of the ACM/SPIE Conference on Multimedia Computing and Networking (MMCN'02).Google Scholar
- Schiller, P. 2009. Macworld expo 2009 keynote.Google Scholar
- Song, L. and Eotz, D. 2007. Evaluating opportunistic routing protocols with large realistic contact traces. In Proceedings of the ACM MobiCom Workshop on Challenged Networks (CHANTS'07). Google Scholar
Digital Library
- Stoica, I., Adkins, D., Zhuang, S., Shenker, S., and Surana, S. 2004. Internet indirection infrastructure. IEEE/ACM Trans. Netw. 12, 2, 205--218. Google Scholar
Digital Library
- Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., and Balakrishnan, H. 2001. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. 149--160. Google Scholar
Digital Library
- Stutzbach, D., Rejaie, R., and Sen, S. 2007. Characterizing unstructured overlay topologies in modern p2p file-sharing systems. IEEE/ACM Trans. Netw. Google Scholar
Digital Library
- Tang, D. and Baker, M. 2000. Analysis of a local-area wireless network. In Proceedings of the Annual International Conference on Mobile Computing and Networking (Mobicom'00). 1--10. Google Scholar
Digital Library
- Timiraos, N. 2006. Free, legal and ignored. Wall St. J., (7/6/06). p. B1.Google Scholar
- Voida, A., Grinter, R. E., Ducheneaut, N., Edwards, W. K., and Newman, M. W. 2005. Listening in: Practices surrounding iTunes music sharing. In Proceedings of the ACM Conference on Human Factors in Computing Systems (CHI'05). 191--200. Google Scholar
Digital Library
- Yan, G., Flores, H. D., Cuellar, L., Hengartner, N., Eidenbenz, S., and Vu, V. 2007. Bluetooth worm propagation: Mobility pattern matters! In Proceedings of the 2nd ACM Symposium on Information, Computer and Communications Security (ASIACCS'07). 32--44. Google Scholar
Digital Library
- Yu, X. and Chandra, S. 2008. Campus-wide asynchronous lecture distribution using wireless laptops (short paper). In Proceedings of the ACM/SPIE Conference on Multimedia Computing and Networking (MMCN'08).Google Scholar
- Zaharia, M. A., Chandel, A., Saroiu, S., and Keshav, S. 2007. Finding content in file-sharing networks when you can't even spell. In Proceedings of the 6th Workshop on Peer-to-Peer Systems (IPTPS'07).Google Scholar
- Zhao, S., Stutzbach, D., and Rejaie, R. 2006. Characterizing files in the modern gnutella network: A measurement study. Proceedings of the ACM/SPIE Conference on Multimedia Computing and Networking.Google Scholar
- Zhuang, S., Lai, E., Stoica, I., Katz, R., and Shenker, S. 2003. Host mobility using an internet indirection infrastructure. In Proceedings of the 1st International Conference on Mobile Systems, Applications and Services (MobiSys'03). ACM, New York, NY. 129--144. Google Scholar
Digital Library
Index Terms
An empirical analysis of serendipitous media sharing among campus-wide wireless users
Recommendations
Ideal Secret Sharing Schemes with Share Selectability
Information and Communications SecurityAbstractIn this paper, we investigate a new concept, called share selectable secret sharing, where no unauthorized set can obtain information of the secret (in the information-theoretic sense) even if shares are selectable as arbitrary values which are ...
Image Secret Sharing Construction for General Access Structure with Meaningful Share
This article describes how the (k, n) threshold image secret sharing technology can recover the secret image even n − k shares are lost, or n−k servers do not work, which is useful for cloud storage, etc. Image secret sharing for general access ...
A secret sharing scheme with a short share realizing the (t,n) threshold and the adversary structure
On the basis of the properties of the Jordan matrix, we proposed a secret sharing scheme which can realize both the (t,n) threshold and the adversary structure and share a large secret while each participant has a short share. At the same time, the ...






Comments