SNDlib 1.0—Survivable Network Design Library

Assuming that the traffic matrix belongs to a polytope, we present a new routing paradigm where each traffic demand is routed independently of the other demands: the volume-oriented routing. The routing of each demand is a combination of two extreme routing schemes depending on the current volume of the demand. This new routing paradigm is easy to implement in networks and quite efficient in terms of network cost. However, computing an optimal volume-oriented routing is generally difficult. Then, we introduce two modifications of the presented routing paradigm such that an optimal solution can be computed in polynomial time. Numerical experiments are also provided to compare volume-oriented routing with the best routing strategy in term of costs, i.e, dynamic routing.

show abstract

“…We built our example cases using real world networks available in SNDlib [20]. We used atlanta and f rance topologies.…”

Section: Numerical Resultsmentioning

confidence: 99%

Volume-oriented routing and its modifications

Żotkiewicz

Ben‐Ameur

2011

Telecommun Syst

View full text Add to dashboard Cite

show abstract

“…We present results on 84 instances. Experiments have been made using instances derived from SNDlib networks [26]. We used SNDlib instances as physical networks and derived logical networks.…”

Section: Computational Resultsmentioning

confidence: 99%

Solving survivable two-layer network design problems by metric inequalities

Mattia

2010

Comput Optim Appl

View full text Add to dashboard Cite

We address the problem of designing a multi-layer network with survivability requirements. We are given a two-layer network: the lower layer represents the potential physical connections that can be activated, the upper layer is made of logical connections that can be set up using physical links. We are given origin-destination demands (commodities) to be routed at the upper layer. We are also given a set of failure scenarios and, for every scenarios, an associated subset of commodities. The goal is to install minimum cost integer capacities on the links of both layers in order to ensure that the commodities can be routed simultaneously on the network. In addition, in every failure scenario the routing of the associated commodities must be guaranteed. We consider two variants of the problem and develop a branch-and-cut scheme based on the capacity formulation. Computational results on instances derived from the SNDLib for single node failure scenarios are discussed.keywords: optical network design, branch-and-cut

show abstract

“…A modified US backbone network topology containing 39 nodes, 2 logically-centralized SDN controllers (yellow nodes: C1 and C2), and 130 unidirectional links. The topology of the original network was created based on the data delivered by the SNDlib project [17].…”

Section: A Evaluation Scenariosmentioning

confidence: 99%

Assessing the risk of violating SLA dependability requirements in software-defined networks

Kamisiński

Helvik

Gonzalez

et al. 2017

2017 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)

View full text Add to dashboard Cite

Abstract-Dependability of computer and communication networks is an important aspect of the customer-provider relationship in the telecommunication industry. Considering the increasing interest in Software-Defined Networking (SDN) technologies, as well as unclear understanding of dependability in the context of traffic flows in such networks, it is not clear how to define the related objectives in Service Level Agreements (SLAs), and how to estimate the risk of violation of the included dependability requirements. In this paper, we present a solution to both issues and we evaluate it in different scenarios by simulation. The results show that the proposed method is feasible and may help service providers to select the preferred recovery technique in SDN based on the estimated risk of violation of the SLA dependability requirements and known Service Level Objectives (SLOs).

show abstract

SNDlib 1.0—Survivable Network Design Library

Cited by 729 publications

References 8 publications

Volume-oriented routing and its modifications

Volume-oriented routing and its modifications

Solving survivable two-layer network design problems by metric inequalities

Assessing the risk of violating SLA dependability requirements in software-defined networks

Contact Info

Product

Resources

About