Efficient Operation of Coded Packet Networks

TL;DR

This paper proposes a novel, efficient, and extensible method for operating coded packet networks, addressing challenges like lack of synchronization, broadcast links, and packet loss to optimize resource usage.

Contribution

It introduces a general and simple prescription for the operation of coded packet networks considering multiple practical challenges.

Findings

Provides a new operational framework for coded packet networks.

Addresses synchronization, broadcast links, and packet loss in network operation.

Offers a simple and extensible solution for efficient network communication.

Abstract

A fundamental problem faced in the design of almost all packet networks is that of efficient operation--of reliably communicating given messages among nodes at minimum cost in resource usage. We present a solution to the efficient operation problem for coded packet networks, i.e., packet networks where the contents of outgoing packets are arbitrary, causal functions of the contents of received packets. Such networks are in contrast to conventional, routed packet networks, where outgoing packets are restricted to being copies of received packets and where reliability is provided by the use of retransmissions. This thesis introduces four considerations to coded packet networks: 1. efficiency, 2. the lack of synchronization in packet networks, 3. the possibility of broadcast links, and 4. packet loss. We take these considerations and give a prescription for operation that is novel and general, yet simple, useful, and extensible.