BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Department of Electrical & Computer Engineering - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://ece.northeastern.edu
X-WR-CALDESC:Events for Department of Electrical & Computer Engineering
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20191103T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20201101T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20201030T110000
DTEND;TZID=America/New_York:20201030T120000
DTSTAMP:20260509T114228
CREATED:20201024T021519Z
LAST-MODIFIED:20201024T021519Z
UID:4534-1604055600-1604059200@ece.northeastern.edu
SUMMARY:ECE PhD Dissertation Defense: Ran Liu
DESCRIPTION:PhD Dissertation Defense: Optimal Proactive Services with Uncertain Predictions \nRan Liu \nLocation: Zoom Link \nAbstract: With the evolution of technologies such as machine learning and data science\, proactive services with the aid of predictive information have been recognized as a promising method to exploit network bandwidth\, storage\, and computation resources to achieve improved user experiences\, especially delay performance.\nSpecifically\, services can be processed proactively when the system is lightly loaded\, with the results stored to meet user demand in the future.\nOur primary goal in the thesis is to investigate the fundamental performance improvement that can be achieved from proactive services under uncertain predictions. We aim to analyze the queueing behavior of proactive systems under certain proactive strategies and characterize the improvement in terms of the limiting fraction of proactive work and the limiting average delay. \nIn the first work\, we analytically investigate the problem of how to efficiently utilize uncertain predictive information to design proactive caching strategies with provably good access-delay characteristics.\nFirst\, we derive an upper bound for the average amount of proactive service per request that the system can support.\nThen we analyze the behavior of a family of threshold-based proactive strategies with a Markov chain\, which shows that the average amount of proactive service per request can be maximized by properly selecting the threshold.\nFinally\, we propose the UNIFORM strategy\, which is the threshold-based strategy with the optimal threshold\, and show that it outperforms the commonly used Earliest-Deadline-First (EDF) type proactive strategies in terms of delay.\nWe perform extensive numerical experiments to demonstrate the influence of thresholds on delay performance under the threshold-based strategies\, and specifically\, compare the EDF strategy and the UNIFORM strategy to verify our results. \nIn the second work\, we study a more generalized proactive service problem with a more generalized service model and derive explicit solutions on the limiting average fraction of proactive work and the limiting average delay in closed-form expressions.\nIn this work\, we analytically investigate how to optimally take advantage of under-utilized network resources for proactive services with the aid of uncertain predictive information.\nSpecifically\, we first derive an upper bound on the fraction of services that can be completed proactively by a single-server system.\nThen we analyze a family of fixed-probability (FIXP) proactive strategies in two proactive systems\, namely the Genie-Aided system and the Realistic Proactive system.\nWe analyze the asymptotic behaviors of the FIXP strategies by modeling a Markov process and the corresponding embedded Markov Chain.\nWe obtain optimal FIXP strategies in both systems and prove that the optimal FIXP strategies maximize the limiting fraction of proactive service among all proactive strategies and minimize average delay among FIXP strategies.\nWe perform extensive numerical experiments to demonstrate the influence of the parameter of FIXP on the performance of the limiting fraction of proactive service and the limiting average delay in both proactive systems and verify our theoretical results in multiple scenarios.
URL:https://ece.northeastern.edu/event/ece-phd-dissertation-defense-ran-liu-2/
END:VEVENT
END:VCALENDAR