Reducing delivery delay in HRM tree

Sang Seon Byun, Hyuck Yoo

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages1189-1198
Number of pages10
Volume3981 LNCS
DOIs
Publication statusPublished - 2006 Jul 19
EventICCSA 2006: International Conference on Computational Science and Its Applications - Glasgow, United Kingdom
Duration: 2006 May 82006 May 11

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3981 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherICCSA 2006: International Conference on Computational Science and Its Applications
CountryUnited Kingdom
CityGlasgow
Period06/5/806/5/11

Fingerprint

Proxy
Repair
Heterogeneous networks
Dynamic programming
Topology
Receiver
Optimal Location
Heterogeneous Networks
Multicast
Dynamic Programming
Minimise
Evaluation
Vertex of a graph
Simulation

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Byun, S. S., & Yoo, H. (2006). Reducing delivery delay in HRM tree. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3981 LNCS, pp. 1189-1198). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3981 LNCS). https://doi.org/10.1007/11751588_126

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3981 LNCS 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 proceedingConference contribution

Byun, SS & Yoo, H 2006, Reducing delivery delay in HRM tree. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 3981 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3981 LNCS, 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 H. Reducing delivery delay in HRM tree. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3981 LNCS. 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
Byun, Sang Seon ; Yoo, Hyuck. / Reducing delivery delay in HRM tree. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3981 LNCS 2006. pp. 1189-1198 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@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 Hyuck Yoo",
year = "2006",
month = "7",
day = "19",
doi = "10.1007/11751588_126",
language = "English",
isbn = "3540340726",
volume = "3981 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "1189--1198",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Reducing delivery delay in HRM tree

AU - Byun, Sang Seon

AU - Yoo, Hyuck

PY - 2006/7/19

Y1 - 2006/7/19

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

VL - 3981 LNCS

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

SP - 1189

EP - 1198

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

ER -