English
Related papers

Related papers: On the Delay Advantage of Coding in Packet Erasure…

200 papers

We analyze a simple network where a source and a receiver are connected by a line of erasure channels of different reliabilities. Recent prior work has shown that random linear network coding can achieve the min-cut capacity and therefore…

Information Theory · Computer Science 2009-10-22 Theodoros K. Dikaliotis , Alexandros G. Dimakis , Tracey Ho , Michelle Effros

Characterization of the delay profile of systems employing random linear network coding is important for the reliable provision of broadcast services. Previous studies focused on network coding over large finite fields or developed Markov…

Information Theory · Computer Science 2022-03-08 Ioannis Chatzigeorgiou , Andrea Tassi

We present a closed-form expression for the minimal delay that is achievable in a setting that combines a buffer and an erasure code, used to mitigate the packet delay variance. The erasure code is modeled according to the recent…

Information Theory · Computer Science 2016-10-17 Jesper H. Sørensen , Petar Popovski , Jan Østergaard

Exact queueing analysis of erasure networks with network coding in a finite buffer regime is an extremely hard problem due to the large number of states in the network. In such networks, packets are lost due to either link erasures or due…

Information Theory · Computer Science 2010-12-14 Nima Torabkhani , Badri N. Vellambi , Faramarz Fekri

Network Coding is a packet encoding technique which has recently been shown to improve network performance (by reducing delays and increasing throughput) in broadcast and multicast communications. The cost for such an improvement comes in…

Information Theory · Computer Science 2016-03-25 Emmanouil Skevakis , Ioannis Lambadaris

Network coding is a highly efficient data dissemination mechanism for wireless networks. Since network coded information can only be recovered after delivering a sufficient number of coded packets, the resulting decoding delay can become…

Information Theory · Computer Science 2016-11-17 Rui A. Costa , Daniele Munaretto , Joerg Widmer , Joao Barros

We assess the practicality of random network coding by illuminating the issue of overhead and considering it in conjunction with increasingly long packets sent over the erasure channel. We show that the transmission of increasingly long…

Information Theory · Computer Science 2007-07-13 Brooke Shrader , Anthony Ephremides

In this paper, we study Two-way relaying networks well-known for its throughput merits. In particular, we study the fundamental throughput delay trade-off in two-way relaying networks using opportunistic network coding. We characterize the…

Information Theory · Computer Science 2015-02-11 Maha Zohdy , Tamer ElBatt , Mohamed Nafie

Motivated by streaming applications with stringent delay constraints, we consider the design of online network coding algorithms with timely delivery guarantees. Assuming that the sender is providing the same data to multiple receivers over…

Information Theory · Computer Science 2016-11-15 Joao Barros , Rui A. Costa , Daniele Munaretto , Joerg Widmer

This paper considers the multiple-access relay channel in a setting where two source nodes transmit packets to a destination node, both directly and via a relay node, over packet erasure channels. Intra-session network coding is used at the…

Information Theory · Computer Science 2022-03-08 Amjad Saeed Khan , Ioannis Chatzigeorgiou

We consider the energy savings that can be obtained by employing network coding instead of plain routing in wireless multiple unicast problems. We establish lower bounds on the benefit of network coding, defined as the maximum of the ratio…

Information Theory · Computer Science 2011-08-19 Jasper Goseling , Ruytaroh Matsumoto , Tomohiko Uyematsu , Jos H. Weber

Current approaches to the practical implementation of network coding are batch-based, and often do not use feedback, except possibly to signal completion of a file download. In this paper, the various benefits of using feedback in a network…

Networking and Internet Architecture · Computer Science 2009-04-13 Jay Kumar Sundararajan , Devavrat Shah , Muriel Medard

In this paper, we analyze the coding delay and the average coding delay of random linear network codes (a.k.a. dense codes) and chunked codes (CC), which are an attractive alternative to dense codes due to their lower complexity, over line…

Information Theory · Computer Science 2012-07-26 Anoosheh Heidarzadeh , Amir H. Banihashemi

In this paper, we analyze the coding delay and the average coding delay of Chunked network Codes (CC) over line networks with Bernoulli losses and deterministic regular or Poisson transmissions. Chunked codes are an attractive alternative…

Information Theory · Computer Science 2012-03-09 Anoosheh Heidarzadeh , Amir H. Banihashemi

We provide an analytical study of the impact of packet skipping and opportunistic network coding on the timely communication of messages through a single network element. In a first step, we consider a single-server queueing system with…

Networking and Internet Architecture · Computer Science 2015-03-19 Marc Aoun , Paul Beekhuizen , Antonios Argyriou , Dee Denteneer , Peter van der Stok

Network coding is a novel solution that significantly improve the throughput and energy consumed of wireless networks by mixing traffic flows through algebraic operations. In conventional network coding scheme, a packet has to wait for…

Information Theory · Computer Science 2014-01-27 Hongyi Zeng , Wei Chen

In a single hop broadcast packet erasure network, we demonstrate that it is possible to provide multirate packet delivery outside of what is given by the network min-cut. This is achieved by using a deterministic non-block-based network…

Information Theory · Computer Science 2014-01-06 Amy Fu , Parastoo Sadeghi , Muriel Medard

Network coding permits to deploy distributed packet delivery algorithms that locally adapt to the network availability in media streaming applications. However, it may also increase delay and computational complexity if it is not…

Multimedia · Computer Science 2016-11-17 Nicolae Cleju , Nikolaos Thomos , Pascal Frossard

We study random linear network coding for broadcasting in time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. The sender transmits coded data packets…

Information Theory · Computer Science 2009-03-26 Daniel E. Lucani , Muriel Médard , Milica Stojanovic

We study the energy performance of random linear network coding for time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. The sender transmits coded data…

Information Theory · Computer Science 2009-01-05 Daniel E. Lucani , Milica Stojanovic , Muriel Médard
‹ Prev 1 2 3 10 Next ›