BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Department of Computer Science - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Department of Computer Science
X-ORIGINAL-URL:https://www.cs.jhu.edu
X-WR-CALDESC:Events for Department of Computer Science
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20170312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20171105T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20181104T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20180921T130000
DTEND;TZID=America/New_York:20180921T150000
DTSTAMP:20260422T164648
CREATED:20210629T210714Z
LAST-MODIFIED:20210629T210714Z
UID:1962115-1537534800-1537542000@www.cs.jhu.edu
SUMMARY:Computer Science Student Defense:: Amy Babay\, Johns Hopkins University – “Timely\, Reliable\, and Cost-Effective Internet Transport Service using Structured Overlay Networks”
DESCRIPTION:LocationMalone 228AbstractEmerging applications such as remote manipulation and remote robotic surgery require communication that is both timely and reliable\, but the Internet natively supports only communication that is either completely reliable with no timeliness guarantees (e.g. TCP) or timely with only best-effort reliability (e.g. UDP). We present an overlay transport service that can provide highly reliable communication while meeting stringent timeliness guarantees (e.g. 130ms round-trip latency across the US) over the Internet. To enable routing schemes that can support the necessary timeliness and reliability\, we introduce dissemination graphs\, providing a unified framework for specifying routing schemes ranging from a single path\, to multiple disjoint paths\, to arbitrary graphs. Based on an extensive analysis of real-world network data\, we develop a timely dissemination-graph-based routing method that can add targeted redundancy in problematic areas of the network. We show that this approach can cover close to 99% of the performance gap between a traditional single-path approach and an optimal (but prohibitively expensive) scheme.BioAmy Babay is a PhD student in the Department of Computer Science at Johns Hopkins University\, where she works with Yair Amir in the Distributed Systems and Networks Lab. Her research focuses on enabling new Internet services using structured overlay networks and on building intrusion-tolerant critical infrastructure systems. She received her BA in Cognitive Science in 2012 and her MSE in Computer Science in 2014\, both from Johns Hopkins University. Prior to starting her PhD\, she gained experience with global overlay networks in the commercial world\, working at LTN Global Communications.HostYair Amir
URL:https://www.cs.jhu.edu/event/computer-science-student-defense-amy-babay-johns-hopkins-university-timely-reliable-and-cost-effective-internet-transport-service-using-structured-overlay-networks/
END:VEVENT
END:VCALENDAR