Network reduction for coded multiple-hop networks
2015 (English)In: 2015 IEEE International Conference on Communications (ICC), IEEE conference proceedings, 2015, 4518-4523 p.Conference paper (Refereed)
Data transmission over multiple-hop networks is impaired by random deleterious events, and characterizing the probability of error for the end-to-end transmission is challenging as the size of networks grows. Adams et al. showed that, when re-encoding at intermediate nodes is enabled, coded transmission over tandem/parallel links can be reduced to a single equivalent link with a specified probability function. Although iterative application of the tandem/parallel reduction techniques in alternation can simplify the task, they are generally not sufficient to reduce an arbitrary network to a single link. In this paper, we propose upper- and lower- bounding processes to bound the end-to-end probability distribution of a network by combining the parallel/tandem link reduction with the structure of flows over the network. We evaluate the performance of the proposed bounding methods at the 99% success rate of end-to-end data transmission over randomly generated acyclic networks. The numerical results demonstrate that our bounding approaches enable us to characterize a network by a single probability function to a very good precision.
Place, publisher, year, edition, pages
IEEE conference proceedings, 2015. 4518-4523 p.
, IEEE International Conference on Communications, ISSN 1550-3607
network reduction, multi-hop networks, network coding, coded transmission
Research subject SRA - ICT
IdentifiersURN: urn:nbn:se:kth:diva-159103DOI: 10.1109/ICC.2015.7249034ISI: 000371708104121ScopusID: 2-s2.0-84953750804ISBN: 978-1-4673-6432-4OAI: oai:DiVA.org:kth-159103DiVA: diva2:782564
IEEE International Conference on Communications, ICC 2015, London, United Kingdom, 8 June 2015 through 12 June 2015
FunderSwedish Research Council
QC 20160216, QC 201604212015-01-212015-01-212016-04-21Bibliographically approved