Topological Taxonomy of Water Distribution Networks
Open Access
Abstract
Water Distribution Networks (WDNs) can be regarded as complex networks and modeled as graphs. In this paper, Complex Network Theory is applied to characterize the behavior of WDNs from a topological point of view, reviewing some basic metrics, exploring their fundamental properties and the relationship between them. The crucial aim is to understand and describe the topology of WDNs and their structural organization to provide a novel tool of analysis which could help to find new solutions to several arduous problems of WDNs. The aim is to understand the role of the topological structure in the WDNs functioning. The methodology is applied to 21 existing networks and 13 literature networks. The comparison highlights some topological peculiarities and the possibility to define a set of best design parameters for ex-novo WDNs that could also be used to build hypothetical benchmark networks retaining the typical structure of real WDNs. Two well-known types of network ((a) square grid; and (b) random graph) are used for comparison, aiming at defining a possible mathematical model for WDNs. Finally, the interplay between topology and some performance requirements of WDNs is discussed.Keywords
This publication has 48 references indexed in Scilit:
- A model of the filling process of an intermittent distribution networkUrban Water Journal, 2010
- On the relationships between topological measures in real-world networksNetworks and Heterogeneous Media, 2008
- Complex engineered, organizational and natural systemsSystems Engineering, 2007
- Network robustness to targeted attacks. The interplay of expansibility and degree distributionThe European Physical Journal B, 2006
- Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all thatJournal of Statistical Mechanics: Theory and Experiment, 2006
- Complex networks: Structure and dynamicsPhysics Reports, 2006
- On power-law relationships of the Internet topologyACM SIGCOMM Computer Communication Review, 1999
- Uniform generation of random regular graphs of moderate degreeJournal of Algorithms, 1990
- Power and Centrality: A Family of MeasuresAmerican Journal of Sociology, 1987
- Generating random regular graphsJournal of Algorithms, 1984