Abstract

Internet heterogeneity has been a major problem in multimedia data delivery. To deal with the problem, overlay proxy networks as well as distributed and composable services across these overlay networks are being deployed. This solution however, implies that the overlay networks must support not only data multicast for data delivery to a group of destinations, but also service multicast (incorporate services in the distribution tree) for semantic data transformations in order to deal with Internet heterogeneity. This paper presents challenges and solutions for building service multicast trees. We compare two groups of algorithms, the shortest-service-path-tree (SSPT) algorithm and the longest-match (LM) algorithm. Simulation results show trade-offs between complexity and overall tree performance, as well as cost differences when further refinements of the LM approach are considered.

Original languageEnglish (US)
Pages (from-to)860-864
Number of pages5
JournalIEEE International Conference on Communications
Volume2
StatePublished - Jul 18 2003
Event2003 International Conference on Communications (ICC 2003) - Anchorage, AK, United States
Duration: May 11 2003May 15 2003

Fingerprint

Overlay networks
Internet
Trees (mathematics)
Semantics
Costs

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

On construction of service multicast trees. / Jin, Jingwen; Nahrstedt, Klara.

In: IEEE International Conference on Communications, Vol. 2, 18.07.2003, p. 860-864.

Research output: Contribution to journalConference article

@article{e9828429735248cfb9ee081be1b94c38,
title = "On construction of service multicast trees",
abstract = "Internet heterogeneity has been a major problem in multimedia data delivery. To deal with the problem, overlay proxy networks as well as distributed and composable services across these overlay networks are being deployed. This solution however, implies that the overlay networks must support not only data multicast for data delivery to a group of destinations, but also service multicast (incorporate services in the distribution tree) for semantic data transformations in order to deal with Internet heterogeneity. This paper presents challenges and solutions for building service multicast trees. We compare two groups of algorithms, the shortest-service-path-tree (SSPT) algorithm and the longest-match (LM) algorithm. Simulation results show trade-offs between complexity and overall tree performance, as well as cost differences when further refinements of the LM approach are considered.",
author = "Jingwen Jin and Klara Nahrstedt",
year = "2003",
month = "7",
day = "18",
language = "English (US)",
volume = "2",
pages = "860--864",
journal = "Conference Record - International Conference on Communications",
issn = "0536-1486",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - On construction of service multicast trees

AU - Jin, Jingwen

AU - Nahrstedt, Klara

PY - 2003/7/18

Y1 - 2003/7/18

N2 - Internet heterogeneity has been a major problem in multimedia data delivery. To deal with the problem, overlay proxy networks as well as distributed and composable services across these overlay networks are being deployed. This solution however, implies that the overlay networks must support not only data multicast for data delivery to a group of destinations, but also service multicast (incorporate services in the distribution tree) for semantic data transformations in order to deal with Internet heterogeneity. This paper presents challenges and solutions for building service multicast trees. We compare two groups of algorithms, the shortest-service-path-tree (SSPT) algorithm and the longest-match (LM) algorithm. Simulation results show trade-offs between complexity and overall tree performance, as well as cost differences when further refinements of the LM approach are considered.

AB - Internet heterogeneity has been a major problem in multimedia data delivery. To deal with the problem, overlay proxy networks as well as distributed and composable services across these overlay networks are being deployed. This solution however, implies that the overlay networks must support not only data multicast for data delivery to a group of destinations, but also service multicast (incorporate services in the distribution tree) for semantic data transformations in order to deal with Internet heterogeneity. This paper presents challenges and solutions for building service multicast trees. We compare two groups of algorithms, the shortest-service-path-tree (SSPT) algorithm and the longest-match (LM) algorithm. Simulation results show trade-offs between complexity and overall tree performance, as well as cost differences when further refinements of the LM approach are considered.

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

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

M3 - Conference article

AN - SCOPUS:0037632189

VL - 2

SP - 860

EP - 864

JO - Conference Record - International Conference on Communications

JF - Conference Record - International Conference on Communications

SN - 0536-1486

ER -