• DocumentCode
    2332091
  • Title

    Network Coding for Multi-Resolution Multicast

  • Author

    Kim, MinJi ; Lucani, Daniel ; Shi, Xiaomeng ; Zhao, Fang ; Medard, Muriel

  • Author_Institution
    Massachusetts Inst. of Technol., Cambridge, MA, USA
  • fYear
    2010
  • fDate
    14-19 March 2010
  • Firstpage
    1
  • Lastpage
    9
  • Abstract
    Multi-resolution codes enable multicast at different rates to different receivers, a setup that is often desirable for graphics or video streaming. We propose a simple, distributed, two-stage message passing algorithm to generate network codes for single-source multicast of multi-resolution codes. The goal of this pushback algorithm is to maximize the total rate achieved by all receivers, while guaranteeing decodability of the base layer at each receiver. By conducting pushback and code assignment stages, this algorithm takes advantage of inter-layer as well as intra-layer coding. Numerical simulations show that in terms of total rate achieved, the pushback algorithm outperforms routing and intra-layer coding schemes, even with field sizes as small as 210(10 bits). In addition, the performance gap widens as the number of receivers and the number of nodes in the network increases. We also observe that naive inter-layer coding schemes may perform worse than intra-layer schemes under certain network conditions.
  • Keywords
    message passing; multicast communication; network coding; numerical analysis; telecommunication computing; code assignment stages; inter-layer coding; intra-layer coding; multiresolution codes; multiresolution multicast; network coding; pushback algorithm; two-stage message passing algorithm; Communications Society; Decoding; Encoding; Multicast algorithms; Network coding; Positron emission tomography; Routing; Streaming media; Subcontracting; USA Councils;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM, 2010 Proceedings IEEE
  • Conference_Location
    San Diego, CA
  • ISSN
    0743-166X
  • Print_ISBN
    978-1-4244-5836-3
  • Type

    conf

  • DOI
    10.1109/INFCOM.2010.5462001
  • Filename
    5462001