COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Computer Laboratory Systems Research Group Seminar > DINC: Toward Distributed In-Network Computing / Exploring the Benefits of Carbon-Aware Routing
DINC: Toward Distributed In-Network Computing / Exploring the Benefits of Carbon-Aware RoutingAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Ryan Gibb. Title: DINC : Toward Distributed In-Network Computing Speaker: Changgang Zheng Abstract: In-network computing provides significant performance benefits, load reduction, and power savings. Still, an in-network service’s functionality is strictly limited to a single hardware device. Research has focused on enabling on-device functionality, with limited consideration to distributed in-network computing. This presentation explores 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 and providing functionality guarantees across a network. It uses multi-objective optimization to provide a deployment strategy, slicing P4 programs accordingly. DINC was evaluated using seven different workloads on both data center and wide-area network topologies, demonstrating feasibility and scalability, providing efficient distribution plans within seconds. Title: Exploring the Benefits of Carbon-Aware Routing Speaker: Sawsan El Zahr Abstract: Carbon emissions associated with fixed networks can be significant. However, accounting for these emissions is hard, requires changes to deployed equipment, and has contentious benefits. This work sheds light on the benefits of carbon aware networks, by exploring a set of potential carbon-related metrics and their use to define link-cost in carbon-aware link-state routing algorithms. Using realistic network topologies, traffic patterns and grid carbon intensity, we identify useful metrics and limitations to carbon emissions reduction. Consequently, a new heuristic carbon-aware traffic engineering algorithm, CATE , is proposed. CATE takes advantage of carbon intensity and routers’ dynamic power consumption, combined with ports power down, to minimize carbon emissions. Our results show that there is no silver bullet to significant carbon reductions, yet there are promising directions without changes to existing routers’ hardware. This talk is part of the Computer Laboratory Systems Research Group Seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsLattice field theory informal seminars Mathematical model of algorithm and the non-contact method of interaction between the electronic device and the proposed source for determining electrical and biochemical parameters based on the electromagnetic field PriscillaOther talksAI4ER special student session - Literature review knowledge exchange Ethics for the working mathematician, Seminar 6: Understanding the behaviour of the mathematical community ‘Christopher Hill and the Crisis of Bourgeois Culture in the 1930s’ Lunch at Moller Institute The genetic basis of a recent transition to live-bearing in marine snails The acoustics of bouncing: drumsticks, impact hammers and church bells |