Multi-concentric optimal charging cordon design

The performance of a road pricing scheme varies greatly by its actual design and implementation. The design of the scheme is also normally constrained by several practicality requirements. One of the practicality requirements which is tackled in this paper is the topology of the charging scheme. The cordon shape of the pricing scheme is preferred due to its user-friendliness (i.e. the scheme can be understood easily). This has been the design concept for several real world cases (e.g. the schemes in London, Singapore, and Norway). The paper develops a methodology for defining an optimal location of a multi-concentric charging cordons scheme using Genetic Algorithm (GA). The branch-tree structure is developed to represent a valid charging cordon scheme which can be coded using two strings of node numbers and number of descend nodes. This branch-tree structure for a single cordon is then extended to the case with multi-concentric charging cordons. GA is then used to evolve the design of a multi-concentric charging cordons scheme encapsulated in the twostring chromosome. The algorithm developed, called GA-AS, is then tested with the network of the Edinburgh city in UK. The results suggest substantial improvements of the benefit from the optimised charging cordon schemes as compared to the judgemental ones which illustrate the potential of this algorithm

The Dynamics of Internet Traffic: Self-Similarity, Self-Organization, and Complex Phenomena

The Internet is the most complex system ever created in human history. Therefore, its dynamics and traffic unsurprisingly take on a rich variety of complex dynamics, self-organization, and other phenomena that have been researched for years. This paper is a review of the complex dynamics of Internet traffic. Departing from normal treatises, we will take a view from both the network engineering and physics perspectives showing the strengths and weaknesses as well as insights of both. In addition, many less covered phenomena such as traffic oscillations, large-scale effects of worm traffic, and comparisons of the Internet and biological models will be covered.Comment: 63 pages, 7 figures, 7 tables, submitted to Advances in Complex System

Critical phenomena in complex networks

The combination of the compactness of networks, featuring small diameters, and their complex architectures results in a variety of critical effects dramatically different from those in cooperative systems on lattices. In the last few years, researchers have made important steps toward understanding the qualitatively new critical phenomena in complex networks. We review the results, concepts, and methods of this rapidly developing field. Here we mostly consider two closely related classes of these critical phenomena, namely structural phase transitions in the network architectures and transitions in cooperative models on networks as substrates. We also discuss systems where a network and interacting agents on it influence each other. We overview a wide range of critical phenomena in equilibrium and growing networks including the birth of the giant connected component, percolation, k-core percolation, phenomena near epidemic thresholds, condensation transitions, critical phenomena in spin models placed on networks, synchronization, and self-organized criticality effects in interacting systems on networks. We also discuss strong finite size effects in these systems and highlight open problems and perspectives.Comment: Review article, 79 pages, 43 figures, 1 table, 508 references, extende

A Microscopic Model for Packet Transport in the Internet

A microscopic description of packet transport in the Internet by using a simple cellular automaton model is presented. A generalised exclusion process is introduced which allows to study travel times of the particles ('data packets') along a fixed path in the network. Computer simulations reveal the appearance of a free flow and a jammed phase separated by a (critical) transition regime. The power spectra are compared to empirical data for the RTT (Round Trip Time) obtained from measurements in the Internet. We find that the model is able to reproduce the characteristic statistical behaviour in agreement with the empirical data for both phases (free flow and congested). The phases are therefore jamming properties and not related to the structure of the network. Moreover the model shows, as observed in reality, critical behaviour (1/f-noise) for paths with critical load.Comment: 9 pages, 7 figure

Predicting commuter flows in spatial networks using a radiation model based on temporal ranges

Understanding network flows such as commuter traffic in large transportation networks is an ongoing challenge due to the complex nature of the transportation infrastructure and of human mobility. Here we show a first-principles based method for traffic prediction using a cost based generalization of the radiation model for human mobility, coupled with a cost-minimizing algorithm for efficient distribution of the mobility fluxes through the network. Using US census and highway traffic data we show that traffic can efficiently and accurately be computed from a range-limited, network betweenness type calculation. The model based on travel time costs captures the lognormal distribution of the traffic and attains a high Pearson correlation coefficient (0.75) when compared to real traffic. Due to its principled nature, this method can inform many applications related to human mobility driven flows in spatial networks, ranging from transportation, through urban planning to mitigation of the effects of catastrophic events.Comment: 24 pages, 6 figures. A first-principles based traffic prediction mode

Flows on Graphs with Random Capacities

We investigate flows on graphs whose links have random capacities. For binary trees we derive the probability distribution for the maximal flow from the root to a leaf, and show that for infinite trees it vanishes beyond a certain threshold that depends on the distribution of capacities. We then examine the maximal total flux from the root to the leaves. Our methods generalize to simple graphs with loops, e.g., to hierarchical lattices and to complete graphs.Comment: 8 pages, 6 figure