BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:Asia/Jerusalem
BEGIN:DAYLIGHT
DTSTART:20250328T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
RRULE:FREQ=YEARLY;BYDAY=-1FR;BYMONTH=3
TZNAME:IDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20241027T010000
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:IST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20250418T070855Z
UID:5962F70E-937D-483B-A698-B58584D87D0C
DTSTART;TZID=Asia/Jerusalem:20250205T113000
DTEND;TZID=Asia/Jerusalem:20250205T123000
DESCRIPTION:Workloads\, Storage\, and Service Allocation in Edge Computing\
 n\nAbstract. Edge computing extends cloud capabilities to the proximity of
  end-users\, offering ultra-low latency\, which is essential for real-time
  applications. Unlike traditional cloud systems that suffer from latency a
 nd reliability constraints due to distant datacenters\, edge computing emp
 loys a distributed model\, leveraging local edge datacenters to process an
 d store data.\n\nThis talk explores key challenges in edge computing acros
 s three domains: workloads\, storage\, and service allocation.\n\nThe firs
 t part focuses on the absence of comprehensive edge workload datasets. Cur
 rent datasets do not accurately reflect the unique attributes of edge syst
 ems. To address this\, we propose a workload composition methodology and i
 ntroduce WoW-IO\, an open-source trace generator. The second part examines
  aspects of edge storage. Edge datacenters are significantly smaller than 
 their cloud counterparts and require dedicated solutions. We analyze the a
 pplicability of a promising mathematical model for edge storage systems an
 d raise inherent gaps between theory and practice. The final part addresse
 s the virtual network embedding problem (VNEP). In VNEP\, given a set of r
 equests for deploying virtualized applications\, the edge provider has to 
 deploy a maximum number of them to the underlying physical network\, subje
 ct to capacity constraints. We propose novel solutions\, including a proac
 tive service allocation strategy for mobile users\, a flexible algorithm f
 or service allocation that is adaptable to the underlying physical topolog
 y\, and an algorithm for scalable online service allocation.\n\nSpeaker(s)
 : Oleg Kolosov\n\nRoom: #8\, Bldg: CS Taub Building\, Technion City\, Haif
 a\, Haifa District\, Israel\, 3200003
LOCATION:Room: #8\, Bldg: CS Taub Building\, Technion City\, Haifa\, Haifa 
 District\, Israel\, 3200003
ORGANIZER:yaron.b.hay@gmail.com
SEQUENCE:3
SUMMARY:ceClub Seminar - Workloads\, Storage\, and Service Allocation in Ed
 ge Computing
URL;VALUE=URI:https://events.vtools.ieee.org/m/463757
X-ALT-DESC:Description: <br /><div><strong>Workloads\, Storage\, and Servic
 e Allocation in Edge Computing</strong></div>\n<div><strong>&nbsp\;</stron
 g></div>\n<p>Abstract. Edge computing extends cloud capabilities to the pr
 oximity of end-users\, offering ultra-low latency\, which is essential for
  real-time applications. Unlike traditional cloud systems that suffer from
  latency and reliability constraints due to distant datacenters\, edge com
 puting employs a distributed model\, leveraging local edge datacenters to 
 process and store data.</p>\n<p><br>This talk explores key challenges in e
 dge computing across three domains: workloads\, storage\, and service allo
 cation.</p>\n<p>The first part focuses on the absence of comprehensive edg
 e workload datasets. Current datasets do not accurately reflect the unique
  attributes of edge systems. To address this\, we propose a workload compo
 sition methodology and introduce WoW-IO\, an open-source trace generator. 
 The second part examines aspects of edge storage. Edge datacenters are sig
 nificantly smaller than their cloud counterparts and require dedicated sol
 utions. We analyze the applicability of a promising mathematical model for
  edge storage systems and raise inherent gaps between theory and practice.
  The final part addresses the virtual network embedding problem (VNEP). In
  VNEP\, given a set of requests for deploying virtualized applications\, t
 he edge provider has to deploy a maximum number of them to the underlying 
 physical network\, subject to capacity constraints. We propose novel solut
 ions\, including a proactive service allocation strategy for mobile users\
 , a flexible algorithm for service allocation that is adaptable to the und
 erlying physical topology\, and&nbsp\; an algorithm for scalable online se
 rvice allocation.</p>\n<p>&nbsp\;</p>
END:VEVENT
END:VCALENDAR