BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:DINC: Toward Distributed In-Network Computing /  Exploring the Ben
 efits of Carbon-Aware Routing - changgang.zheng@eng.ox.ac.uk\, sawsan.elza
 hr@eng.ox.ac.uk
DTSTART:20231123T150000Z
DTEND:20231123T160000Z
UID:TALK207940@talks.cam.ac.uk
CONTACT:Ryan Gibb
DESCRIPTION:Title: DINC: Toward Distributed In-Network Computing\nSpeaker:
  Changgang Zheng\nAbstract: \nIn-network computing provides significant pe
 rformance benefits\, load reduction\, and power savings. Still\, an in-net
 work service’s functionality is strictly limited to a single hardware de
 vice. Research has focused on enabling on-device functionality\, with limi
 ted consideration to distributed in-network computing. This presentation e
 xplores the applicability of distributed computing to in-network computing
 . We present DINC\, a framework enabling distributed in-network computing\
 , generating deployment strategies\, overcoming resource constraints\nand 
 providing functionality guarantees across a network. It uses multi-objecti
 ve optimization to provide a deployment strategy\, slicing P4 programs acc
 ordingly. DINC was evaluated using seven different workloads on both data 
 center and wide-area network topologies\, demonstrating feasibility and sc
 alability\, providing efficient distribution plans within seconds.\n\nTitl
 e: Exploring the Benefits of Carbon-Aware Routing\nSpeaker: Sawsan El Zahr
 \nAbstract:\nCarbon emissions associated with fixed networks can be signif
 icant. However\, accounting for these emissions is hard\, requires changes
  to deployed equipment\, and has contentious benefits. This work sheds lig
 ht on the benefits of carbon aware networks\, by exploring a set of potent
 ial carbon-related metrics and their use to define link-cost in carbon-awa
 re link-state routing algorithms. Using realistic network topologies\, tra
 ffic patterns and grid carbon intensity\, we identify useful metrics and l
 imitations to carbon emissions reduction. Consequently\, a new heuristic c
 arbon-aware traffic engineering algorithm\, CATE\, is proposed. CATE takes
 \nadvantage of carbon intensity and routers’ dynamic power consumption\,
  combined with ports power down\, to minimize carbon emissions. Our result
 s show that there is no silver bullet to significant carbon reductions\, y
 et there are promising directions without changes to existing routers’ h
 ardware.
LOCATION:FW11
END:VEVENT
END:VCALENDAR