Data networks (2nd ed.)
A digital fountain approach to reliable distribution of bulk data
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
On the throughput, capacity, and stability regions of random multiple access
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Index Coding with Side Information
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
On packet lengths and overhead for random linear coding over the erasure channel
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Dynamic algorithms for multicast with intra-session network coding
IEEE Transactions on Information Theory
Comments on broadcast channels
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Stability and delay of finite-user slotted ALOHA with multipacket reception
IEEE Transactions on Information Theory
Capacity of wireless erasure networks
IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast
IEEE Transactions on Information Theory
Random Access Broadcast: Stability and Throughput Analysis
IEEE Transactions on Information Theory
On Joint MAC and Network Coding in Wireless Ad Hoc Networks
IEEE Transactions on Information Theory
Cross-Layer Optimization of MAC and Network Coding in Wireless Queueing Tandem Networks
IEEE Transactions on Information Theory
Full length article: On coding for reliable communication over packet networks
Physical Communication
Network planning in wireless ad hoc networks: a cross-Layer approach
IEEE Journal on Selected Areas in Communications
Adaptive network coding for scheduling real-time traffic with hard deadlines
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Buffer-aware network coding for wireless networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 754.84 |
The transmission of packets is considered from one source to multiple receivers over single-hop erasure channels. The objective is to evaluate the stability properties of different transmission schemes with and without network coding. First, the throughput limitation of retransmission schemes is discussed and the stability benefits are shown for randomly coded transmissions, which, however, need not optimize the stable throughput for finite coding field size and finite packet block size. Next, a dynamic scheme is introduced for distributing packets among virtual queues depending on the channel feedback and performing linear network coding based on the instantaneous queue contents. The difference of the maximum stable throughput from the min-cut rate is bounded as function of the order of erasure probabilities depending on the complexity allowed for network coding and queue management. This queue-based network coding scheme can asymptotically optimize the stable throughput to the max-flow min-cut bound, as the erasure probabilities go to zero. This is realized for a finite coding field size without accumulating packet blocks at the source to start network coding. The comparison of random and queue-based dynamic network coding with plain retransmissions opens up new questions regarding the tradeoffs of stable throughput, packet delay, overhead, and complexity.