Efficient MD coding core selection to reduce the bandwidth consumption

Sunoh Choi, Sang Seon Byun, Hyuck 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 - Conference on Local Computer Networks, LCN
Pages231-233
Number of pages3
DOIs
Publication statusPublished - 2007 Dec 1
Event32nd IEEE Conference on Local Computer Networks, LCN 2007 - Dublin, Ireland
Duration: 2007 Oct 152007 Oct 18

Other

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

Fingerprint

Bandwidth
Heuristic algorithms
Redundancy
Topology

ASJC Scopus subject areas

  • Engineering(all)

Cite this

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

Efficient MD coding core selection to reduce the bandwidth consumption. / Choi, Sunoh; Byun, Sang Seon; Yoo, Hyuck.

Proceedings - Conference on Local Computer Networks, LCN. 2007. p. 231-233 4367836.

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

Choi, S, Byun, SS & Yoo, H 2007, Efficient MD coding core selection to reduce the bandwidth consumption. in Proceedings - Conference on Local Computer Networks, LCN., 4367836, pp. 231-233, 32nd IEEE Conference on Local Computer Networks, LCN 2007, Dublin, Ireland, 07/10/15. https://doi.org/10.1109/LCN.2007.61
Choi S, Byun SS, Yoo H. Efficient MD coding core selection to reduce the bandwidth consumption. In Proceedings - Conference on Local Computer Networks, LCN. 2007. p. 231-233. 4367836 https://doi.org/10.1109/LCN.2007.61
Choi, Sunoh ; Byun, Sang Seon ; Yoo, Hyuck. / Efficient MD coding core selection to reduce the bandwidth consumption. Proceedings - Conference on Local Computer Networks, LCN. 2007. pp. 231-233
@inproceedings{e7ef81318dff447c89eb7b1a389c35e8,
title = "Efficient MD coding core selection to reduce the bandwidth consumption",
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.",
author = "Sunoh Choi and Byun, {Sang Seon} and Hyuck Yoo",
year = "2007",
month = "12",
day = "1",
doi = "10.1109/LCN.2007.61",
language = "English",
isbn = "0769530001",
pages = "231--233",
booktitle = "Proceedings - Conference on Local Computer Networks, LCN",

}

TY - GEN

T1 - Efficient MD coding core selection to reduce the bandwidth consumption

AU - Choi, Sunoh

AU - Byun, Sang Seon

AU - Yoo, Hyuck

PY - 2007/12/1

Y1 - 2007/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=47249118377&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=47249118377&partnerID=8YFLogxK

U2 - 10.1109/LCN.2007.61

DO - 10.1109/LCN.2007.61

M3 - Conference contribution

AN - SCOPUS:47249118377

SN - 0769530001

SN - 9780769530000

SP - 231

EP - 233

BT - Proceedings - Conference on Local Computer Networks, LCN

ER -