Untitled

Orlowski, Sebastian; Wessäly, Roland; Pióro, Michał; Tomaszewski, Artur

doi:10.1002/net.v55:3

Cited by 137 publications

(3 citation statements)

References 150 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One is the Morgan summation procedure, also explained in Moore et al [2004], which has already been used for simple graphs in Rücker and Rücker [1993]. It employs the relation existing between the Morgan Extended Connectivities [Morgan 1965] and matrix powers of the adjacency matrix, first shown without proof in Razinger [1982] and finally confirmed in Rücker and Rücker [1993]. Due to its simplicity, this technique is also convenient in terms of implementation.…”

Section: Path-and Walk-based Metricsmentioning

confidence: 98%

Assessing the Structural Complexity of Computer and Communication Networks

2015

View full text Add to dashboard Cite

In this tutorial, 17 structural complexity indices are presented and compared, each representing one of the following categories: adjacency-and distance-based metrics, Shannon entropy-based metrics, product measures, subgraph-based metrics, and path-and walk-based metrics. The applicability of these indices to computer and communication networks is evaluated with the aid of different elementary, specifically designed, random, and real network topologies. On the grounds of the evaluation study, advantages and disadvantages of particular metrics are identified. In addition, their general properties and runtimes are assessed, and a general view on the structural network complexity is presented.

show abstract

Section: Path-and Walk-based Metricsmentioning

confidence: 98%

Assessing the Structural Complexity of Computer and Communication Networks

2015

View full text Add to dashboard Cite

show abstract

“…The proposed heuristics have been coded in AMPL and tested on a set of instances based on the SNDLib [24]. The models are solved with IBM ILOG CPLEX 12.7.1.0.…”

Section: Test Settingsmentioning

confidence: 99%

“…At each iteration, the procedure explores the neighborhood of the current solution S, solving an ILP model of the problem with additional constraints of the form (24). If an improving solution is found, then the current solution is updated (line 5).…”

Section: Improving Stepmentioning

confidence: 99%

ILP‐based heuristics for a virtual network function placement and routing problem

2021

View full text Add to dashboard Cite

Thanks to the increased availability of computing capabilities in data centers, the recently proposed virtual network function paradigm can be used to keep up with the increasing demand for network services as internet and its applications grow. The problem arises then of managing the virtual network functions, that is, to decide where to instantiate the functions and how to route the demands to reach them. While it arises in an application field, the Virtual Network Function placement and routing problem combines location and routing aspects in an interesting, challenging problem. In this paper, we propose several ILP‐based heuristics and compare them on a dataset that includes instances with different sizes, network topologies, and service capacity. The heuristics prove effective in tackling even large size instances, with up to 50 nodes and more than 80 arcs.

show abstract

Two-level iterated local search for WDM network design problem with traffic grooming

Guo

et al. 2015

Applied Soft Computing

View full text Add to dashboard Cite

Untitled

Cited by 137 publications

References 150 publications

Assessing the Structural Complexity of Computer and Communication Networks

Assessing the Structural Complexity of Computer and Communication Networks

ILP‐based heuristics for a virtual network function placement and routing problem

Two-level iterated local search for WDM network design problem with traffic grooming

Contact Info

Product

Resources

About