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 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.
| Original language | English |
|---|---|
| Pages (from-to) | 2162-2171 |
| Number of pages | 10 |
| Journal | Computer Communications |
| Volume | 30 |
| Issue number | 10 |
| DOIs | |
| Publication status | Published - 2007 Jul 31 |
Bibliographical note
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).
Keywords
- Dynamic programming
- Hierarchical reliable multicast
- Repair proxy
ASJC Scopus subject areas
- Computer Networks and Communications