Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Network Coding Gaps for Completion Times of Multiple Unicasts

IEEE via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore network coding gaps for completion times of multiple unicasts in this 29-minute IEEE conference talk. Learn about the motivation, output model, and objectives behind this research. Understand protocols, completion-time gap examples, and the key questions addressed. Dive into the results, including warm-up bounds, cut bounds for routing and general scenarios, and the effectiveness of these bounds. Examine the moving cut proof and upper bounds on coding gaps. Discover high coding gap families and consider open questions in this field presented by researchers from Carnegie Mellon University.

Syllabus

Intro
Motivation
Model: Output
Model: Objective
What are Protocols?
Completion-Time Gap Example
Our Question
Our Results
Warm-up Bounds
Cut Bound I Only Valid for Routing
Cut Bound II
How Good are the Cut Bounds?
Moving Cut (Proof)
Upper Bounding the Coding Gap
High Coding Gap Families
Open Questions

Taught by

IEEE FOCS: Foundations of Computer Science

Reviews

Start your review of Network Coding Gaps for Completion Times of Multiple Unicasts

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.