Efficient MD coding core selection to reduce the bandwidth consumption

Sunoh Choi, Sang Seon Byun, Chuck Yoo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Multiple distribution trees and multiple description (MD) coding are highly robust since they provide redundancy both in network paths and data. However, MD coded streaming includes a redundant information, which results in additional bandwidth consumptions in entire distribution trees. In this paper, we deploy core nodes in distribution tree, and give a role of MD coding to each core node, instead of a source node then we show how amount of bandwidth consumption can be reduced. Since the problem of finding an optimal set of core nodes is proved to be NP-hard, an intuitional heuristic-based algorithm is proposed. The simulation results show that our heuristic algorithm reduces the bandwidth consumptions by about 25% in the hierarchical topology compared to the MD coding in source node only.

Original languageEnglish
Title of host publicationProceedings of the 32nd IEEE Conference on Local Computer Networks, LCN 2007
Pages231-233
Number of pages3
DOIs
Publication statusPublished - 2007
Event32nd IEEE Conference on Local Computer Networks, LCN 2007 - Dublin, Ireland
Duration: 2007 Oct 152007 Oct 18

Publication series

NameProceedings - Conference on Local Computer Networks, LCN

Other

Other32nd IEEE Conference on Local Computer Networks, LCN 2007
CountryIreland
CityDublin
Period07/10/1507/10/18

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Efficient MD coding core selection to reduce the bandwidth consumption'. Together they form a unique fingerprint.

  • Cite this

    Choi, S., Byun, S. S., & Yoo, C. (2007). Efficient MD coding core selection to reduce the bandwidth consumption. In Proceedings of the 32nd IEEE Conference on Local Computer Networks, LCN 2007 (pp. 231-233). [4367836] (Proceedings - Conference on Local Computer Networks, LCN). https://doi.org/10.1109/LCN.2007.61