Distributed zero-error network coding Tracey Ho Michelle Effros Sidharth Jaggi.

Slides:

Advertisements

Similar presentations

Advertisements

Techniques to analyze workflows (design-time)

Intel Research Internet Coordinate Systems - 03/03/2004 Internet Coordinate Systems Marcelo Pias Intel Research Cambridge

Distributed Computing 1. Lower bound for leader election on a complete graph Shmuel Zaks ©

Routing in a Parallel Computer. A network of processors is represented by graph G=(V,E), where |V| = N. Each processor has unique ID between 1 and N.

1 Fault-Tolerant Computing Systems #6 Network Reliability Pattara Leelaprute Computer Engineering Department Kasetsart University

Multicut Lower Bounds via Network Coding Anna Blasiak Cornell University.

Los Angeles September 27, 2006 MOBICOM Localization in Sparse Networks using Sweeps D. K. Goldenberg P. Bihler M. Cao J. Fang B. D. O. Anderson.

DATA MINING LECTURE 12 Link Analysis Ranking Random walks.

Low Complexity Encoding for Network Codes Yuval Cassuto Michelle Effros Sidharth Jaggi.

1 Crosslayer Design for Distributed MAC and Network Coding in Wireless Ad Hoc Networks Yalin E. Sagduyu Anthony Ephremides University of Maryland at College.

1 Network Coding: Theory and Practice Apirath Limmanee Jacobs University.

Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)

FFT1 The Fast Fourier Transform. FFT2 Outline and Reading Polynomial Multiplication Problem Primitive Roots of Unity (§10.4.1) The Discrete Fourier Transform.

Fighting Byzantine Adversaries in Networks: Network Error-Correcting Codes Michelle Effros Michael Langberg Tracey Ho Sachin Katti Muriel Médard Dina Katabi.

Computability and Complexity 15-1 Computability and Complexity Andrei Bulatov NP-Completeness.

Jie Gao Joint work with Amitabh Basu*, Joseph Mitchell, Girishkumar Stony Brook Distributed Localization using Noisy Distance and Angle Information.

Resilient Network Coding in the presence of Byzantine Adversaries Michelle Effros Michael Langberg Tracey Ho Sachin Katti Muriel Médard Dina Katabi Sidharth.

Network Coding Theory: Consolidation and Extensions Raymond Yeung Joint work with Bob Li, Ning Cai and Zhen Zhan.

1 Methodological Basics. Layout and DesignKapitel 1 / 2 (c) Prof. Richard F. Hartl 1.1 Complexity  We solve problems in production and logistics by using:

Network Coding Project presentation Communication Theory 16:332:545 Amith Vikram Atin Kumar Jasvinder Singh Vinoo Ganesan.

Global topological properties of biological networks.

Chapter 9 Graph algorithms Lec 21 Dec 1, Sample Graph Problems Path problems. Connectedness problems. Spanning tree problems.

FIGHTING ADVERSARIES IN NETWORKS Michelle Effros Michael Langberg Tracey Ho Philip Chou Kamal Jain Muriel Médard Dina Katabi Peter Sanders Ludo Tolhuizen.

Deterministic Network Coding by Matrix Completion Nick Harvey David Karger Kazuo Murota.

