Reducing delivery delay in HRM tree

Sang Seon Byun; Chuck Yoo

doi:10.1007/11751588_126

Reducing delivery delay in HRM tree

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

In hierarchical reliable multicast schemes, the number of repair proxies and their locations influence the delivery delay. Low delivery delay is essential for the transmission of real time media. In this paper, we propose a method to decide optimal locations of repair proxies that minimizes the mean delivery delay of all receivers in heterogeneous network using a dynamic programming approach. The evaluation results of our optimal proposal in a simulation topology show that the mean delivery delay of all receivers can be reduced by about 10ms in network size of 1000 nodes. Our method can be used by network providers in order to reduce delivery delay in their HRM network.

Original language	English
Title of host publication	Computational Science and Its Applications - ICCSA 2006
Subtitle of host publication	International Conference, Proceedings - Part II
Publisher	Springer Verlag
Pages	1189-1198
Number of pages	10
ISBN (Print)	3540340726, 9783540340720
DOIs	https://doi.org/10.1007/11751588_126
Publication status	Published - 2006
Event	ICCSA 2006: International Conference on Computational Science and Its Applications - Glasgow, United Kingdom Duration: 2006 May 8 → 2006 May 11

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3981 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	ICCSA 2006: International Conference on Computational Science and Its Applications
Country	United Kingdom
City	Glasgow
Period	06/5/8 → 06/5/11

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/11751588_126

Fingerprint Dive into the research topics of 'Reducing delivery delay in HRM tree'. Together they form a unique fingerprint.

Cite this

Byun, S. S., & Yoo, C. (2006). Reducing delivery delay in HRM tree. In Computational Science and Its Applications - ICCSA 2006: International Conference, Proceedings - Part II (pp. 1189-1198). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3981 LNCS). Springer Verlag. https://doi.org/10.1007/11751588_126

Reducing delivery delay in HRM tree. / Byun, Sang Seon; Yoo, Chuck.

Computational Science and Its Applications - ICCSA 2006: International Conference, Proceedings - Part II. Springer Verlag, 2006. p. 1189-1198 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3981 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Byun, SS & Yoo, C 2006, Reducing delivery delay in HRM tree. in Computational Science and Its Applications - ICCSA 2006: International Conference, Proceedings - Part II. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3981 LNCS, Springer Verlag, pp. 1189-1198, ICCSA 2006: International Conference on Computational Science and Its Applications, Glasgow, United Kingdom, 06/5/8. https://doi.org/10.1007/11751588_126

Byun SS, Yoo C. Reducing delivery delay in HRM tree. In Computational Science and Its Applications - ICCSA 2006: International Conference, Proceedings - Part II. Springer Verlag. 2006. p. 1189-1198. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11751588_126

@inproceedings{c48d0732c2f84b6c8cdb17d722e70ed9,

title = "Reducing delivery delay in HRM tree",

abstract = "In hierarchical reliable multicast schemes, the number of repair proxies and their locations influence the delivery delay. Low delivery delay is essential for the transmission of real time media. In this paper, we propose a method to decide optimal locations of repair proxies that minimizes the mean delivery delay of all receivers in heterogeneous network using a dynamic programming approach. The evaluation results of our optimal proposal in a simulation topology show that the mean delivery delay of all receivers can be reduced by about 10ms in network size of 1000 nodes. Our method can be used by network providers in order to reduce delivery delay in their HRM network.",

author = "Byun, {Sang Seon} and Chuck Yoo",

year = "2006",

doi = "10.1007/11751588_126",

language = "English",

isbn = "3540340726",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "1189--1198",

booktitle = "Computational Science and Its Applications - ICCSA 2006",

note = "ICCSA 2006: International Conference on Computational Science and Its Applications ; Conference date: 08-05-2006 Through 11-05-2006",

}

TY - GEN

T1 - Reducing delivery delay in HRM tree

AU - Byun, Sang Seon

AU - Yoo, Chuck

PY - 2006

Y1 - 2006

N2 - In hierarchical reliable multicast schemes, the number of repair proxies and their locations influence the delivery delay. Low delivery delay is essential for the transmission of real time media. In this paper, we propose a method to decide optimal locations of repair proxies that minimizes the mean delivery delay of all receivers in heterogeneous network using a dynamic programming approach. The evaluation results of our optimal proposal in a simulation topology show that the mean delivery delay of all receivers can be reduced by about 10ms in network size of 1000 nodes. Our method can be used by network providers in order to reduce delivery delay in their HRM network.

AB - In hierarchical reliable multicast schemes, the number of repair proxies and their locations influence the delivery delay. Low delivery delay is essential for the transmission of real time media. In this paper, we propose a method to decide optimal locations of repair proxies that minimizes the mean delivery delay of all receivers in heterogeneous network using a dynamic programming approach. The evaluation results of our optimal proposal in a simulation topology show that the mean delivery delay of all receivers can be reduced by about 10ms in network size of 1000 nodes. Our method can be used by network providers in order to reduce delivery delay in their HRM network.

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

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

U2 - 10.1007/11751588_126

DO - 10.1007/11751588_126

M3 - Conference contribution

AN - SCOPUS:33745890281

SN - 3540340726

SN - 9783540340720

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1189

EP - 1198

BT - Computational Science and Its Applications - ICCSA 2006

PB - Springer Verlag

T2 - ICCSA 2006: International Conference on Computational Science and Its Applications

Y2 - 8 May 2006 through 11 May 2006

ER -