att_abstract={{Multicast has seen a resurgence in the recent past, driven by the need to  efficiently disseminate large volumes of real-time content, especially  with the growth of IPTV. Video-on-Demand (VoD) delivery by multicasting  still remains a challenge. Requests for popular content can be aggregated  and served by multicast groups, but it has always been uncertain as to how  much aggregation can be achieved. In this paper, we show that combining a  good data model and an intelligent scheduler can help us realize  significant benefits through multicast. Our design investigates an  Earliest Deadline First-like (EDF) scheduler that aims to schedule the  transmission of video ``chunks" according to their deadlines over  multicast groups.  We show through analysis that a dynamic multicast approach we term EDF-D  is optimal, and minimizes the number of chunks sent from the VoD server.  We use VoD request data from an operational  service to quantify the benefit of multicasting and the amount of  aggregation. Specifically, we observe a significant  reduction in server bandwidth when compared to traditional techniques like  unicast (65\%) and cyclic multicast (58\%). Finally, we show that even  with 50\% of the requesting users performing some amount of fast  forwarding, there is negligible reduction in the amount of aggregation.  Version 3 reflects the changes made to conform for the camera ready  manuscript for ACM Multimedia 2009 conference. The technical material in  this version has only been slightly modified to account for reveiwers'  comments.  }},
	att_authors={vg7777, rj2124, kr2812},
	att_tags={VoD, cyclic multicast, scheduling, IPTV, EDF},
	author={Vijay Gopalakrishnan and Rittwik Jana and Kadangode Ramakrishnan and Vaneet Aggarwal and Robert Calderbank and Fang Yu},
	institution={{ACM Multimedia 2009}},
	title={{The Effectiveness of Intelligent Scheduling for Multicast VoD}},