DIMACS Workshop on Network Coding: the Next 15 Years

DIMACS Workshop on Network Coding: the Next 15 Years

December 15 - 17, 2015
DIMACS Center, CoRE Building, Rutgers University

Organizers:: Michael Langberg, SUNY Buffalo; Emina Soljanin, Bell Labs, emina at research.bell-labs.com; Alex Sprintson, Texas A&M

Presented under the auspices of the Special Focus on Cybersecurity, the Special Focus on Information Sharing and Dynamic Data Analysis and the Special Focus on Energy and Algorithms, with additional support for travel from the Institute of Network Coding of The Chinese University of Hong Kong.

Workshop Program:

Tuesday, December 15, 2015

 8:30 -  9:00  Breakfast and Registration

History and Foundations - chair: Emina Soljanin

 9:00 -  9:30  Introduction by organizers

 9:30 - 10:30  Something Ancient & Something Recent   Slides   Video
               Raymond Yeung, INC-Chinese University of Hong Kong

10:30 - 11:00  Coffee

11:00 - 11:45  Remote Greetings 
               Muriel Medard, MIT
               Frank Kschischang, University of Toronto
               Christina Fragouli, UCLA

11:45 - 12:00  "Lightning talks" for posters

12:00 -  1:20  Lunch + poster session

Network Information Theory - chair: Emina Soljanin

 1:20 -  1:30  DIMACS Welcome - Tami Carpenter, DIMACS Deputy Director
               Announcements - organizers

 1:30 -  2:30  Network Coding Beyond Network Coding   Slides 
               Michelle Effros, Caltech

 2:30 -  3:00  Coffee

 3:00 -  4:00  Capacity Bounds for Diamond Networks   Slides  Video
               Gerhard Kramer, TU Munich

 4:00 -  4:30  Coffee

 4:30 -  5:30  The Role of Index Coding in Network Information Theory   Video
               YoungHan Kim, UCSD
 
 5:30 -  7:00  Dinner

Wednesday, December 16, 2015

 8:30 -  9:00  Breakfast and Registration

Broad Connections - chair: Michael Langberg

 9:00 - 10:00  Impact of Network Coding on Combinatorial Optimization   Slides   Video
               Chandra Chekuri, UIUC

10:00 - 10:30  Coffee

10:30 - 11:30  The Impact of Network Coding on Mathematics - Notes from COST Action IC1104   Slides   Video
               Eimear Byrne, UCD

11:30 - 12:00  Coffee

12:00 -  1:00  Network (Coding) Security: Known knowns, Unknown knowns, and Unknowns   Slides  Video 
               Sid Jaggi, INC-Chinese University of Hong Kong

 1:00 -  2:30  Lunch + poster session

Distributed Storage and Applications - chair: Alex Sprintson

 2:30 -  3:15  Constructions of Codes with the Locality Property   Slides   Video
               Alexander Barg, UMD

 3:15 -  3:35  Coffee

 3:35 -  4:20  Locally Repairable Codes and Index Coding   Slides   Video
               Alex Dimakis, UT Austin

 4:20 -  4:30  Break

 4:30 -  5:00  An Information Theoretic Perspective of Consistent Distributed Storage  Slides   Video
               Viveck Cadambe, Penn State

 5:00 -  5:30  Scheduling and Transmission Aspects in Distributed Storage and Their
               Connections with Index Coding   Slides   Video
               Parastoo Sadeghi, ANU

 5:30          Dinner on your own

Thursday, December 17, 2015

 8:30 -  9:00  Breakfast and Registration

Recent Results 1 - chair: Gerhard Kramer

 9:00 -  9:30  Network Equivalence in the Presence of Active Adversaries   Slides   Video
               Oliver Kosut, ASU

 9:30 - 10:00  Improved Lower Bounds for Coded Caching   Slides   Video
               Aditya Ramamoorthy, ISU

10:00 - 10:30  Coffee

10:30 - 11:00  Duality in Simple Multiple Access Networks   Slides
               Iwan Duursma, UIUC

11:00 - 11:30  Coding with Constraints: Different Flavors   Slides   Video
               Hoang Dau, UIUC

11:30 - 12:00  Coffee

12:00 - 12:30  Index Coding Algorithms for Constructing Network Codes   Slides
               Salim El Rouayheb, IIT

12:30 -  1:00  Towards an Algebraic Network Information Theory   Slides   Video
               Bobak Nazer, BU

 1:00 -  2:30  Lunch + poster session

Recent Results 2 - chair: Raymond Yeung

 2:30 -  3:00  Storage-Optimized Data-Atomic Algorithms for Handling Erasures
               and Errors in Distributed Storage Systems
	       Prakash Narayana Moorthy, MIT

 3:00 -  3:30  Analyzing Large Communication Networks   Slides   Video
               Shirin Jalali, Bell Labs 

 3:30 -  4:00  Delay-Constrained Unicast: Improved Upper Bounds    Slides   Video
               Sudeep Kamath, Princeton

 4:00 -  4:30  Coffee

 4:30 -  5:00  Coded MapReduce    Slides   Video
               Mohammad Ali Maddah-Ali, Bell Labs 

 5:00 -  5:30  On the Relation Between Edge Removal and Strong Converses
	       Joerg Kliewer, NJIT

Accepted Posters:

Broadcast Packet Erasure Channels (BPEC) With Feedback and Memory
Shirin Bidokhti, Stanford University
Clustering by Information Flow
Chung Chan, Chinese University of Hong Kong
Improved Lower Bounds for Coded Caching
Houshang Ghasemi, Iowa State University
Cooperative Data Exchange With Adversarial Clients
Anoosheh Heidarzadeh, Texas A&M University
Universal Outer Codes for Block Secrecy
Swanand Kadhe, Texas A&M University
On the Capacity Region for Network Coding With Dependent Sources
Woong Kim, University at Buffalo
Network-Coded Multiple Access
Lu Lu, Chinese University of Hong Kong
Lattice Network Codes over the E8 Lattice
Kenneth Shum, Chinese University of Hong Kong
On Base Field of Linear Network Coding
Tyler Sun, Chinese University of Hong Kong
Sum-Networks from Graphs and Designs
Ardhendu Tripathy, Iowa State University
NFV for Network Coding: Placing Virtual Coding Functions on the Internet
Linquan Zhang, University of Calgary
Timeliness in Lossless Block Coding
Jing Zhong, Rutgers University