BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20190331T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20181028T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260407T164007Z
UID:5c32fb32ea02a457501063@ist.ac.at
DTSTART:20190205T100000
DTEND:20190205T110000
DESCRIPTION:Speaker: Derya Malak\nhosted by Vladimir Kolmogorov\nAbstract: 
 This talk focuses on the central problem of coordinating computation and c
 aching in networks in order to handle the large volume of data with growin
 g computational demand\, using some of the most recent results in stochast
 ic geometry and information theory. Distributed caching is a powerful tech
 nique to minimize the total average delay by replacing the backhaul capaci
 ty with storage capacity at small cells\, and to enable spectral reuse and
  throughput gain in networks. In order to leverage proximity-based communi
 cations\, we exploited the spatial diversity of the content and reciprocat
 ion of the users as a proxy for optimizing cache placement. For general de
 mand profiles under various small-scale fading distributions\, our results
  suggest that it is required to flatten the demand distribution to optimiz
 e the cache hit rate. Motivated by the randomized caching models\, we prop
 osed a novel decentralized negatively associated cache placement policy\, 
 which is known as Matrn hard-core point process inspired cache placement (
 HCP). HCP captures the pairwise geometric interactions in networks. Contra
 sting it with the baseline spatially independent caching models\, HCP show
 s that repulsive cache placement often yields a higher cache hit probabili
 ty. Performance gain is more eminent for small cache sizes and small commu
 nication radii\, which is promising for proximity-based applications. This
  talk also focuses on achieving delay and reliability guarantees\; and dev
 eloping scalable and robust solutions for connectivity in wireless network
 s. We investigated the tradeoff between in-order delivery delay and rate i
 n wireless networks with imperfect (delayed and erased) feedback when codi
 ng. This approach has brought together signal flow techniques to the area 
 of coding. We developed adaptive (re)coding techniques for delay sensitive
  applications\, and reliable and scalable routing protocols for wireless m
 esh networks. We showed that using multi-hop WiFi links and recoding for l
 ong backhaul connections can provide a cost-effective solution in terms of
  delay. Finally\, this talk describes a new perspective to cloud computing
 \, by employing the concepts of graph entropy and function surjectivity in
  order to devise coding techniques for functional compression\, and coordi
 nating computation and caching in networks.
LOCATION:Mondi Seminar Room 2\, Central Building\, ISTA
ORGANIZER:tguggenb@ist.ac.at
SUMMARY:Derya Malak: Coordinating Caching and Computation in Networks
URL:https://talks-calendar.ista.ac.at/events/1722
END:VEVENT
END:VCALENDAR