Results 1  10
of
125,451
Network information flow
 IEEE TRANS. INFORM. THEORY
, 2000
"... We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a pointtopoint communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information source ..."
Abstract

Cited by 1967 (24 self)
 Add to MetaCart
We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a pointtopoint communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information
Wireless Network Information Flow: A Deterministic Approach
, 2009
"... In contrast to wireline networks, not much is known about the flow of information over wireless networks. The main barrier is the complexity of the signal interaction in wireless channels in addition to the noise in the channel. A widely accepted model is the the additive Gaussian channel model, and ..."
Abstract

Cited by 296 (42 self)
 Add to MetaCart
In contrast to wireline networks, not much is known about the flow of information over wireless networks. The main barrier is the complexity of the signal interaction in wireless channels in addition to the noise in the channel. A widely accepted model is the the additive Gaussian channel model
Wireless Network Information Flow
, 710
"... Abstract — We present an achievable rate for general deterministic relay networks, with broadcasting at the transmitters and interference at the receivers. In particular we show that if the optimizing distribution for the informationtheoretic cutset bound is a product distribution, then we have a ..."
Abstract

Cited by 55 (15 self)
 Add to MetaCart
Abstract — We present an achievable rate for general deterministic relay networks, with broadcasting at the transmitters and interference at the receivers. In particular we show that if the optimizing distribution for the informationtheoretic cutset bound is a product distribution, then we have a
Network Information Flow in Network of Queues
"... Abstract — Two classic categories of models exist for computer networks: network information flow and network of queues. The network information flow model appropriately captures the multihop flow routing nature in general network topologies, as well as encodable and replicable properties of inform ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract — Two classic categories of models exist for computer networks: network information flow and network of queues. The network information flow model appropriately captures the multihop flow routing nature in general network topologies, as well as encodable and replicable properties
Network Information Flow
, 2006
"... A formal model for an analysis of an information flow in interconnection networks is presented. It is based on timed process algebra which can express also network properties. The information flow is based on a concept of deducibility on composition. Robustness of systems against network timing att ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
A formal model for an analysis of an information flow in interconnection networks is presented. It is based on timed process algebra which can express also network properties. The information flow is based on a concept of deducibility on composition. Robustness of systems against network timing
Network Information Flow with Correlated Sources
 TO APPEAR IN THE IEEE TRANSACTIONS ON INFORMATION THEORY
, 2005
"... Consider the following network communication setup, originating in a sensor networking application we refer to as the “sensor reachback ” problem. We have a directed graph G = (V, E), where V = {v0v1...vn} and E ⊆ V × V. If (vi, vj) ∈ E, then node i can send messages to node j over a discrete memor ..."
Abstract

Cited by 93 (7 self)
 Add to MetaCart
(USUS c) < i∈S,j∈S c for all S ⊆ {0...M}, S = ∅, 0 ∈ S c. Our main finding is that in this setup a general source/channel separation theorem holds, and that Shannon information behaves as a classical network flow, identical in nature to the flow of water in pipes. At first glance, it might seem
Insufficiency of linear coding in network information flow
 IEEE TRANSACTIONS ON INFORMATION THEORY (REVISED JANUARY
, 2005
"... It is known that every solvable multicast network has a scalar linear solution over a sufficiently large finitefield alphabet. It is also known that this result does not generalize to arbitrary networks. There are several examples in the literature of solvable networks with no scalar linear solutio ..."
Abstract

Cited by 162 (14 self)
 Add to MetaCart
It is known that every solvable multicast network has a scalar linear solution over a sufficiently large finitefield alphabet. It is also known that this result does not generalize to arbitrary networks. There are several examples in the literature of solvable networks with no scalar linear
Polynomial Time Algorithms for Network Information Flow
 in 15th ACM Symposium on Parallel Algorithms and Architectures
, 2003
"... The famous maxflow mincut theorem states that a source node s can send information through a network (V; E) to a sink node t at a data rate determined by the mincut separating s and t. Recently it has been shown that this rate can also be achieved for multicasting to several sinks provided that t ..."
Abstract

Cited by 122 (1 self)
 Add to MetaCart
The famous maxflow mincut theorem states that a source node s can send information through a network (V; E) to a sink node t at a data rate determined by the mincut separating s and t. Recently it has been shown that this rate can also be achieved for multicasting to several sinks provided
Network Information Flow: Gossiping in Groups
, 2008
"... In this paper, we consider a networking scenario in which a group of nodes wants retrieve a function of data that are stored by another group of nodes. Here we assume that the function can be cast into a sum of functions of the local variables, a case that subsumes several interesting types of quer ..."
Abstract
 Add to MetaCart
needs to flow in a specific direction. In this work we provide a sufficient condition for the convergence to the desired result, and propose a method for designing the information flow for a given network configuration.
Network Information Flow with Correlated Sources
, 2005
"... Consider the following network communication setup, originating in a sensor networking application we refer to as the “sensor reachback” problem. We have a directed graph G = (V, E), where V = {v0v1...vn} and E ⊆ V × V. If (vi, vj) ∈ E, then node i can send messages to node j over a discrete memory ..."
Abstract
 Add to MetaCart
(USUS c) < i∈S,j∈S c for all S ⊆ {0...M}, S = ∅, 0 ∈ S c. Our main finding is that in this setup a general source/channel separation theorem holds, and that Shannon information behaves as a classical network flow, identical in nature to the flow of water in pipes. At first glance, it might seem
Results 1  10
of
125,451