1)Effect of Network Coding in Graphs Undirecting the edges is roughly as strong as allowing network coding simplicity is the main benefit 2)Effect of Network.

Slides:



Advertisements
Similar presentations
Iterative Rounding and Iterative Relaxation
Advertisements

The Primal-Dual Method: Steiner Forest TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A AA A A A AA A A.
Network Design with Degree Constraints Guy Kortsarz Joint work with Rohit Khandekar and Zeev Nutov.
Derives the optimal achievable rate for MISO secondary users under coexistence constraints Proposes practical strategy for cognition and cooperation in.
VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
1 Index Coding Part II of tutorial NetCod 2013 Michael Langberg Open University of Israel Caltech (sabbatical)
Relaying in networks with multiple sources has new aspects: 1. Relaying messages to one destination increases interference to others 2. Relays can jointly.
Multicut Lower Bounds via Network Coding Anna Blasiak Cornell University.
The number of edge-disjoint transitive triples in a tournament.
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design Problems Mohammad R. Salavatipour Department of Computing Science University of Alberta.
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
A general approximation technique for constrained forest problems Michael X. Goemans & David P. Williamson Presented by: Yonatan Elhanani & Yuval Cohen.
1 Simple Network Codes for Instantaneous Recovery from Edge Failures in Unicast Connections Salim Yaacoub El Rouayheb, Alex Sprintson Costas Georghiades.
Network Coding and Reliable Communications Group Algebraic Network Coding Approach to Deterministic Wireless Relay Networks MinJi Kim, Muriel Médard.
1 Brief Announcement: Distributed Broadcasting and Mapping Protocols in Directed Anonymous Networks Michael Langberg: Open University of Israel Moshe Schwartz:
A Graph-based Framework for Transmission of Correlated Sources over Multiuser Channels Suhan Choi May 2006.
Steiner trees Algorithms and Networks. Steiner Trees2 Today Steiner trees: what and why? NP-completeness Approximation algorithms Preprocessing.
1 Nick Harvey (MIT) Kamal Jain (MSR) Lap Chi Lau (U. Toronto) Chandra Nair (MSR) Yunnan Wu (MSR) Conservative Network Coding.
Packing Element-Disjoint Steiner Trees Mohammad R. Salavatipour Department of Computing Science University of Alberta Joint with Joseph Cheriyan Department.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
Networking Seminar Network Information Flow R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung. Network Information Flow. IEEE Transactions on Information.
Multiple-access Communication in Networks A Geometric View W. Chen & S. Meyn Dept ECE & CSL University of Illinois.
ICALP'05Stochastic Steiner without a Root1 Stochastic Steiner Trees without a Root Martin Pál Joint work with Anupam Gupta.
V. V. Vazirani. Approximation Algorithms Chapters 3 & 22
Algorithms for Provisioning Virtual Private Networks in the Hose Model Source: Sigcomm 2001, to appear in IEEE/ACM Transactions on Networking Author: Amit.
When rate of interferer’s codebook small Does not place burden for destination to decode interference When rate of interferer’s codebook large Treating.
All that remains is to connect the edges in the variable-setters to the appropriate clause-checkers in the way that we require. This is done by the convey.
NETWORK CODING. Routing is concerned with establishing end to end paths between sources and sinks of information. In existing networks each node in a.
Copyright © Cengage Learning. All rights reserved. CHAPTER 10 GRAPHS AND TREES.
Approximation Algorithms Department of Mathematics and Computer Science Drexel University.
Distributed Algorithms Rajmohan Rajaraman Northeastern University, Boston May 2012 Chennai Network Optimization WorkshopDistributed Algorithms1.
1 The edge removal problem Michael Langberg SUNY Buffalo Michelle Effros Caltech.
1 Network Coding and its Applications in Communication Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.
User Cooperation via Rateless Coding Mahyar Shirvanimoghaddam, Yonghui Li, and Branka Vucetic The University of Sydney, Australia IEEE GLOBECOM 2012 &
Threshold Phenomena and Fountain Codes Amin Shokrollahi EPFL Joint work with M. Luby, R. Karp, O. Etesami.
Patrolling Games Katerina Papadaki London School of Economics with Alec Morton and Steven Alpern.
1 Multicasting in a Class of Multicast-Capable WDM Networks From: Y. Wang and Y. Yang, Journal of Lightwave Technology, vol. 20, No. 3, Mar From:
Novel network coding strategy for TDD Use of feedback (ACK) improves delay/energy/ throughput performance, especially for high latency- high errors scenarios.
Some Networking Aspects of Multiple Access Muriel Medard EECS MIT.
Superposition encoding A distorted version of is is encoded into the inner codebook Receiver 2 decodes using received signal and its side information Decoding.
Local Phy + Global Routing: A Fundamental Layering Principle for Wireless Networks Pramod Viswanath, University of Illinois July, 2011.
Embeddings, flow, and cuts: an introduction University of Washington James R. Lee.
1 The Encoding Complexity of Network Coding Michael Langberg California Institute of Technology Joint work with Jehoshua Bruck and Alex Sprintson.
We aim to exploit cognition to maximize network performance What is the side information at a cognitive node? What is the best encoding scheme given this.
The High, the Low and the Ugly Muriel Médard. Collaborators Nadia Fawaz, Andrea Goldsmith, Minji Kim, Ivana Maric 2.
New algorithms for Disjoint Paths and Routing Problems
The full Steiner tree problem Theoretical Computer Science 306 (2003) C. L. Lu, C. Y. Tang, R. C. T. Lee Reporter: Cheng-Chung Li 2004/06/28.
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrusts 0 and 1 Metrics and Upper Bounds Muriel Medard, Michelle Effros and.
Multicast Scaling Laws with Hierarchical Cooperation Chenhui Hu, Xinbing Wang, Ding Nie, Jun Zhao Shanghai Jiao Tong University, China.
Raptor Codes Amin Shokrollahi EPFL. BEC(p 1 ) BEC(p 2 ) BEC(p 3 ) BEC(p 4 ) BEC(p 5 ) BEC(p 6 ) Communication on Multiple Unknown Channels.
Key insight.  With drop-when-decoded, the busy period of the virtual queue contributes to the physical queue size calculation  Responding to ACK of the.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Collision Helps! Algebraic Collision Recovery for Wireless Erasure Networks.
1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
Introduction to Multiple-multicast Routing Chu-Fu Wang.
Introduction Wireless Ad-Hoc Network  Set of transceivers communicating by radio.
1 Chapter 5 Branch-and-bound Framework and Its Applications.
Impact of Interference on Multi-hop Wireless Network Performance
Graphs: Definitions and Basic Properties
Network Coding Beyond Network Coding
Polynomial integrality gaps for
T.W. Scholten, C. de Persis, P. Tesi
ACHIEVEMENT DESCRIPTION
Ivana Marić, Ron Dabora and Andrea Goldsmith
Resource Allocation in Non-fading and Fading Multiple Access Channel
Algorithms for Routing Node-Disjoint Paths in Grids
Pradeep Kyasanur Nitin H. Vaidya Presented by Chen, Chun-cheng
Network Coding Rates and Edge-Cut Bounds
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Collision Helps! Algebraic Collision Recovery for Wireless Erasure Networks.
Towards characterizing the capacity of the building block of MANETs
Presentation transcript:

