BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//IEEE Toronto Section - ECPv6.18.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:IEEE Toronto Section
X-ORIGINAL-URL:https://www.ieeetoronto.ca
X-WR-CALDESC:Events for IEEE Toronto Section
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20261119T190000
DTEND;TZID=UTC:20261119T200000
DTSTAMP:20261118T165013Z
CREATED:20261118T165013Z
LAST-MODIFIED:20261118T165013Z
UID:10000939-1795114800-1795118400@www.ieeetoronto.ca
SUMMARY:Optimization approaches for network resource management
DESCRIPTION:Optimization problems in network traffic scheduling and resource management are often challenging due to uncertainty\, nonconvexity\, large decision spaces\, and other system-specific constraints. In this talk\, I will present several of our recently developed approaches for addressing these challenges.  The first problem considers computation offloading over time-varying wireless channels and seeks the optimal offloading start time while satisfying task completion deadlines. A time-dilated absorbing Markov model is developed\, and optimal stopping theory for Markov decision processes is used to derive the optimal offloading policy.  The second problem investigates the placement of digital twins on edge servers. The objective is to minimize the synchronization time between physical systems (PSs) and their digital twins (DTs)\, subject to the communication and computation requirements. The problem is formulated as a multi-commodity quickest flow evacuation problem\, followed by an unsplittable-flow rounding procedure.  The third problem considers privacy-preserving channel resource sharing using federated optimization and digital twins. A mixed-integer continuous optimization problem is formulated and relaxed into a continuous problem. An approximate solution is then obtained through dependent rounding followed by convex re-optimization.  Speaker(s): Dongmei \,   Virtual: https://events.vtools.ieee.org/m/591989
URL:https://www.ieeetoronto.ca/event/optimization-approaches-for-network-resource-management/
LOCATION:Virtual: https://events.vtools.ieee.org/m/591989
END:VEVENT
END:VCALENDAR