3,084 research outputs found
Minimum-cost multicast over coded packet networks
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 the contents of received packets. We consider both wireline and wireless packet networks as well as both static multicast (where membership of the multicast group remains constant for the duration of the connection) and dynamic multicast (where membership of the multicast group changes in time, with nodes joining and leaving the group). For static multicast, we reduce the problem to a polynomial-time solvable optimization problem, and we present decentralized algorithms for solving it. These algorithms, when coupled with existing decentralized schemes for constructing network codes, yield a fully decentralized approach for achieving minimum-cost multicast. By contrast, establishing minimum-cost static multicast connections over routed packet networks is a very difficult problem even using centralized computation, except in the special cases of unicast and broadcast connections. For dynamic multicast, we reduce the problem to a dynamic programming problem and apply the theory of dynamic programming to suggest how it may be solved
An Efficient Network Coding based Retransmission Algorithm for Wireless Multicasts
Retransmission based on packet acknowledgement (ACK/NAK) is a fundamental
error control technique employed in IEEE 802.11-2007 unicast network. However
the 802.11-2007 standard falls short of proposing a reliable MAC-level recovery
protocol for multicast frames. In this paper we propose a latency and bandwidth
efficient coding algorithm based on the principles of network coding for
retransmitting lost packets in a singlehop wireless multicast network and
demonstrate its effectiveness over previously proposed network coding based
retransmission algorithms.Comment: 5 pages, 5 figure
A Network Coding Approach to Loss Tomography
Network tomography aims at inferring internal network characteristics based
on measurements at the edge of the network. In loss tomography, in particular,
the characteristic of interest is the loss rate of individual links and
multicast and/or unicast end-to-end probes are typically used. Independently,
recent advances in network coding have shown that there are advantages from
allowing intermediate nodes to process and combine, in addition to just
forward, packets. In this paper, we study the problem of loss tomography in
networks with network coding capabilities. We design a framework for estimating
link loss rates, which leverages network coding capabilities, and we show that
it improves several aspects of tomography including the identifiability of
links, the trade-off between estimation accuracy and bandwidth efficiency, and
the complexity of probe path selection. We discuss the cases of inferring link
loss rates in a tree topology and in a general topology. In the latter case,
the benefits of our approach are even more pronounced compared to standard
techniques, but we also face novel challenges, such as dealing with cycles and
multiple paths between sources and receivers. Overall, this work makes the
connection between active network tomography and network coding
Heuristics for Network Coding in Wireless Networks
Multicast is a central challenge for emerging multi-hop wireless
architectures such as wireless mesh networks, because of its substantial cost
in terms of bandwidth. In this report, we study one specific case of multicast:
broadcasting, sending data from one source to all nodes, in a multi-hop
wireless network. The broadcast we focus on is based on network coding, a
promising avenue for reducing cost; previous work of ours showed that the
performance of network coding with simple heuristics is asymptotically optimal:
each transmission is beneficial to nearly every receiver. This is for
homogenous and large networks of the plan. But for small, sparse or for
inhomogeneous networks, some additional heuristics are required. This report
proposes such additional new heuristics (for selecting rates) for broadcasting
with network coding. Our heuristics are intended to use only simple local
topology information. We detail the logic of the heuristics, and with
experimental results, we illustrate the behavior of the heuristics, and
demonstrate their excellent performance
Wireless Broadcast with Network Coding in Mobile Ad-Hoc Networks: DRAGONCAST
Network coding is a recently proposed method for transmitting data, which has
been shown to have potential to improve wireless network performance. We study
network coding for one specific case of multicast, broadcasting, from one
source to all nodes of the network. We use network coding as a loss tolerant,
energy-efficient, method for broadcast. Our emphasis is on mobile networks. Our
contribution is the proposal of DRAGONCAST, a protocol to perform network
coding in such a dynamically evolving environment. It is based on three
building blocks: a method to permit real-time decoding of network coding, a
method to adjust the network coding transmission rates, and a method for
ensuring the termination of the broadcast. The performance and behavior of the
method are explored experimentally by simulations; they illustrate the
excellent performance of the protocol
- …