Networking

Multicast Packing for Coding Across Multiple Unicasts

Free registration required

Executive Summary

The authors consider the problem of inter-session network coding for multiple unicast flows over directed acyclic graphs. Their approach consists of the following steps: the unicast flows are partitioned into multiple disjoint subsets of unicast flows and each subset of unicast flows is mapped to a multicast flow, and linear network codes are constructed for these multicast flows. These linear network codes collectively serve as a linear network code for the original multiple unicast flows, which they refer to as Multicast-Packing Code (MPC).

  • Format: PDF
  • Size: 474.17 KB