document

Designing virus-resistant, high-performance networks: A game-formation approach

Trajanovski, S. (author), Kuipers, F.A. (author), Hayel, Yezekael (author), Altman, Eitan (author), Van Mieghem, P.F.A. (author)

Designing an optimal network topology while balancing multiple, possibly conflicting objectives like cost, performance, and resiliency to viruses is a challenging endeavor, let alone in the case of decentralized network formation. We therefore propose a game-formation technique where each player aims to minimize its cost in installing links,...

journal article 2018

document

Comparing the Effects of Failures in Power Grids under the AC and DC Power Flow Models

Çetinay Iyicil, H. (author), Soltan, Saleh (author), Kuipers, F.A. (author), Zussman, Gil (author), Van Mieghem, P.F.A. (author)

In this paper, we compare the effects of failures in power grids under the nonlinear AC and linearized DC power flow models. First, we numerically demonstrate that when there are no failures and the assumptions underlying the DC model are valid, the DC model approximates the AC model well in four considered test networks. Then, to evaluate...

journal article 2018

document

A Topological Investigation of Power Flow

Çetinay Iyicil, H. (author), Kuipers, F.A. (author), Van Mieghem, P.F.A. (author)

This paper combines the fundamentals of an electrical grid, such as flow allocation according to Kirchhoff’s laws and the effect of transmission line reactances with spectral graph theory, and expresses the linearized power flow behaviour in slack-bus independent weighted graph matrices to assess the relation between the topological structure...

journal article 2018

document

Analyzing Cascading Failures in Power Grids under the AC and DC Power Flow Models

Çetinay Iyicil, H. (author), Soltan, Saleh (author), Kuipers, F.A. (author), Zussman, Gil (author), Van Mieghem, P.F.A. (author)

In this paper, we study cascading failures in power grids under the nonlinear AC and linearized DC power flow models. We numerically compare the evolution of cascades after single line failures under the two flow models in four test networks. The cascade simulations demonstrate that the assumptions underlying the DC model (e.g., ignoring power...

journal article 2017

document

Finding critical regions and region-disjoint paths in a network

Trajanovski, S. (author), Kuipers, F.A. (author), Ilic, A (author), Crowcroft, J (author), Van Mieghem, P.F.A. (author)

journal article 2015

document

Domination-time dynamics in susceptible-infected-susceptible virus competition on networks

Van de Bovenkamp, R. (author), Kuipers, F.A. (author), Van Mieghem, P.F.A. (author)

When two viruses compete for healthy nodes in a simple network and both spreading rates are above the epidemic threshold, only one virus will survive. However, if we prevent the viruses from dying out, rich dynamics emerge. When both viruses are identical, one virus always dominates the other, but the dominating and dominated virus alternate. We...

journal article 2014

document

Finding Critical Regions and Region-Disjoint Paths in a Network

Trajanovski, S. (author), Kuipers, F.A. (author), Ili?, A. (author), Crowcroft, J. (author), Van Mieghem, P. (author)

Due to their importance to society, communication networks should be built and operated to withstand failures.However, cost considerations make network providers less inclined to take robustness measures against failures that are unlikely to manifest, like several failures coinciding simultaneously in different geographic regions of their...

journal article 2014

document

Domination-time dynamics in susceptible-infected-susceptible virus competition on networks

van de Bovenkamp, R. (author), Kuipers, F.A. (author), Van Mieghem, P.F.A. (author)

journal article 2014

document

Generating graphs that approach a prescribed modularity

Trajanovski, S. (author), Kuipers, F.A. (author), Martín-Hernández, J. (author), Van Mieghem, P. (author)

Modularity is a quantitative measure for characterizing the existence of a community structure in a network. A network's modularity depends on the chosen partitioning of the network into communities, which makes finding the specific partition that leads to the maximum modularity a hard problem. In this paper, we prove that deciding whether a...

journal article 2013

document

Generating graphs that approach a prescribed modularity

Trajanovski, S. (author), Kuipers, F.A. (author), Martin Hernandez, J. (author), Van Mieghem, P.F.A. (author)

journal article 2013

document

Decreasing the spectral radius of a graph by link removals

Van Mieghem, P. (author), Stevanovi?, D. (author), Kuipers, F. (author), Li, C. (author), Van de Bovenkamp, R. (author), Liu, D. (author), Wang, H. (author)

The decrease of the spectral radius, an important characterizer of network dynamics, by removing links is investigated. The minimization of the spectral radius by removing m links is shown to be an NP-complete problem, which suggests considering heuristic strategies. Several greedy strategies are compared, and several bounds on the decrease of...

journal article 2011

document

Decreasing the spectral radius of a graph by link removals

Van Mieghem, P.F.A. (author), Stevanovic, D (author), Kuipers, F.A. (author), Li, C. (author), van de Bovenkamp, R. (author), Liu, D. (author), Wang, H. (author)

journal article 2011

document

Influence of assortativity and degree-preserving rewiring on the spectra of networks

Van Mieghem, P. (author), Wang, H. (author), Ge, X. (author), Tang, S. (author), Kuipers, F.A. (author)

Newman’s measure for (dis)assortativity, the linear degree correlation coefficient ?D, is reformulated in terms of the total number Nk of walks in the graph with k hops. This reformulation allows us to derive a new formula from which a degree-preserving rewiring algorithm is deduced, that, in each rewiring step, either increases or decreases ?D...

journal article 2010

document

Influence of assortativity and degree-preserving rewiring on the spectra of networks

Van Mieghem, P.F.A. (author), Wang, H. (author), Ge, X (author), Tang, S. (author), Kuipers, F.A. (author)

journal article 2010

document

Assessing the quality of experience of SopCast

Lu, Y (author), Fallica, B (author), Kuipers, F.A. (author), Kooij, Robert (author), Van Mieghem, P.F.A. (author)

journal article 2009

document

Research challenges in QoS routing

Masip-Bruin, X (author), Yannuzzi, M (author), Domingo-Pascual, J (author), Fonte, A (author), Curado, M (author), Monteiro, E (author), Kuipers, F.A. (author), Van Mieghem, P.F.A. (author), Avallone, S (author), Ventre, G (author), Aranda-Gutiérrez, P (author), Hollick, M (author), Steinmetz, R (author), Iannone, L (author), Salamatian, K (author)

Quality of Service Routing is at present an active and remarkable research area, since most emerging network services require specialized Quality of Service (QoS) functionalities that cannot be provided by the current QoS-unaware routing protocols. The provisioning of QoS based network services is in general terms an extremely complex problem,...

journal article 2006

document

Conditions That Impact the Complexity of QoS Routing

Kuipers, F.A. (author), Van Mieghem, P.F.A. (author)

journal article 2005

document

Non-dominance in QoS routing: An implementational perspective

Kuipers, F.A. (author), Van Mieghem, P. (author)

journal article 2005

document

Conditions that impact the complexity of QoS routing

Kuipers, F.A. (author), Van Mieghem, P.F.A. (author)

Finding a path in a network based on multiple constraints (the MCP problem) is often considered an integral part of quality of service (QoS) routing. QoS routing with constraints on multiple additive measures has been proven to be NP-complete. This proof has dramatically influenced the research community, resulting into the common belief that...

journal article 2005

document

Non-dominance in QoS routing: an implementational perspective

Kuipers, F.A. (author), Van Mieghem, P.F.A. (author)

journal article 2005