Multicast algorithms in service overlay networks

Dario Pompili, Caterina Scoglio, Luca Lopez

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Overlay routing enhances the reliability and performance of IP networks since it can bypass network congestion and transient outages by forwarding traffic through one or more intermediate overlay nodes. In this paper, two algorithms for multicast applications in service overlay networks are presented. The first algorithm is tailored for source-specific applications such as live video, software and file distribution, replicated database, web site replication, and periodic data delivery; it builds a virtual source-rooted multicast tree to allow one member in the multicast group to send data to the other members. The second algorithm is tailored for group-shared applications such as videoconference, distributed games, file sharing, collaborative groupware, and replicated database; it constructs a virtual shared tree among group members. The objective of both algorithms is to achieve traffic balancing on the overlay network so as to avoid traffic congestion and fluctuation on the underlay network, which cause low performance. To address these problems, the algorithms actively probe the underlay network and compute virtual multicast trees by dynamically selecting the least loaded available paths on the overlay network. This way, network resources are optimally distributed and the number of multicast trees that can be setup is maximized. Both algorithms can offer service differentiation, i.e., provide QoS at application-layer without IP-layer support. The low computational complexity of the proposed algorithms leads to time and resource saving, as shown through extensive simulation experiments.

Original languageEnglish (US)
Pages (from-to)489-505
Number of pages17
JournalComputer Communications
Volume31
Issue number3
DOIs
StatePublished - Feb 25 2008

Fingerprint

Overlay networks
Groupware
Traffic congestion
Outages
Websites
Computational complexity
Quality of service

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Keywords

  • Mathematical programming/optimization
  • Multicast
  • Multirate layering
  • Overlay networks

Cite this

Pompili, Dario ; Scoglio, Caterina ; Lopez, Luca. / Multicast algorithms in service overlay networks. In: Computer Communications. 2008 ; Vol. 31, No. 3. pp. 489-505.
@article{e022cc92cd8a4b98b6d33024aa368cdc,
title = "Multicast algorithms in service overlay networks",
abstract = "Overlay routing enhances the reliability and performance of IP networks since it can bypass network congestion and transient outages by forwarding traffic through one or more intermediate overlay nodes. In this paper, two algorithms for multicast applications in service overlay networks are presented. The first algorithm is tailored for source-specific applications such as live video, software and file distribution, replicated database, web site replication, and periodic data delivery; it builds a virtual source-rooted multicast tree to allow one member in the multicast group to send data to the other members. The second algorithm is tailored for group-shared applications such as videoconference, distributed games, file sharing, collaborative groupware, and replicated database; it constructs a virtual shared tree among group members. The objective of both algorithms is to achieve traffic balancing on the overlay network so as to avoid traffic congestion and fluctuation on the underlay network, which cause low performance. To address these problems, the algorithms actively probe the underlay network and compute virtual multicast trees by dynamically selecting the least loaded available paths on the overlay network. This way, network resources are optimally distributed and the number of multicast trees that can be setup is maximized. Both algorithms can offer service differentiation, i.e., provide QoS at application-layer without IP-layer support. The low computational complexity of the proposed algorithms leads to time and resource saving, as shown through extensive simulation experiments.",
keywords = "Mathematical programming/optimization, Multicast, Multirate layering, Overlay networks",
author = "Dario Pompili and Caterina Scoglio and Luca Lopez",
year = "2008",
month = "2",
day = "25",
doi = "10.1016/j.comcom.2007.08.023",
language = "English (US)",
volume = "31",
pages = "489--505",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "3",

}

Multicast algorithms in service overlay networks. / Pompili, Dario; Scoglio, Caterina; Lopez, Luca.

In: Computer Communications, Vol. 31, No. 3, 25.02.2008, p. 489-505.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Multicast algorithms in service overlay networks

AU - Pompili, Dario

AU - Scoglio, Caterina

AU - Lopez, Luca

PY - 2008/2/25

Y1 - 2008/2/25

N2 - Overlay routing enhances the reliability and performance of IP networks since it can bypass network congestion and transient outages by forwarding traffic through one or more intermediate overlay nodes. In this paper, two algorithms for multicast applications in service overlay networks are presented. The first algorithm is tailored for source-specific applications such as live video, software and file distribution, replicated database, web site replication, and periodic data delivery; it builds a virtual source-rooted multicast tree to allow one member in the multicast group to send data to the other members. The second algorithm is tailored for group-shared applications such as videoconference, distributed games, file sharing, collaborative groupware, and replicated database; it constructs a virtual shared tree among group members. The objective of both algorithms is to achieve traffic balancing on the overlay network so as to avoid traffic congestion and fluctuation on the underlay network, which cause low performance. To address these problems, the algorithms actively probe the underlay network and compute virtual multicast trees by dynamically selecting the least loaded available paths on the overlay network. This way, network resources are optimally distributed and the number of multicast trees that can be setup is maximized. Both algorithms can offer service differentiation, i.e., provide QoS at application-layer without IP-layer support. The low computational complexity of the proposed algorithms leads to time and resource saving, as shown through extensive simulation experiments.

AB - Overlay routing enhances the reliability and performance of IP networks since it can bypass network congestion and transient outages by forwarding traffic through one or more intermediate overlay nodes. In this paper, two algorithms for multicast applications in service overlay networks are presented. The first algorithm is tailored for source-specific applications such as live video, software and file distribution, replicated database, web site replication, and periodic data delivery; it builds a virtual source-rooted multicast tree to allow one member in the multicast group to send data to the other members. The second algorithm is tailored for group-shared applications such as videoconference, distributed games, file sharing, collaborative groupware, and replicated database; it constructs a virtual shared tree among group members. The objective of both algorithms is to achieve traffic balancing on the overlay network so as to avoid traffic congestion and fluctuation on the underlay network, which cause low performance. To address these problems, the algorithms actively probe the underlay network and compute virtual multicast trees by dynamically selecting the least loaded available paths on the overlay network. This way, network resources are optimally distributed and the number of multicast trees that can be setup is maximized. Both algorithms can offer service differentiation, i.e., provide QoS at application-layer without IP-layer support. The low computational complexity of the proposed algorithms leads to time and resource saving, as shown through extensive simulation experiments.

KW - Mathematical programming/optimization

KW - Multicast

KW - Multirate layering

KW - Overlay networks

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

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

U2 - 10.1016/j.comcom.2007.08.023

DO - 10.1016/j.comcom.2007.08.023

M3 - Article

AN - SCOPUS:38549131451

VL - 31

SP - 489

EP - 505

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 3

ER -