@conference {12230,
	title = {CPM: Adaptive Video-on-Demand with Cooperative Peer Assists and Multicast},
	booktitle = {INFOCOM 2009, IEEE},
	year = {2009},
	month = {2009/04//},
	pages = {91 - 99},
	abstract = {We present CPM, a unified approach that exploits server multicast, assisted by peer downloads, to provide efficient video-on-demand (VoD) in a service provider environment. We describe our architecture and show how CPM is designed to dynamically adapt to a wide range of situations including highly different peer-upload bandwidths, content popularity, user request arrival patterns, video library size, and subscriber population. We demonstrate the effectiveness of CPM using simulations (based on an actual implementation codebase) across the range of situations described above and show that CPM does significantly better than traditional unicast, different forms of multicast, as well as peer-to-peer schemes. Along with synthetic parameters, we augment our experiments using data from a deployed VoD service to evaluate the performance of CPM.},
	keywords = {assists;multicast;peer-to-peer, communication;peer-to-peer, computing;video, CPM;cooperative, demand;, on, parameters;video-on-demand;multicast, peer, schemes;synthetic},
	doi = {10.1109/INFCOM.2009.5061910},
	author = {Gopalakrishnan,V. and Bhattacharjee, Bobby and Ramakrishnan,K.K. and Jana,R. and Srivastava,D.}
}
@article {18181,
	title = {Collusion-Resistant Video Fingerprinting for Large User Group},
	journal = {Information Forensics and Security, IEEE Transactions on},
	volume = {2},
	year = {2007},
	month = {2007/12//},
	pages = {697 - 709},
	abstract = {Digital fingerprinting protects multimedia content from illegal redistribution by uniquely marking copies of the content distributed to users. Most existing multimedia fingerprinting schemes consider a user set on the scale of thousands. However, in such real-world applications as video-on-demand distribution, the number of potential users can be as many as 10-100 million. This large user size demands not only strong collusion resistance but also high efficiency in fingerprint construction, and detection, which makes most existing schemes incapable of being applied to these applications. A recently proposed joint coding and embedding fingerprinting framework provides a promising balance between collusion resistance, efficient construction, and detection, but several issues remain unsolved for applications involving a large group of users. In this paper, we explore how to employ the joint coding and embedding framework and develop practical algorithms to fingerprint video in such challenging settings as to accommodate more than ten million users and resist hundreds of users{\textquoteright} collusion. We investigate the proper code structure for large-scale fingerprinting and propose a trimming detection technique that can reduce the decoding computational complexity by more than three orders of magnitude at the cost of less than 0.5\% loss in detection probability under moderate to high watermark-to-noise ratios. Both analytic and experimental results show a high potential of joint coding and embedding to meet the needs of real-world large-scale fingerprinting applications.},
	keywords = {code, coding-embedding, coding;video, communication;video, complexity;decoding;digital, complexity;digital, computational, content;trimming, demand;watermarking;, DETECTION, distribution;computational, fingerprinting, fingerprinting;decoding, fingerprinting;joint, framework;large, group;multimedia, identification;multimedia, on, signatures;fingerprint, structure;collusion-resistant, technique;video-on-demand, user, video},
	isbn = {1556-6013},
	doi = {10.1109/TIFS.2007.908179},
	author = {He,Shan and M. Wu}
}
@article {17815,
	title = {Presentation planning for distributed VoD systems},
	journal = {Knowledge and Data Engineering, IEEE Transactions on},
	volume = {14},
	year = {2002},
	month = {2002/10//sep},
	pages = {1059 - 1077},
	abstract = {A distributed video-on-demand (VoD) system is one where a collection of video data is located at dispersed sites across a computer network. In a single site environment, a local video server retrieves video data from its local storage device. However, in distributed VoD systems, when a customer requests a movie from the local server, the server may need to interact with other servers located across the network. In this paper, we present different types of presentation plans that a local server can construct in order to satisfy a customer request. Informally speaking, a presentation plan is a temporally synchronized sequence of steps that the local server must perform in order to present the requested movie to the customer. This involves obtaining commitments from other video servers, obtaining commitments from the network service provider, as well as making commitments of local resources, while keeping within the limitations of available bandwidth, available buffer, and customer data consumption rates. Furthermore, in order to evaluate the quality of a presentation plan, we introduce two measures of optimality for presentation plans: minimizing wait time for a customer and minimizing access bandwidth which, informally speaking, specifies how much network/disk bandwidth is used. We develop algorithms to compute three different optimal presentation plans that work at a block level, or at a segment level, or with a hybrid mix of the two, and compare their performance through simulation experiments. We have also mathematically proven effects of increased buffer or bandwidth and data replications for presentation plans which had previously been verified experimentally in the literature.},
	keywords = {Computer, computing;, databases;, demand;, distributed, local, multimedia, network;, on, optimal, plan;, plans;, presentation, presentation;, server;, servers;, video, video-on-demand;, VoD;},
	isbn = {1041-4347},
	doi = {10.1109/TKDE.2002.1033774},
	author = {Hwang,Eenjun and Prabhakaran,B. and V.S. Subrahmanian}
}
