BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
DTSTART:20250309T030000
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZNAME:PDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20251102T010000
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZNAME:PST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20250512T222629Z
UID:0E322B67-2AC2-442D-9EB0-E6A59CEB31E6
DTSTART;TZID=America/Los_Angeles:20250506T190000
DTEND;TZID=America/Los_Angeles:20250506T200000
DESCRIPTION:Diversity coding is a form of network coding for link failure r
 ecovery in communication networks. Since it employs coding\, there is no f
 eedback signaling\, and that feature makes it very fast. One approach\, Di
 versity Coding Tree\, employs mixed integer programming and results in ver
 y fast restoration. Another approach is called Coded Path Protection and e
 mploys integer linear programming and has the advantage of small extra cap
 acity. This latter technique is based on former work that considers a comm
 unication network as consisting of bidirectional links. This technique emp
 loys a mixed integer linear programming formulation and results in restora
 tion times as fast as Diversity Coding Tree with reduced extra capacity.\n
 \nSpeaker(s): Ender Ayanoglu\, \n\nVirtual: https://events.vtools.ieee.org
 /m/466460
LOCATION:Virtual: https://events.vtools.ieee.org/m/466460
ORGANIZER:isayan@ieee.org
SEQUENCE:11
SUMMARY:Algorithms to Implement Diversity Coding for Link Failures in Netwo
 rks
URL;VALUE=URI:https://events.vtools.ieee.org/m/466460
X-ALT-DESC:Description: &lt;br /&gt;&lt;p&gt;Diversity coding is a form of network codi
 ng for link failure recovery in communication networks. Since it employs c
 oding\, there is no feedback signaling\, and that feature makes it very fa
 st. One approach\, Diversity Coding Tree\, employs mixed integer programmi
 ng and results in very fast restoration. Another approach is called Coded 
 Path Protection and employs integer linear programming and has the advanta
 ge of small extra capacity. This latter technique is based on former work 
 that considers a communication network as consisting of bidirectional link
 s. This technique employs a mixed integer linear programming formulation a
 nd results in restoration times as fast as Diversity Coding Tree with redu
 ced extra capacity.&lt;/p&gt;
END:VEVENT
END:VCALENDAR

