DocumentCode :
1905063
Title :
Efficient MD Coding Core Selection to Reduce the Bandwidth Consumption
Author :
Choi, Sunoh ; Byun, Sang-Seon ; Yoo, Chuck
Author_Institution :
Korea Univ., Seoul
fYear :
2007
fDate :
15-18 Oct. 2007
Firstpage :
231
Lastpage :
233
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.
Keywords :
codes; computational complexity; integer programming; telecommunication network routing; NP-hard problems; bandwidth consumption; heuristic algorithm; multiple description coding; multiple distribution trees; network data; network paths; Bandwidth; Computer networks; Computer science; Data engineering; Heuristic algorithms; Linear programming; Robustness; Streaming media; Topology; User-generated content;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Local Computer Networks, 2007. LCN 2007. 32nd IEEE Conference on
Conference_Location :
Dublin
ISSN :
0742-1303
Print_ISBN :
0-7695-3000-1
Electronic_ISBN :
0742-1303
Type :
conf
DOI :
10.1109/LCN.2007.64
Filename :
4367836
Link To Document :
بازگشت