@inbook{cccf6a59fc1c4150a1657963e54ac8d8,
title = "Distributed algorithm for service replication in service overlay network",
abstract = "The service overlay network (SON) is an effective mean to deploy end-to-end QoS guaranteed content delivery services on the current Internet. We model the content delivery service on a SON as a service delivery tree (SDT). Previous studies have addressed the optimal distribution tree formulation issues. In this paper, we focus on the problem of maximizing the total operation profit of the SON. In [1], authors introduced a cost model for optimal bandwidth provisioning in SON. In this paper, we extended this concept and propose an alternative approach to maximize the total effective throughput of SDT as well as to minimize the QoS violation penalty of the SON by service replication. We present both centralized and distributed algorithms for the placement of replicated servers on the SDT. Experiments are carried to quantify the merit, effectiveness and the scalability of the proposed service replication algorithm. In particular, the performance gain is very close to the exhaustive search. The algorithm performs well when we scale up the service overlay networks. Finally, we show that one only needs to perform a small number of replications to attain the optimal gain.",
keywords = "Overlay networks, QoS, Replication algorithm",
author = "Liu, {Kevin Y.K.} and Lui, {John C.S.} and Zhang, {Zhi Li}",
year = "2004",
doi = "10.1007/978-3-540-24693-0_95",
language = "English (US)",
isbn = "9783540246930",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "1156--1167",
editor = "Nikolas Mitrou and Kimon Kontovasilis and Rouskas, {George N.} and Ilias lliadis and Lazaros Merakos",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
}