BEGIN:VCALENDAR VERSION:2.0 PRODID:IEEE vTools.Events//EN CALSCALE:GREGORIAN BEGIN:VTIMEZONE TZID:Europe/Stockholm BEGIN:DAYLIGHT DTSTART:20250330T030000 TZOFFSETFROM:+0100 TZOFFSETTO:+0200 RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3 TZNAME:CEST END:DAYLIGHT BEGIN:STANDARD DTSTART:20241027T020000 TZOFFSETFROM:+0200 TZOFFSETTO:+0100 RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10 TZNAME:CET END:STANDARD END:VTIMEZONE BEGIN:VEVENT DTSTAMP:20241107T160421Z UID:3BCFE668-B9C3-440A-A0EA-D5AF9448A199 DTSTART;TZID=Europe/Stockholm:20241107T151500 DTEND;TZID=Europe/Stockholm:20241107T163000 DESCRIPTION:[]\n\nTitle:\n\nDistributed storage systems with dynamic access /load balancing\n\nAbstract:\n\nThe problem of designing codes for distrib uted storage systems has received significant attention due to its relevan ce to many practical applications and interesting analytical challenges.\n \nMany relevant distributed coding schemes are based on combinatorial desi gns which ensure efficient content regeneration and system recovery. An ex ample includes fractional repetition codes that are both conceptually simp le and easy to implement.\nOne important problem mostly overlooked in codi ng for distributed storage pertains to access balancing (i.e.\, load balan cing) where one requires that the number of access requests to servers bot h during repair and data download are close-to-uniform. To implement such a balancing scheme\, one needs to take into account the popularities of th e stored data chunks or files as these dictate the number of access reques ts received by the servers.\n\nWe introduce new access (load) balancing fr actional repetition codes that represent the first instance of combinatori al designs with both classical intersection and labeling (coloring) constr aints. The codes maintain the properties of classical fractional repetitio n codes but also ensure that the average popularity scores of data files a t different servers are nearly the same. We then describe a dynamic popula rity-change model and explain how it relates to combinatorial trades. We c onclude the talk by introducing a new problem of designing popularity-chan ge stable trades and provide constructions for the same based on specializ ed graph representations of popularity changes.\n\nThis is joint work with Charles Colbourn\, Hoang Dau\, Ryan Gabry\, Chao Pan\, and Jin Sima\n\nCo -sponsored by: Michael Lentmaier\, Lund University\n\nSpeaker(s): Prof. Ol gica Milenkovic\n\nRoom: E:2517\, Bldg: E-building\, Lund University\, Kla s Anshelms väg 10\, Lund\, Skane lan\, Sweden\, Virtual: https://events.v tools.ieee.org/m/444097 LOCATION:Room: E:2517\, Bldg: E-building\, Lund University\, Klas Anshelms väg 10\, Lund\, Skane lan\, Sweden\, Virtual: https://events.vtools.ieee. org/m/444097 ORGANIZER:michael.lentmaier@eit.lth.se SEQUENCE:15 SUMMARY:IEEE Technical Seminar by Prof. Olgica Milenkovic on Distributed St orage URL;VALUE=URI:https://events.vtools.ieee.org/m/444097 X-ALT-DESC:Description: <br /><p style="caret-color: rgb(0\, 0\, 0)\; color : rgb(0\, 0\, 0)\; font-family: -webkit-standard\; font-style: normal\; fo nt-variant-caps: normal\; font-weight: 400\; letter-spacing: normal\; orph ans: auto\; text-align: start\; text-indent: 0px\; text-transform: none\; white-space: normal\; widows: auto\; word-spacing: 0px\; -webkit-text-stro ke-width: 0px\; text-decoration: none\;"><span lang="EN-US" style="font-fa mily: arial\, helvetica\, sans-serif\;"><img src="https://site.ieee.org/sw eden-vtcomit/files/2019/04/header_logo_2.png" alt="" width="993" height="7 0"></span></p>\n<p>&nbsp\;</p>\n<p><strong>Title:&nbsp\;</strong></p>\n<p> Distributed storage systems with dynamic access/load balancing</p>\n<p><st rong>Abstract:&nbsp\;</strong></p>\n<p>The problem of designing codes for distributed storage systems has received significant attention due to its relevance to many practical applications and interesting analytical challe nges.</p>\n<p>Many relevant distributed coding schemes are based on combin atorial designs which ensure efficient content regeneration and system rec overy. An example includes fractional repetition codes that are both conce ptually simple and easy to implement.<br>One important problem mostly over looked in coding for distributed storage pertains to access balancing (i.e .\, load balancing) where one requires that the number of access requests to servers both during repair and data download are close-to-uniform. To i mplement such a balancing scheme\, one needs to take into account the popu larities of the stored data chunks or files as these dictate the number of access requests received by the servers. &nbsp\;</p>\n<p>We introduce new access (load) balancing fractional repetition codes that represent the fi rst instance of combinatorial designs with both classical intersection and labeling (coloring) constraints. The codes maintain the properties of cla ssical fractional repetition codes but also ensure that the average popula rity scores of data files at different servers are nearly the same. We the n describe a dynamic popularity-change model and explain how it relates to combinatorial trades. We conclude the talk by introducing a new problem o f designing popularity-change stable trades and provide constructions for the same based on specialized graph representations of popularity changes. </p>\n<p>This is joint work with Charles Colbourn\, Hoang Dau\, Ryan Gabry \, Chao Pan\, and Jin Sima</p>\n<p>&nbsp\;</p> END:VEVENT END:VCALENDAR