Premium
Locating repair servers in hierarchical reliable multicast networks to reduce the makespan
Author(s) -
Byun SangSeon,
Yoo Chuck
Publication year - 2009
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.959
Subject(s) - job shop scheduling , computer science , server , multicast , heuristics , computer network , network packet , upper and lower bounds , minification , distributed computing , heuristic , mathematical optimization , routing (electronic design automation) , artificial intelligence , mathematics , mathematical analysis , programming language , operating system
In a hierarchical reliable multicast (HRM) environment, makespan is the time that is required to fully and successfully transmit a packet from the sender to all receivers. Low makespan is vital for achieving high throughput with a TCP‐like window‐based sending scheme. In HRM methods, the number of repair servers and their locations influence the makespan. In this paper we propose a new method to decide the locations of repair servers that can reduce the makespan in HRM networks. Our method has a formulation based on mixed integer programming to analyze the makespan minimization problem. A notable aspect of the formulation is that heterogeneous links and packet losses are taken into account in the formulation. Three different heuristics are presented to find the locations of repair servers in reasonable time in the formulation. Through simulations, three heuristics are carefully analyzed and compared on networks with different sizes. The results show that the our best heuristic is close to the lower bound by a factor of 2.3 in terms of makespan and by a factor of 5.5 in terms of the number of repair servers. Copyright © 2008 John Wiley & Sons, Ltd.