1)Effect of Network Coding in Graphs Undirecting the edges is roughly as strong as allowing network coding simplicity is the main benefit 2)Effect of Network Coding in Wireless Networks Mainly From: Erasures (unlimited) Interference (unlimited) Duplex constraints On the Multiple Unicast Network Conjecture – Langberg, Medard Existing approaches: the crux of previous proofs include a reduction in which the multicast instance undergoes several splitting modifications, until it is turned into an instance of a broadcast problem Our approach: we consider a flow- based approach and we consider k-multicast coding rate on one hand and k-unicast routing rate on the other Towards characterizing the fundamental contributions of coding over routing MAIN ACHIEVEMENT: We have shown that, in undirected graphs that are r -strongly connected, the use of network coding for k- multicast is comparable (within a factor of 3) to the routing rate of an arbitrary set of k unicast connections. HOW IT WORKS: Create flow of decomposition of the graph Complete them to multicast ASSUMPTIONS AND LIMITATIONS: Does not take into account the simplicity of coding over routing (see picture below) While wireless networks are undirected, interference and duplex constraints do not allow us to operate them as undirected graphs Capacity of general relay channel unknown For directed links, the gap between routing and coding is known to be arbitrarily large For undirected networks, the gap for broadcast and point-to-point is nil, the gap for multicast is bounded by 2 and the general case is not understood, although it has been conjectured there is no gap The question is thus – is most of the gain from network coding coming from the fact that it allows quasi undirected operation? Taxonomy of Benefits of Network Coding: How much of the benefit is present in an undiredted setting and to what extent does traditional routing, by acting as a directed graph, negate the theoretical gap? IMPACT NEXT-PHASE GOALS ACHIEVEMENT DESCRIPTION STATUS QUO NEW INSIGHTS Example from Li, Li, Lau: With network coding: 2 symbols Without network coding: symbols This comes at a cost of optimizing over Steiner trees

The advantage of network coding It was shown that for unicast and broadcast there is no advantage in the use of network coding over traditional routing For the case of multicast, the coding advantage was shown to be at most 2, and this advantage may be at least 8/7 [Agarwal, Charikar 2004] Little is known regarding the coding advantage for the more general k-unicast setting To this day, the possibility that the advantage be unbounded (i.e., a function of the size of the network) has not been ruled out

The k-unicast network coding conjecture It has been conjectured by Li and Li that, for undirected graphs, there is no coding advantage at all This fact was verified on several special cases such as bipartite graphs and planar graphs Loosely speaking, the Li and Li conjecture states that an undirected graph allowing a k-unicast connection using network coding also allows the same connection using routing We address a relaxed version of this conjecture

k-unicast and k-multicast In the k-unicast problem, there are k sources, k terminals, and one is required to design an information flow allowing each source to transmit information to its corresponding terminal In the k-multicast problem, one is required to design an information flow allowing each source to transmit information to all the terminals Requiring that a network allows a k-multicast connection implies the corresponding k-unicast connection. We show that an undirected graph allowing a k-multicast connection at rate r using network coding will allow the corresponding k-unicast connection at rate r/3.

Interpretation in terms of undirecting graphs Given a directed graph G which allows k-multicast communication at rate r on k source/terminal pairs, by undirecting the edges of G one can obtain a feasible k- unicast routing solution of rate at least r/3 In the setting in which one is guaranteed k-multicast communication, but requires only k-unicast:undirecting the edges of G is as strong as allowing network coding (up to a factor of 3) Informally, undirecting the edges of G is as strong (within a small multiplicative factor) as allowing network coding

Need for new techniques The approach of Li and Li operates by reducing to the broadcast problem (in which the terminal set includes the entire vertex set of G) This reduction does not adapt to the k-multicast scenario addressed in this work because of the lack of a single source governing the multicast connection We adopt a multicommodity flow approach

Main lemma Proof outline:

Proof outline Proof outline continued

Conclusions This may have interesting consequences for wireless networks, since they are generally undirected While it may at first blush seem that our results imply a bound of a factor of 3 for the advantage of k-multicast coding versus k-unicast non-coding in wireless networks,such a conclusion would misinterpret our results –broadcast conditions –half-duplex constraints.