BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
DTSTART:20270314T030000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZNAME:EDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20261101T010000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZNAME:EST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20261107T063401Z
UID:943B9376-8094-4ED0-BB8E-E978E4FCC6AA
DTSTART;TZID=America/New_York:20261119T140000
DTEND;TZID=America/New_York:20261119T150000
DESCRIPTION:Optimization problems in network traffic scheduling and resourc
 e management are often challenging due to uncertainty\, nonconvexity\, lar
 ge decision spaces\, and other system-specific constraints. In this talk\,
  I will present several of our recently developed approaches for addressin
 g these challenges.\n\nThe 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 decisi
 on processes is used to derive the optimal offloading policy.\n\nThe secon
 d problem investigates the placement of digital twins on edge servers. The
  objective is to minimize the synchronization time between physical system
 s (PSs) and their digital twins (DTs)\, subject to the communication and c
 omputation requirements. The problem is formulated as a multi-commodity qu
 ickest flow evacuation problem\, followed by an unsplittable-flow rounding
  procedure.\n\nThe third problem considers privacy-preserving channel reso
 urce sharing using federated optimization and digital twins. A mixed-integ
 er continuous optimization problem is formulated and relaxed into a contin
 uous problem. An approximate solution is then obtained through dependent r
 ounding followed by convex re-optimization.\n\nSpeaker(s): Dongmei \, \n\n
 Virtual: https://events.vtools.ieee.org/m/591989
LOCATION:Virtual: https://events.vtools.ieee.org/m/591989
ORGANIZER:ajmery.sultana@algomau.ca
SEQUENCE:19
SUMMARY:Optimization approaches for network resource management
URL;VALUE=URI:https://events.vtools.ieee.org/m/591989
X-ALT-DESC:Description: &lt;br /&gt;&lt;p style=&quot;text-align: justify\; text-justify:
  inter-ideograph\;&quot;&gt;Optimization problems in network traffic scheduling an
 d resource management are often challenging due to uncertainty\, nonconvex
 ity\, large decision spaces\, and other system-specific constraints. In th
 is talk\, I will present several of our recently developed approaches for 
 addressing these challenges.&lt;/p&gt;\n&lt;p style=&quot;text-align: justify\; text-jus
 tify: inter-ideograph\;&quot;&gt;The first problem considers computation offloadin
 g over time-varying wireless channels and seeks the optimal offloading sta
 rt time while satisfying task completion deadlines. A time-dilated absorbi
 ng Markov model is developed\, and optimal stopping theory for Markov deci
 sion processes is used to derive the optimal offloading policy.&lt;/p&gt;\n&lt;p st
 yle=&quot;text-align: justify\; text-justify: inter-ideograph\;&quot;&gt;The second pro
 blem investigates the placement of digital twins on edge servers. The obje
 ctive is to minimize the synchronization time between physical systems (PS
 s) and their digital twins (DTs)\, subject to the communication and comput
 ation requirements. The problem is formulated as a multi-commodity quickes
 t flow evacuation problem\, followed by an unsplittable-flow rounding proc
 edure.&lt;/p&gt;\n&lt;p style=&quot;text-align: justify\; text-justify: inter-ideograph\
 ;&quot;&gt;The third problem considers privacy-preserving channel resource sharing
  using federated optimization and digital twins. A mixed-integer continuou
 s optimization problem is formulated and relaxed into a continuous problem
 . An approximate solution is then obtained through dependent rounding foll
 owed by convex re-optimization.&lt;/p&gt;
END:VEVENT
END:VCALENDAR

