BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:505@lincs.fr
DTSTART;TZID=Europe/Paris:20191023T140000
DTEND;TZID=Europe/Paris:20191023T150000
DTSTAMP:20191029T143536Z
URL:https://www.lincs.fr/events/cache-subsidies-for-an-optimal-memory-for-
 bandwidth-tradeoff-in-the-access-network/
SUMMARY:Cache Subsidies for an Optimal Memory for Bandwidth Tradeoff in the
 Access Network
DESCRIPTION:\nAuthors: &nbsp\;Mahdieh Ahmadi\, James Roberts\, Emilio
 Leonardi\, and Ali Movaghar\n\n\n\nWhile the cost of the access network
 could be considerably reduced by the use of caching\,this is not currently
 happening because content providers (CPs)\, who alone have the detailed
 demand data required for optimal content placement\, have no natural
 incentive to use them to minimize access network operator (ANO)
 expenditure. We argue that ANOs should therefore provide such an incentive
 in the form of directsubsidies paid to the CPs in proportion to the
 realized savings. We apply coalition game theory to design the required
 subsidy framework and propose a distributed algorithm\, based on Lagrangian
 decomposition\, allowing ANOs and CPs to collectively realize the optimal
 memory for bandwidth tradeoff. The considered access network is a cache
 hierarchy with per-CP central office caches\, accessed by all ANOs\, at the
 apex\,and per-ANO dedicated bandwidth and storage resources at the lower
 levels\, including wireless base stations\, that must be shared by multiple
 CPs.\n
CATEGORIES:Seminars,Youtube
LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013
 Paris\, France
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013
 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT
 Digital):geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20190331T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR