TY - JOUR
T1 - Proxy location for minimizing delivery delay in HRM networks
AU - Byun, Sang Seon
AU - Yoo, Chuck
N1 - Funding Information:
This research was supported by the MIC (Ministry of Information and Communication), Korea, under the ITRC (Information Technology Research Center) support program supervised by the IITA (Institute of Information Technology Assessment).
Copyright:
Copyright 2008 Elsevier B.V., All rights reserved.
PY - 2007/7/31
Y1 - 2007/7/31
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 minimize the mean delivery delay of all receivers in heterogeneous networks using a dynamic programming approach. Additionally, we evaluate how well the optimal proxies endure the link fluctuations. The evaluation results of our 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. Moreover, we show that if an optimal proxy set is configured once and if an application can tolerate a mean delivery delay increase of 2.5 ms, the proxy set can sustain about 200% fluctuation of link statistics. 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 minimize the mean delivery delay of all receivers in heterogeneous networks using a dynamic programming approach. Additionally, we evaluate how well the optimal proxies endure the link fluctuations. The evaluation results of our 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. Moreover, we show that if an optimal proxy set is configured once and if an application can tolerate a mean delivery delay increase of 2.5 ms, the proxy set can sustain about 200% fluctuation of link statistics. Our method can be used by network providers in order to reduce delivery delay in their HRM network.
KW - Dynamic programming
KW - Hierarchical reliable multicast
KW - Repair proxy
UR - http://www.scopus.com/inward/record.url?scp=34547100762&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34547100762&partnerID=8YFLogxK
U2 - 10.1016/j.comcom.2007.02.023
DO - 10.1016/j.comcom.2007.02.023
M3 - Article
AN - SCOPUS:34547100762
VL - 30
SP - 2162
EP - 2171
JO - Computer Communications
JF - Computer Communications
SN - 0140-3664
IS - 10
ER -