BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1081
DTSTAMP:20230914T125949Z
SUMMARY:Minimizing the Sum of Age of Information and Transmission Cost unde
r Stochastic Arrival Model
DESCRIPTION:Speaker: Kumar Saurav\n\nAbstract: \nWe consider a node-monitor
pair\, where updates are generated stochastically (according to a known d
istribution) at the node that it wishes to send to the monitor. The node i
s assumed to incur a fixed cost for each transmission\, and the objective
of the node is to find the update instants so as to minimize a linear comb
ination of AoI of information and average transmission cost. First\, we co
nsider the Poisson arrivals case\, where updates have an exponential inter
-arrival time for which we derive an explicit optimal online policy. Next\
, for arbitrary distributions of inter-arrival time of updates\, we propos
e a simple randomized algorithm that transmits any newly arrived update wi
th a fixed probability (that depends on the distribution) or never transmi
ts that update. The competitive ratio of the proposed algorithm is shown t
o be a function of the variance and the mean of the inter-arrival time dis
tribution. For some of the commonly considered distributions such as expon
ential\, uniform\, and Rayleigh\, the competitive ratio bound is shown to
be 2.\n
URL:https://www.tcs.tifr.res.in/web/events/1081
DTSTART;TZID=Asia/Kolkata:20200904T171500
DTEND;TZID=Asia/Kolkata:20200904T181500
LOCATION:Zoom link: https://zoom.us/j/92834710011?pwd=WURSa3JsRVpJYWhONEE
xYTdDcENDQT09
END:VEVENT
END:VCALENDAR