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

Sang Seon Byun, Hyuck Yoo

Research output: Contribution to journalArticle

Abstract

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
Volume22
Issue number1
DOIs
Publication statusPublished - 2009 Jan 1

Fingerprint

Repair
Servers
Integer programming
Packet loss
Throughput

Keywords

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

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Locating repair servers in hierarchical reliable multicast networks to reduce the makespan. / Byun, Sang Seon; Yoo, Hyuck.

In: International Journal of Communication Systems, Vol. 22, No. 1, 01.01.2009, p. 67-86.

Research output: Contribution to journalArticle

@article{a13cb46b0811475091090ecd87d99980,
title = "Locating repair servers in hierarchical reliable multicast networks to reduce the makespan",
abstract = "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.",
keywords = "Greedy heuristic, Hierarchical reliable multicast, Makespan, Window-based sending scheme",
author = "Byun, {Sang Seon} and Hyuck Yoo",
year = "2009",
month = "1",
day = "1",
doi = "10.1002/dac.959",
language = "English",
volume = "22",
pages = "67--86",
journal = "International Journal of Communication Systems",
issn = "1074-5351",
publisher = "John Wiley and Sons Ltd",
number = "1",

}

TY - JOUR

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

AU - Byun, Sang Seon

AU - Yoo, Hyuck

PY - 2009/1/1

Y1 - 2009/1/1

N2 - 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.

AB - 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.

KW - Greedy heuristic

KW - Hierarchical reliable multicast

KW - Makespan

KW - Window-based sending scheme

UR - http://www.scopus.com/inward/record.url?scp=58149180164&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=58149180164&partnerID=8YFLogxK

U2 - 10.1002/dac.959

DO - 10.1002/dac.959

M3 - Article

AN - SCOPUS:58149180164

VL - 22

SP - 67

EP - 86

JO - International Journal of Communication Systems

JF - International Journal of Communication Systems

SN - 1074-5351

IS - 1

ER -