BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20211207T055409Z
LOCATION:222
DTSTART;TZID=America/Chicago:20211115T113000
DTEND;TZID=America/Chicago:20211115T120000
UID:submissions.supercomputing.org_SC21_sess346_ws_indis102@linklings.com
SUMMARY:Exploring the BBRv2 Congestion Control Algorithm for Use on Data T
 ransfer Nodes
DESCRIPTION:Workshop\n\nExploring the BBRv2 Congestion Control Algorithm f
 or Use on Data Transfer Nodes\n\nTierney, Dart, Kissel, Adhikarla\n\nIt is
  well known that loss-based TCP congestion control algorithms are problema
 tic for high-speed high-latency flows that are common in Big Science. In 2
 016 Google released a new congestion control algorithm called ’BBR’ (Bottl
 eneck Bandwidth and Round-trip time) that uses a model-based approach, and
  the design has since been refined in an alpha release of BBRv2.  In this 
 presentation, we describe and perform a set of experiments that assess the
  suitability of BBRv2 for use on Data Transfer Nodes (DTNs).  The experime
 nts were run on both production R&E networks as well as within a controlle
 d testbed environment. Our analysis of the  results show that BBRv2 improv
 es upon BBRv1 for common Big Science transfer scenarios and is a promising
  option in high-speed short-queue networking environments.\n\nTag: Big Dat
 a, Cloud and Distributed Computing, Data Analytics, Data Management, Datac
 enter, Networks, Performance, Quantum Computing\n\nRegistration Category: 
 Workshop Reg Pass
END:VEVENT
END:VCALENDAR