Design of efficient robust network codes for multicast connections

Booker, Graham; Sprintson, Alex

doi:10.1109/isit.2009.5205601

Cited by 5 publications

(4 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The work in [10] suggests a coding scheme for both unicast and multicast traffic and also studies the coding delay in packet networks that support network coding. Booker and Sprintson [11] propose efficient algorithms for the construction of robust network codes for multicast connections. The work in [12] presents an approach for designing network codes, by considering path failures in the network instead of edge failures.…”

Section: Introductionmentioning

confidence: 99%

On the performance of network coding and forwarding schemes with different degrees of redundancy for wireless mesh networks

Ploumidis

Παππάς

Siris

et al. 2015

Computer Communications

View full text Add to dashboard Cite

This work explores the throughput and delay that can be achieved by various forwarding schemes, employing multiple paths and different degrees of redundancy, focusing on linear network coding. The key contribution of the study is an analytical framework for modeling the throughput and delay forvarious schemes, considering wireless mesh networks where unicast traffic is forwarded and hop-by-hop retransmissions are employed for achieving reliability. The analytical framework is generalized for an arbitrary number of paths and hops per path. Another key contribution of the study is the evaluation and extension of the numerical results, drawn from the analysis, through system-level simulations. Our results show that, in scenarios with significant interference, the best throughput-delay tradeoff is achieved by single path forwarding. Moreover, when significant interference is present and network coding employs the larger packet generation size, it experiences higher delay than the other schemes. This is due to the inter-arrival times aggregating over all coded packets required to decode a packet generation. (C) 2015 Elsevier B.V. All rights reserved.

Funding Agencies|HERACLEITUS II - University of Crete

show abstract

Section: Introductionmentioning

confidence: 99%

On the performance of network coding and forwarding schemes with different degrees of redundancy for wireless mesh networks

Ploumidis

Παππάς

Siris

et al. 2015

Computer Communications

View full text Add to dashboard Cite

Funding Agencies|HERACLEITUS II - University of Crete

show abstract

“…The work in [4] studies the coding delay in packet networks that support network coding. The authors in [5] propose efficient algorithms for the construction of robust network codes for multicast connections. The goal of this work is to to provide instantaneous recovery from single edge failures.…”

Section: Introductionmentioning

confidence: 99%

Path diversity gain with network coding and multipath transmission in wireless mesh networks

Παππάς

Siris

Traganitis

2010

2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM)

View full text Add to dashboard Cite

In this paper we investigate the performance that can be achieved by exploiting path diversity through multipath forwarding together with redundancy through linear network coding, in wireless mesh networks with directional links. A key contribution of the paper is to capture the tradeoff between packet delay and throughput achieved by combining multipath forwarding and network coding, and compare this tradeoff with that of simple multipath routing where different flows follow different paths, the transmission of multiple copies of packets over multiple paths, and single path routing. The analytical framework considers the case of end-to-end retransmission for achieving reliability, and is generalized for an arbitrary number of paths and hops. We also derive the minimum and maximum number of coded packets that are needed at the receiver to retrieve all packets sent by the sender; this can be used to obtain a lower and upper bound for the delay in the case of linear network coding with multipath forwarding.

show abstract

“…The work in [48] studies the coding delay in packet networks that support network coding. The authors in [49] propose efficient algorithms for the construction of robust network codes for multicast connections. The goal of this work is to to provide instantaneous recovery from single edge failures.…”

Section: Discussionmentioning

confidence: 99%

Network-level cooperation

Παππάς¹

View full text Add to dashboard Cite

Design of efficient robust network codes for multicast connections

Cited by 5 publications

References 16 publications

On the performance of network coding and forwarding schemes with different degrees of redundancy for wireless mesh networks

On the performance of network coding and forwarding schemes with different degrees of redundancy for wireless mesh networks

Path diversity gain with network coding and multipath transmission in wireless mesh networks

Network-level cooperation

Contact Info

Product

Resources

About