Abstract
The primary focus of this paper is the design of efficient algorithm for the calculation of solution to the placement of proxies for performance optimization in hierarchical reliable multicast (HRM). Proxy is introduced to localize feedback and retransmission, and therefore significantly depress traffic redundancy and reduce latency. Placement of proxies is a key issue in HRM. This paper theoretically analyzes the performance improvement made by placement of proxies and presents a new approach to optimal partition of a subtree for performance optimization in the placement of a single proxy. Based on this approach, we propose a new algorithm, designed in a greedy fashion. We experimentally compare our new algorithm with several existing heuristic algorithms, and observe that it outperforms in the tradeoff between performance and complexity.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
