On Network Coding for Funnel Networks

Network coding for non-multicast problems has been the subject of many recent studies. In this letter, we consider networks in which the total capacity of the incoming links to each intermediate node is not less than the total capacity of its outgoing links. We call these networks funnel networks an...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters Vol. 19; no. 11; pp. 1897 - 1900
Main Authors: Karimian, Pourya, Rafie Borujeny, Reza, Ardakani, Masoud
Format: Journal Article
Language:English
Published: New York IEEE 01.11.2015
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Coding
Communication networks
Computer networks
Encoding
Funnels
Links
Mathematics
Network coding
Network information theory
Networks
non-multicast problems
random linear network coding
Receivers
Routing
Routing (telecommunications)
Throughput
random linear network coding
Network information theory
non-multicast problems
ISSN:1089-7798, 1558-2558
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Network coding for non-multicast problems has been the subject of many recent studies. In this letter, we consider networks in which the total capacity of the incoming links to each intermediate node is not less than the total capacity of its outgoing links. We call these networks funnel networks and prove that any feasible non-multicast problem on funnel networks is solvable by routing (hence, by linear network coding, too). The desirability of network coding in funnel networks may be justified by the other benefits that coding offers. However, we see that in funnel networks, the conventional random approach to linear coding fails with high probability. Hence, we provide a new random linear network coding solution for these non-multicast problems.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2015.2477816