A design framework towards the profitable operation of service overlay networks

Tran, Hung Tuan; Ziegler, Thomas

doi:10.1016/j.comnet.2006.04.012

Cited by 18 publications

(28 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The network design problem has been considered in different contexts, such as wired backbone networks [11,12,13,14,15,16,17,18,19,20,21], wireless networks [22,23] and recently Service Overlay Networks [6,8,9,10,24,25,26,27,28]. The problem consists in deciding the number and position of the network nodes, the links between such nodes and the capacity installed on each link, as well as the traffic routing.…”

Section: Related Workmentioning

confidence: 99%

“…Service Overlay Networks (SONs) have been recently introduced as an effective way to provide endto-end QoS guarantees without any changes in the underlying Internet structure [1,2,3,4,5,6].…”

Section: Introductionmentioning

confidence: 99%

“…The SON gains from users' subscriptions. Although the quality requirements that a SON must satisfy may be different (e.g., bandwidth, delay, delay jitter, packet loss), we assume they are mapped to an equivalent bandwidth [1,6]. To assure the bandwidth for the SON, the underlying ISPs have several technical options: they can lease a transmission line to the SON, use bandwidth reservation mechanisms or create a separate Label Switched Path if MPLS [7] is available in their networks.…”

Section: Introductionmentioning

confidence: 99%

“…The topology design problem for Service Overlay Networks is considered by very few works [6,8,9,10] which make several limiting assumptions: (1) the number and location of overlay nodes are predetermined, while the overlay nodes placement is a critical issue in the deployment of the SON architecture, (2) the capacities of overlay nodes are unlimited, thus assuming that the underlying ISPs will always be able to provide bandwidth to the SON, and (3) only small network instances are considered, with a limited number of connections and overlay nodes.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Very large-scale neighborhood search algorithms for the design of service overlay networks

2010

View full text Add to dashboard Cite

Service Overlay Networks (SONs) allow virtual operators to create and deploy value-added Internet services with Quality of Service guarantees, while leaving the underlying network infrastructure unchanged. The deployment of a SON can be very expensive, and hence its planning requires careful decisions, including the overlay nodes' placement and the capacity provisioning of the access links that connect the end-users to the SON infrastructure.In this work we first propose a novel Integer Linear Programming (ILP) model for the overlay network design problem which selects the optimal number and position of overlay nodes, the capacity reserved on each overlay link, as well as the optimal routing of the incoming traffic demands.Since such model can be solved to the optimum only for small network instances, we further propose an efficient and novel tabu search based heuristic for the planning of SONs that combines polynomial size and very large-scale neighborhoods. The very large-scale neighborhood of the solution given by tabu search is explored efficiently to obtain in a short time a new one that is both far from the current solution and cost-decreasing.We provide numerical results of the proposed heuristic on a set of realistic, large-size instances, including real ISP topologies, and discuss the effect of different parameters on the characteristics of the planned networks. Furthermore, we compare such results with the bound obtained solving our ILP model in small network scenarios. We show that in the considered network topologies the proposed heuristic performs very close to the optimum with a short computation time, thus providing a promising framework for the design of SONs.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Very large-scale neighborhood search algorithms for the design of service overlay networks

2010

View full text Add to dashboard Cite

show abstract

“…In [8] the authors addressed this issue in terms of choosing the number and the location of the overlay nodes to be deployed as well as the reserved bandwidth on each overlay link, while in [2] the authors proposed a framework for the adaptive design of a SON. In more detail, they developed a set of heuristic methods, and compared their performance.…”

Section: Related Workmentioning

confidence: 99%

Topology Design for Service Overlay Networks with Economic and QoS Constraints

et al. 2009

View full text Add to dashboard Cite

Abstract. Service Overlay Networks (SON) have emerged as an efficient way to provide end-to-end Quality of Service (QoS) support in the Internet, as required by real-time services.The deployment of a SON is a capital-intensive investment. Thus, minimizing the economic cost is one of the key objectives for the SON operator. Moreover, end-to-end performance must be enhanced, so as to provide innovative value-added services. This paper, addresses the problem of cost and performance optimization of a SON. More specifically, we propose a set of algorithms for the selection of a SON topology, which minimizes the economic cost while taking also into account performance constraints.

show abstract

Optimal design of Service Overlay Networks with economic and performance constraints

Adami

Callegari

Giordano

et al. 2009

Int J Communication

View full text Add to dashboard Cite

SUMMARYIn the last years, Service Overlay Networks (SONs) have emerged as a promising means to address some of the issues (e.g. end-to-end QoS) affecting the current Internet and to favor the development and deployment of new value-added Internet services. The deployment of an SON is a capital-intensive investment, since bandwidth with certain QoS guarantees must be purchased from the individual network domains through bilateral Service Level Agreements. Thus, minimizing the economic cost of the logical end-to-end service delivery infrastructure is one of the key objectives for the SON provider. When a SON is aimed at end-to-end QoS provisioning, its topology must be designed so as to also satisfy the specific requirements of QoS-sensitive applications. This paper deals with the problem of planning the SON topology in order to take into account both cost and QoS constraints. More specifically, the paper proposes a set of new algorithms for the design of an optimized SON topology, which minimizes the economic cost while simultaneously meeting bandwidth and delay constraints. A performance comparison among such algorithms is finally carried out.

show abstract

A design framework towards the profitable operation of service overlay networks

Cited by 18 publications

References 13 publications

Very large-scale neighborhood search algorithms for the design of service overlay networks

Very large-scale neighborhood search algorithms for the design of service overlay networks

Topology Design for Service Overlay Networks with Economic and QoS Constraints

Optimal design of Service Overlay Networks with economic and performance constraints

Contact Info

Product

Resources

About