Models and Algorithms for the Design of Service Overlay Networks

  • Authors:
  • A. Capone;J. Elias;F. Martignon

  • Affiliations:
  • Dept. of Electron. & Inf., Politec. di Milano, Milan;-;-

  • Venue:
  • IEEE Transactions on Network and Service Management
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Service overlay networks (SONs) can provide end-to-end quality of service guarantees in the Internet without requiring significant changes to the underlying network infrastructure. A SON is an application-layer network operated by a third-party Internet service provider (ISP) that owns a set of overlay nodes, residing in the underlying ISP domains, interconnected by overlay links. The deployment of a SON can be a capital-intensive investment, and hence its planning requires careful decisions, including the overlay nodes' placement, the capacity provisioning of overlay links as well as of access links that connect the end-users to the SON infrastructure. In this paper, we propose two novel optimization models for the planning of SONs. The first model minimizes the SON installation cost while providing full coverage to all network's users. The second model maximizes the SON operator's profit by further choosing which users to serve, based on the expected gain, and taking into consideration budget constraints. We also introduce two efficient heuristics to get near-optimal solutions for largescale instances in a reasonable computation time. We provide numerical results of the proposed models and heuristics on a set of realistic-size instances, and discuss the effect of different parameters on the characteristics of the planned networks. We show that in the considered network scenarios the proposed heuristics perform close to the optimum with a short computing time.