On Secure Network Coding Over Networks With Unequal Link Capacities (2009)
Cui, Tao, Ho, Tracey, Kliewer, Joerg
This paper considers secure network coding over networks with unequal link capacities in the presence of a wiretapper that can wiretap any subset of k links. Existing results show that for the case...
On the Delay of Network Coding over Line Networks (2009)
Dikaliotis, Theodoros K., Dimakis, Alexandros G., Ho, Tracey, Effros, Michelle
We analyze a simple network where a source and a receiver are connected by a line of erasure channels of different reliabilities. Recent prior work has shown that random linear network coding can...
Searching for Minimum Storage Regenerating Codes (2009)
Cullina, Daniel, Dimakis, Alexandros G., Ho, Tracey
Regenerating codes allow distributed storage systems to recover from the loss of a storage node while transmitting the minimum possible amount of data across the network. We present a systematic...
Memoryless relay strategies for two-way relay channels (2009)
Cui, Tao, Ho, Tracey, Kliewer, Jörg
We propose relaying strategies for uncoded two-way relay channels, where two terminals transmit simultaneously to each other with the help of a relay. In particular, we consider a memoryless system,...
Minimum-Cost Multicast Over Coded Packet Networks (2009)
Desmond S. Lun, Student Member, Niranjan Ratnakar, Student Member, Muriel Médard, Senior Member, ...
Abstract—We consider the problem of establishing minimum-cost multicast connections over coded packet networks, i.e., packet networks where the contents of outgoing packets are arbitrary, causal...
Congestion Control for Multicast Flows with Network Coding (2009)
Lijun Chen, Tracey Ho, Mung Chiang, Steven H. Low, John C. Doyle
Abstract — Recent advances in network coding have shown great potential for efficient information multicasting in communication networks, in terms of both network throughput and network management....
Cui, Tao, Ho, Tracey, Kliewer, Joerg
We analyze the achievable rate in interference-free wireless networks with physical layer fading channels and orthogonal multiple access. As a starting point, the point-to-point channel is...
Some Results on Relay Strategies for Memoryless Two-Way Relay Channels (2009)
Abstract — We consider relaying strategies for memoryless two-way relay channels, where the signal transmitted by a relay depends only on its previously received signal. For binary antipodal...
OPTIMAL STRATEGIES FOR EFFICIENT PEER-TO-PEER FILE SHARING (2009)
Mortada Mehyar, Weihsin Gu, Steven H. Low, Michelle Effros, Tracey Ho
We study a model for peer-to-peer �le sharing. The goal is to distribute a �le from a server to multiple peers. We assume the upload capacity of each peer is the only bottleneck. We examine the...
Dynamic algorithms for multicast with intra-session network coding (2009)
The problem of multiple multicast sessions with intra-session network coding in time-varying networks is considered. The network-layer capacity region of input rates that can be stably supported is...
Distributed space-time coding for two-way wireless relay networks (2009)
Cui, Tao, Gao, Feifei, Ho, Tracey, Nallanathan, Arumugam
In this paper, we consider distributed space-time coding for two-way wireless relay networks, where communication between two terminals is assisted by relay nodes. Relaying protocols using two,...
Comparison of Network Coding and Non-Network Coding Schemes for Multi-hop Wireless Networks (2008)
Abstract — Network coding has been shown to be useful for throughput and reliability in various network topologies, under a fixed-rate, point-to-multipoint wireless network model. We study the...
Opportunistic Source Coding for Data Gathering in Wireless Sensor Networks (2008)
Tao Cui, Lijun Chen, Tracey Ho, Steven H. Low
Abstract—We propose a jointly opportunistic source coding and opportunistic routing (OSCOR) protocol for correlated data gathering in wireless sensor networks. OSCOR improves data gathering...
Opportunistic Source Coding for Data Gathering in Wireless Sensor Networks (2008)
Tao Cui, Lijun Chen, Tracey Ho, Steven H. Low
Abstract—We propose a jointly opportunistic source coding and opportunistic routing (OSCOR) protocol for correlated data gathering in wireless sensor networks. OSCOR improves data gathering...
Network With Costs: Timing and Flow Decomposition (2008)
Shreeshankar Bodas, Jared Grubb, Sriram Sridharan, Tracey Ho, Sriram Vishwanath
Abstract — This paper analyzes a capacitated network with costs from an information theoretic point of view. Specifically, it accomplishes the following for a series-parallel single...
On Source Coding with Coded Side Information for a Binary Source with Binary Side Information (2008)
Gu, WeiHsin, Koetter, Ralf, Effros, Michelle, Ho, Tracey
The lossless rate region for the coded side information problem is "solved," but its solution is expressed in terms of an auxiliary random variable. As a result, finding the rate region for any fixed...
Resilient Network Coding in the Presence of Byzantine Adversaries (2008)
Jaggi, Sidharth, Langberg, Michael, Katti, Sachin, Ho, Tracey, Katabi, Dina, Médard, Muriel, ...
Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a malicious node can end up...
Byzantine Modification Detection in Multicast Networks With Random Network Coding (2008)
Ho, Tracey, Leong, Ben, Koetter, Ralf, Médard, Muriel, Effros, Michelle, Karger, David R.
An information-theoretic approach for detecting Byzantine or adversarial modifications in networks employing random linear network coding is described. Each exogenous source packet is augmented with...
Tracey Ho, Muriel Médard, Ralf Koetter, David R. Karger, Michelle Effros, Jun Shi, ...
random linear network coding approach to multicast
1 Byzantine Modification Detection in Multicast Networks using Randomized Network Coding (2007)
Tracey Ho, Ben Leong, Ralf Koetter, Muriel M Edard, Michelle Effros, David R. Karger
Abstract--- Distributed randomized network coding is a flexible and robust approach to transmitting and compressing information in multi-source multicast networks. In this paper, we show how the path...
e-marl: {trace, medard}mit.edu (2007)
Tracey Ho, Muriel Mdard, Ralf Koetter
A coding view of network recovery and management
All Learning is Local: Multi-agent learning in global reward games (2007)
Yu-han Chang, Tracey Ho, Leslie Pack Kaelbling
In large multiagent games, partial observability, coordination, and credit assignment persistently plague attempts to design good learning algorithms.
Optimal Strategies for Efficient Peer-to-Peer File Sharing (2007)
Mehyar, Mortada, Gu, WeiHsin, Low, Steven H., Effros, Michelle, Ho, Tracey
We study a model for peer-to-peer file sharing. The goal is to distribute a file from a server to multiple peers. We assume the upload capacity of each peer is the only bottleneck. We examine the...
Distributed Optimization in Wireless Networks Using Broadcast Advantage (2007)
Cui, Tao, Chen, Lijun, Ho, Tracey
In this paper, we study cross-layer design for multicasting in wireless networks by exploiting broadcast advantage. With network coding, a distributed subgradient algorithm for joint congestion...
Opportunistic source coding for data gathering in wireless sensor networks (2007)
Cui, Tao, Chen, Lijun, Ho, Tracey, Low, Steven H., Andrew, Lachlan L. H.
We propose a jointly opportunistic source coding and opportunistic routing (OSCOR) protocol for correlated data gathering in wireless sensor networks. OSCOR improves data gathering efficiency by...
On distributed distortion optimization for correlated sources (2007)
Tao Cui, Tracey Ho, Lijun Chen
Abstract — We consider lossy data compression in capacityconstrained networks with correlated sources. We develop, using dual decomposition, a distributed algorithm that maximizes an aggregate...
Optimization based rate control for multicast with network coding (2007)
Lijun Chen, Tracey Ho, Steven H. Low, Mung Chiang, John C. Doyle
Abstract — Recent advances in network coding have shown great potential for efficient information multicasting in communication networks, in terms of both network throughput and network management....
Rate control for multicast with network coding (2007)
Lijun Chen, Tracey Ho, Steven H. Low, Mung Chiang, John C. Doyle
Abstract — Recent advances in network coding have shown great potential for efficient information multicasting in communication networks, in terms of both network throughput and network management....
Opportunistic source coding for data gathering in wireless sensor networks (2007)
Cui, Tao, Chen, Lijun, Ho, Tracey, Low, Steven H., Andrew, Lachlan L. H.
We propose a jointly opportunistic source coding and opportunistic routing (OSCOR) protocol for correlated data gathering in wireless sensor networks. OSCOR improves data gathering efficiency by...
A Random Linear Network Coding Approach to Multicast (2006)
Ho, Tracey, Médard, Muriel, Koetter, Ralf, Karger, David R., Effros, Michelle, Shi, Jun, ...
We present a distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks. Network nodes independently and randomly...
Rate Control for Multicast with Network Coding (2006)
Chen, Lijun, Ho, Tracey, Low, Steven, Chiang, Mung, Doyle, John
Recent advances in network coding have shown great potential for efficient information multicasting in communication networks, in terms of both network throughput and network management. In this...
A tiling approach to network code design for wireless networks (2006)
Effros, Michelle, Ho, Tracey, Kim, Sukwon
We describe a new tiling approach for network code design. The proposed method applies dynamic programming to find the best strategy among a restricted collection of network codes. We demonstrate the...
Minimum-cost multicast over coded packet networks (2006)
Lun, Desmond S., Ratnakar, Niranjan, Médard, Muriel, Koetter, Ralf, Karger, David R., Ho, Tracey, ...
We consider the problem of establishing minimum-cost multicast connections over coded packet networks, i.e., packet networks where the contents of outgoing packets are arbitrary, causal functions of...
Polynomial-time algorithms for coding across multiple unicasts (2006)
We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network codes within the class...
On Separation, Randomness and Linearity for Network Codes over Finite Fields (2006)
Ray, Siddharth, Effros, Michelle, Medard, Muriel, Koetter, Ralf, Ho, Tracey, Karger, David, ...
We examine the issue of separation and code design for networks that operate over finite fields. We demonstrate that source-channel (or source-network) separation holds for several canonical network...
Minimum-cost multicast over coded packet networks (2006)
Desmond S. Lun, Niranjan Ratnakar, Muriel Médard, Ralf Koetter, David R. Karger, Tracey Ho, ...
We consider the problem of establishing minimum-cost multicast connections over coded packet networks, i.e. packet networks where the contents of outgoing packets are arbitrary, causal functions of...
A random linear network coding approach to multicast (2006)
Tracey Ho, Muriel Médard, Ralf Koetter, David R. Karger, Associate Member, Michelle Effros, ...
Abstract—We present a distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks. Network nodes independently and...
Correction of adversarial errors in networks (2005)
Jaggi, Siddarth, Langberg, Michael, Ho, Tracey, Effros, Michelle
We design codes to transmit information over a network, some subset of which is controlled by a malicious adversary. The computationally unbounded, hidden adversary knows the message to be...
Network monitoring in multicast networks using network coding (2005)
Ho, Tracey, Leong, Ben, Chang, Yu-Han, Wen, Yonggang, Koetter, Ralf
In this paper we show how information contained in robust network codes can be used for passive inference of possible locations of link failures or losses in a network. For distributed randomized...
On the utility of network coding in dynamic environments (2005)
Ho, Tracey, Leong, Ben, Médard, Muriel, Koetter, Ralf, Chang, Yu-Han, Effros, Michelle
Many wireless applications, such as ad-hoc networks and sensor networks, require decentralized operation in dynamically varying environments. We consider a distributed randomized network coding...
An information-theoretic view of network management (2005)
Ho, Tracey, Médard, Muriel, Koetter, Ralf
We present an information-theoretic framework for network management for recovery from nonergodic link failures. Building on recent work in the field of network coding, we describe the input-output...
Minimum-Cost Multicast over Coded Packet Networks (2005)
Lun, Desmond S., Ratnakar, Niranjan, Medard, Muriel, Koetter, Ralf, Karger, David R., Ho, Tracey, ...
We consider the problem of establishing minimum-cost multicast connections over coded packet networks, i.e. packet networks where the contents of outgoing packets are arbitrary, causal functions of...
Byzantine modification detection in multicast networks using randomized network coding (2005)
Ho, Tracey, Leong, Ben, Koetter, Ralf, Médard, Muriel, Effros, Michelle, Karger, David R.
Distributed randomized network coding, a robust approach to multicasting in distributed network settings, can be extended to provide Byzantine modification detection without the use of cryptographic...
Network monitoring in multicast networks using network coding (2005)
Abstract — In this paper we show how information contained in robust network codes can be used for passive inference of possible locations of link failures or losses in a network. For distributed...
Network monitoring in multicast networks using network coding (2005)
Abstract — In this paper we show how information contained in robust network codes can be used for passive inference of possible locations of link failures or losses in a network. For distributed...
An Information-Theoretic View of Network Management (2005)
Tracey Ho, Muriel Médard, Senior Member, Ralf Koetter
Abstract—We present an information-theoretic framework for network management for recovery from nonergodic link failures. Building on recent work in the field of network coding, we describe the...
Dynamic algorithms for multicast with intra-session network coding (2005)
We establish, for multiple multicast sessions with intra-session network coding, the capacity region of input rates for which the network remains stable in ergodically time-varying networks. Building...
Network coding for wireless applications: A brief tutorial (2005)
Supratim Deb, Michelle Effros, Tracey Ho, David R. Karger, Ralf Koetter, Desmond S. Lun, ...
Abstract — The advent of network coding promises to change many aspects of networking. Network coding moves away from the classical approach of networking, which treats networks as akin to physical...
Dynamic algorithms for multicast with intra-session network coding (2005)
The problem of multiple multicast sessions with intra-session network coding in ergodically time-varying networks is considered. The capacity region of input rates that can be stably supported is...
Correction of adversarial errors in networks (2005)
Sidharth Jaggi, Michael Langberg, Tracey Ho, Michelle Effros
Abstract — We design codes to transmit information over a network, some subset of which is controlled by a malicious adversary. The computationally unbounded, hidden adversary knows the message to...
Dynamic algorithms for multicast with intra-session network coding (2005)
The problem of multiple multicast sessions with intra-session network coding in time-varying networks is considered. The network-layer capacity region of input rates that can be stably supported is...
On the utility of network coding in dynamic environments (2004)
Tracey Ho, Ben Leong, Muriel Médard, Ralf Koetter, Yu-han Chang, Michelle Effros
Abstract — Many wireless applications, such as ad-hoc networks and sensor networks, require decentralized operation in dynamically varying environments. We consider a distributed randomized network...
Byzantine modification detection in multicast networks using randomized network coding (2004)
Tracey Ho, Ben Leong, Ralf Koetter, Muriel Médard, Michelle Effros, David R. Karger
Abstract — We show how distributed randomized network coding, a robust approach to multicasting in distributed network settings, can be extended to provide Byzantine modification detection without...
Byzantine modification detection in multicast networks using randomized network coding (2004)
Tracey Ho, Ben Leong, Ralf Koetter, Muriel Médard, Michelle Effros, David R. Karger
This paper gives an information theoretic approach for detecting Byzantine modifications in networks employing random linear network coding. Each exogenous source packet is augmented with a flexible...
Network Coding for Correlated Sources (2004)
Tracey Ho, Muriel Médard, Michelle Effros, Ralf Koetter
Abstract — We consider the ability of a distributed randomized network coding approach to multicast, to one or more receivers, correlated sources over a network where compression may be required....
Network Coding with a Cost Criterion (2004)
Desmond S. Lun, Muriel Médard, Tracey Ho, Ralf Koetter
We consider applying network coding in settings where there is a cost associated with network use.
Network Coding with a Cost Criterion (2004)
Desmond S. Lun, Muriel Médard, Tracey Ho, Ralf Koetter
We consider applying network coding in settings where there is a cost associated with network use. We show that, while minimum-cost multicast problems without network coding are very di#cult except...
Osium On Information, Desmond S. Lun, Tracey Ho, Ralf Koetter
We consider applying network coding in settings where there is a cost associated with network use. We show that, while minimum-cost multicast problems without network coding are very di#cult except...
Byzantine Modification Detection in Multicast Networks using Randomized Network Coding (2004)
Tracey Ho, Ben Leong, Ralf Koetter, Muriel Medard, Michelle Effros, David R. Karger
We show how distributed randomized network coding, a robust approach to multicasting in distributed network settings, can be extended to provide Byzantine modification detection without the use of...
Network Coding with a Cost Criterion (2004)
Desmond S. Lun, Tracey Ho, Ralf Koetter
We consider applying network coding in settings where there is a cost associated with network use. We show that, while minimum-cost multicast problems without network coding are very difficult except...
Toward a random operation of networks (2004)
Tracey Ho, Muriel Médard, Ralf Koetter, David R. Karger, Michelle Effros, Jun Shi, ...
We present a distributed randomized network coding approach for transmission and compression of information in general multi-source multicast networks. Network nodes independently and randomly select...
Mobilized ad-hoc networks: A reinforcement learning approach (2004)
Yu-han Chang, Tracey Ho, Leslie Pack Kaelbling
Research in mobile ad-hoc networks has focused on situations in which nodes have no control over their movements. We investigate an important but overlooked domain in which nodes do have control over...
All learning is local: Multi-agent learning in global reward games (2003)
Chang, Yu-Han, Ho, Tracey, Kaelbling, Leslie P.
In large multiagent games, partial observability, coordination, and credit assignment persistently plague attempts to design good learning algorithms. We provide a simple and efficient algorithm that...
All learning is local: Multi-agent learning in global reward games (2003)
Chang, Yu-Han, Ho, Tracey, Kaelbling, Leslie P.
In large multiagent games, partial observability, coordination, and credit assignment persistently plague attempts to design good learning algorithms. We provide a simple and efficient algorithm that...
Mobilized ad-hoc networks: A reinforcement learning approach (2003)
Chang, Yu-Han, Ho, Tracey, Kaelbling, Leslie Pack
Research in mobile ad-hoc networks has focused on situations in which nodes have no control over their movements. We investigate an important but overlooked domain in which nodes do have control over...
Mobilized ad-hoc networks: A reinforcement learning approach (2003)
Chang, Yu-Han, Ho, Tracey, Kaelbling, Leslie Pack
Research in mobile ad-hoc networks has focused on situations in whichnodes have no control over their movements. We investigate animportant but overlooked domain in which nodes do have controlover...
Mobilized ad-hoc networks: A reinforcement learning approach (2003)
Chang, Yu-Han, Ho, Tracey, Kaelbling, Leslie Pack
Research in mobile ad-hoc networks has focused on situations in whichnodes have no control over their movements. We investigate animportant but overlooked domain in which nodes do have controlover...
Mobilized ad-hoc networks: A reinforcement learning approach (2003)
Chang, Yu-Han, Ho, Tracey, Kaelbling, Leslie Pack
Research in mobile ad-hoc networks has focused on situations in which nodes have no control over their movements. We investigate an important but overlooked domain in which nodes do have control over...
The benefits of coding over routing in a randomized setting (2003)
Ho, Tracey, Koetter, Ralf, Médard, Muriel, Karger, David R., Effros, Michelle
A novel randomized network coding approach for robust, distributed transmission and compression of information in networks is presented, and its advantages over routing-based approaches is...
Network Coding from a Network Flow Perspective (2003)
Tracey Ho, David R. Karger, Muriel Médard, Ralf Koetter
Abstract — We make precise connections between algebraic network coding and network flows. Our combinatorial formulations offer new insights, mathematical simplicity, and lead to a substantially...
The benefits of coding over routing in a randomized setting (2003)
Tracey Ho, Ralf Koetter, Muriel Médard, David R. Karger, Michelle Effros
Abstract — We present a novel randomized coding approach for robust, distributed transmission and compression of information in networks. We give a lower bound on the success probability of a...
The benefits of coding over routing in a randomized setting (2003)
Tracey Ho, Ralf Koetter, Muriel Médard, David R. Karger, Michelle Effros
Abstract — We present a novel randomized coding approach for robust, distributed transmission and compression of information in networks. We give a lower bound on the success probability of a...
An Information Theoretic View of Network Management (2003)
Tracey Ho, Muriel Médard, Ralf Koetter
We present an information theoretic framework for network management for recovery from non-ergodic link failures. Building on recent work in the field of network coding, we describe the input-output...
Linear Network Codes: A Unified Framework for Source, Channel, and Network Coding (2003)
Michelle Effros, Muriel Medard, Tracey Ho, Siddharth Ray, David Karger, Ralf Koetter, ...
We examine the issue of separation and code design for network data transmission environments. We demonstrate that source-channel separation holds for several canonical network channel models when...
An Information Theoretic View of Network Management (2003)
Tracey Ho, Muriel Médard, Ralf Koetter
We present an information theoretic framework for network management for recovery from non-ergodic link failures. Building on recent work in the field of network coding, we describe the input-output...
Network Coding from a Network Flow Perspective (2003)
Tracey Ho, David R. Karger, Muriel Medard, Ralf Koetter
The algebraic framework introduced in [4] gives an algebraic condition for the feasibility of a set of multicast connections in a network, that is equivalent to the max-flow min-cut condition of [1]....
On Randomized Network Coding (2003)
Tracey Ho, Muriel Medard, Jun Shi, Michelle Effros, David R. Karger
We consider a randomized network coding approach for multicasting from several sources over a network, in which nodes independently and randomly select linear mappings from inputs onto output links...
On Coding for Non-Multicast Networks (2003)
Muriel Medard, Michelle Effros, David Karger, Tracey Ho
We consider the issue of coding for non-multicast networks. For multicast networks, it is known that linear operations over a field no larger than the number of receivers are su#cient to achieve all...
On randomized network coding (2003)
Tracey Ho, Muriel Médard, Jun Shi, Michelle Effros, David R. Karger
We consider a randomized network coding approach for multicasting from several sources over a network, in which nodes independently and randomly select linear mappings from inputs onto output links...
All Learning is Local: Multi-agent learning in global reward games (2003)
Yu-han Chang, Tracey Ho, Leslie Pack Kaelbling
In large multiagent games, partial observability, coordination, and credit assignment persistently plague attempts to design good learning algorithms.
The Benefits of Coding over Routing in a Randomized Setting (2003)
Tracey Ho, Ralf Koetter, Muriel Medard, David R. Karger, Michelle Effros
We present a novel randomized network coding approach for robust, distributed transmission and compression of information in networks, and demonstrate its advantages over routing-based approaches.
1 Introduction Summary of Raptor Codes (2003)
This summary gives an overview of Raptor Codes, the latest class of codes