BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
DTSTART:20170312T030000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZNAME:EDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20161106T010000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZNAME:EST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20161104T145234Z
UID:A6C33EF1-A29C-11E6-A7C6-0050568D7F66
DTSTART;TZID=America/New_York:20161118T140000
DTEND;TZID=America/New_York:20161118T153000
DESCRIPTION:Smartphone and tablet proliferation is generating an enormous i
 ncrease in the demand for multimedia content. Modern wireless networks can
 not support this demand and its large projected growth. We explain how cac
 hing of popular content can play a fundamental role in addressing this pro
 blem and how several novel mathematical and algorithmic problems arise.\n\
 nWe focus on the Femtocaching problem and the Coded Caching problem introd
 uced by Maddah-Ali and Niesen and discuss how caching is very promising fo
 r giving gains that scale surprisingly well in the size of the wireless sy
 stem. Unfortunately\, we show that for these gains to appear\, the cached 
 files must be separated in a number of blocks that scales exponentially in
  the number of users and files. We show how this can problem can be resolv
 ed if we modify the Maddah-Ali and Niesen scheme to place and deliver code
 d packets in a less optimistic way.\n\nSpeaker(s): Dr. Alexandros Dimakis\
 , \n\nRoom: 302\, Bldg: Bossone Research Center\, 3126 Market St\, Philade
 lphia\, Pennsylvania\, United States\, 19104
LOCATION:Room: 302\, Bldg: Bossone Research Center\, 3126 Market St\, Phila
 delphia\, Pennsylvania\, United States\, 19104
ORGANIZER:jwalsh@ece.drexel.edu
SEQUENCE:3
SUMMARY:Coding and Distributed Caching for Content Delivery
URL;VALUE=URI:https://events.vtools.ieee.org/m/42016
X-ALT-DESC:Description: <br /><p>Smartphone and tablet proliferation is gen
 erating an enormous increase in the demand for multimedia content. Modern 
 wireless networks cannot support this demand and its large projected growt
 h. We explain how caching of popular content can play a fundamental role i
 n addressing this problem and how several novel mathematical and algorithm
 ic problems arise.</p>\n<p>We focus on the Femtocaching problem and the Co
 ded Caching problem introduced by Maddah-Ali and Niesen and discuss how ca
 ching is very promising for giving gains that scale surprisingly well in t
 he size of the wireless system. Unfortunately\, we show that for these gai
 ns to appear\, the cached files must be separated in a number of blocks th
 at scales exponentially in the number of users and files. We show how this
  can problem can be resolved if we modify the Maddah-Ali and Niesen scheme
  to place and deliver coded packets in a less optimistic way.</p>
END:VEVENT
END:VCALENDAR