Efficient MD coding core selection to reduce the bandwidth consumption

Sunoh Choi; Sang Seon Byun; Chuck Yoo

doi:10.1109/LCN.2007.61

Efficient MD coding core selection to reduce the bandwidth consumption

Sunoh Choi, Sang Seon Byun, Chuck Yoo

Department of Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Proceedings of the 32nd IEEE Conference on Local Computer Networks, LCN 2007
Pages	231-233
Number of pages	3
DOIs	https://doi.org/10.1109/LCN.2007.61
Publication status	Published - 2007
Event	32nd IEEE Conference on Local Computer Networks, LCN 2007 - Dublin, Ireland Duration: 2007 Oct 15 → 2007 Oct 18

Publication series

Name	Proceedings - Conference on Local Computer Networks, LCN

Other

Other	32nd IEEE Conference on Local Computer Networks, LCN 2007
Country/Territory	Ireland
City	Dublin
Period	07/10/15 → 07/10/18

ASJC Scopus subject areas

Engineering(all)

Access to Document

10.1109/LCN.2007.61

Cite this

Choi, S, Byun, SS & 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., 4367836, Proceedings - Conference on Local Computer Networks, LCN, 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

@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 Chuck Yoo",

year = "2007",

doi = "10.1109/LCN.2007.61",

language = "English",

isbn = "0769530001",

series = "Proceedings - Conference on Local Computer Networks, LCN",

pages = "231--233",

booktitle = "Proceedings of the 32nd IEEE Conference on Local Computer Networks, LCN 2007",

note = "32nd IEEE Conference on Local Computer Networks, LCN 2007 ; Conference date: 15-10-2007 Through 18-10-2007",

}

TY - GEN

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

AU - Choi, Sunoh

AU - Byun, Sang Seon

AU - Yoo, Chuck

PY - 2007

Y1 - 2007

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

U2 - 10.1109/LCN.2007.61

DO - 10.1109/LCN.2007.61

M3 - Conference contribution

AN - SCOPUS:47249118377

SN - 0769530001

SN - 9780769530000

T3 - Proceedings - Conference on Local Computer Networks, LCN

SP - 231

EP - 233

BT - Proceedings of the 32nd IEEE Conference on Local Computer Networks, LCN 2007

T2 - 32nd IEEE Conference on Local Computer Networks, LCN 2007

Y2 - 15 October 2007 through 18 October 2007

ER -

Efficient MD coding core selection to reduce the bandwidth consumption

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this