Chapter 11 Algebraic Coding Theory. Single Error Detection M = (1, 1, …, 1) is the m  1 parity check matrix for single error detection. If c = (0, 1,

10th Canadian Workshop on Information Theory June 7, 2007 Rank-Metric Codes for Priority Encoding Transmission with Network Coding Danilo Silva and Frank.

Page 1 Page 1 Network Coding Theory: Tutorial Presented by Avishek Nag Networks Research Lab UC Davis.

Processing Along the Way: Forwarding vs. Coding Christina Fragouli Joint work with Emina Soljanin and Daniela Tuninetti.

Distributed Combinatorial Optimization

CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 21 Introduction to Computer Networks.

Optimal Multicast Algorithms Sidharth Jaggi Michelle Effros Philip A. Chou Kamal Jain.

Low Complexity Algebraic Multicast Network Codes Sidharth “Sid” Jaggi Philip Chou Kamal Jain.

Network Coding: Mixin’ it up Sidharth Jaggi Michelle Effros Michael Langberg Tracey Ho Philip Chou Kamal Jain Muriel MédardPeter Sanders Ludo Tolhuizen.

The Erdös-Rényi models

Unit 1 Test Review Answers

On coding for networks with errors Tracey Ho Caltech BIRS, August 2011.

Network Coding and Information Security Raymond W. Yeung The Chinese University of Hong Kong Joint work with Ning Cai, Xidian University.

NETWORK CODING. Routing is concerned with establishing end to end paths between sources and sinks of information. In existing networks each node in a.

Combinatorial Optimization Minimum Cuts in Undirected Graphs Global Minimum Cuts.

FFT1 The Fast Fourier Transform. FFT2 Outline and Reading Polynomial Multiplication Problem Primitive Roots of Unity (§10.4.1) The Discrete Fourier Transform.

Computer Science and Engineering Parallel and Distributed Processing CSE 8380 March 01, 2005 Session 14.

1 Network Coding and its Applications in Communication Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.

Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Chapter 5 Network Layer.

Loop and cut set Analysis

Resilient Network Coding in the Presence of Eavesdropping Byzantine Adversaries Michael Langberg Sidharth Jaggi Open University of Israel ISIT 2007 Tsinghua.

4: Network Layer4-1 Schedule Today: r Finish Ch3 r Collect 1 st Project r See projects run r Start Ch4 Soon: r HW5 due Monday r Last chance for Qs r First.

1 Network Coding and its Applications in Communication Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.

Handover and Tracking in a Camera Network Presented by Dima Gershovich.

Correction of Adversarial Errors in Networks Sidharth Jaggi Michael Langberg Tracey Ho Michelle Effros Submitted to ISIT 2005.

Some new(ish) results in network information theory Muriel Médard RLE EECS MIT Newton Institute Workshop January 2010.

DISTRIBUTED SYSTEMS II A POLYNOMIAL LOCAL SOLUTION TO MUTUAL EXCLUSION Prof Philippas Tsigas Distributed Computing and Systems Research Group.

Data Structures & Algorithms Graphs

Single-Factor Studies KNNL – Chapter 16. Single-Factor Models Independent Variable can be qualitative or quantitative If Quantitative, we typically assume.

CS223 Advanced Data Structures and Algorithms 1 Maximum Flow Neil Tang 3/30/2010.

1 The Encoding Complexity of Network Coding Michael Langberg California Institute of Technology Joint work with Jehoshua Bruck and Alex Sprintson.

1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.

Network RS Codes for Efﬁcient Network Adversary Localization Sidharth Jaggi Minghua Chen Hongyi Yao.

Minimizing Energy Expense for Chain-Based Data Gathering in Wireless Sensor Networks Li-Hsing Yen Chung Hua University Taiwan EWSN 05.

Exponential random graphs and dynamic graph algorithms David Eppstein Comp. Sci. Dept., UC Irvine.

Network Coding Tomography for Network Failures

Network Topology Single-level Diversity Coding System (DCS) An information source is encoded by a number of encoders. There are a number of decoders, each.

Algebra 1 Section 4.2 Graph linear equation using tables The solution to an equation in two variables is a set of ordered pairs that makes it true. Is.

Network Topology Deals with a circuit model called graph, which is a collection of line segments called branches and points called nodes Circuit diagram.

Distributed Network Codes

The Echo Algorithm The echo algorithm can be used to collect and disperse information in a distributed system It was originally designed for learning network.

Network Layer Goals: Overview:

Network Coding and its Applications in Communication Networks

Polynomial + Fast Fourier Transform

Vectors, Linear Combinations and Linear Independence

Presentation transcript:

Distributed zero-error network coding Tracey Ho Michelle Effros Sidharth Jaggi

s t1t1 t2t2 [ACLY00] [JCJ03], [SET03] No error Centralized design [HKMKE03], [JCJ03] Prob(error) ~2 -n€ Decentralized design No error Decentralized Design Complexity (Open CS problems) Decentralized zero-error

Convolutional network codes b1b1 b2b2 F 2 (z)-linear network [ACLY00],[KM02],… Source:- Generates a bit-stream Every node:- Perform linear combinations over field F 2 (z) …,[JHEM04],… Given an algebraic network code over field of size q, exists a convolutional network code with degree-log(q) polynomials degree-m polynomials 2 m =q

Decentralized Information about network structure/code percolates along network links zero-error No error! Guaranteeing linear independence of information in each cut-set… … is impossible! (Proof by example – exercise for audience) Need some global information about network.

Decentralized zero-error Each node has unique ID # i Toy example (C=2 (~[FS04])) 1.One linearly independent incoming vector Replicate on all outgoing links 2. Two linearly independent incoming vectors Maintain “MDS” property i

Decentralized zero-error Really cool! Lexicographic ordering (Cantor-diagonal assignment) m = polylog(i,j)

Decentralized zero-error General C, existence proof… Complete graph with |V| nodes and C links from v i to v j, for all (i,j) # subgraphs with mincut C ≤ # subgraphs = 2 C|V|(|V|-1) [KM02] Can design ONE network code which works for MANY networks… … Field size proportional to 2 C|V|(|V|-1) … m proportional to C|V|(|V|-1) (exponential increase, non-constructive :-/)

Decentralized zero-error General C, “construction” [HMSEK04] Network code works [KM02] “Line graph matrix” f(i,j) distinct for each (i,j) pair (Cantor-diagonal assignment) Each z term has distinct exponent Σ (i,j) in term 2 f(i,j) distinct in each term DOUBLE exponential field-size :-( Oh well… next paper… ;-)

Summary/Where now? C=2 toy example General C, exponentially larger fields required.  High computational complexity OR  High (double-exp) implementation complexity How much global info needed for tractable zero-error design?