Locating repair servers in hierarchical reliable multicast networks to reduce the makespan

Sang Seon Byun, Chuck Yoo

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)67-86
Number of pages20
JournalInternational Journal of Communication Systems
Issue number1
Publication statusPublished - 2009 Jan


  • Greedy heuristic
  • Hierarchical reliable multicast
  • Makespan
  • Window-based sending scheme

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Locating repair servers in hierarchical reliable multicast networks to reduce the makespan'. Together they form a unique fingerprint.

Cite this