Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published January 31, 2005 | public
Report Open

Network Coding for Nonuniform Demands

Abstract

In this paper we define nonuniform-demand networks as a useful connection model, in between multicasts and general connections. In these networks, the source has a pool of messages, and each sink demands a certain number of messages, without specifying their identities. We study the solvability of such networks and give a tight bound on the number of sinks that achieve capacity in a worst-case network. We propose constructions to solve networks at, or slightly below capacity, and investigate the effect large alphabets have on the solvability of such networks. We also show that our efficient constructions are suboptimal when used in networks with more sinks, yet this comes with little surprise considering the fact that the general problem is shown to be NP-hard.

Files

etr064.pdf
Files (185.2 kB)
Name Size Download all
md5:e864c1c822338694cf66f26612ca918a
185.2 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 24, 2023