相关论文: Optimal Traffic Networks

In this paper, we reveal the relationship between entropy rate and the congestion in complex network and solve it analytically for special cases. Finding maximizing entropy rate will lead to an improvement of traffic efficiency, we propose…

Complex network theory aims to model and analyze complex systems that consist of multiple and interdependent components. Among all studies on complex networks, topological structure analysis is of the most fundamental importance, as it…

One of the paramount challenges in neuroscience is to understand the dynamics of individual neurons and how they give rise to network dynamics when interconnected. Historically, researchers have resorted to graph theory, statistics, and…

In this paper, we investigate the statistical features of the weighted international-trade network. By finding the maximum weight spanning trees for this network we make the extraction of the truly relevant connections forming the network's…

One of the challenges for future infrastructures is how to design a network with high efficiency and strong connectivity at low cost. We propose self-organized geographical networks beyond the vulnerable scale-free structure found in many…

The outage performance of wireless networks with unstructured network topologies is investigated. The network reliability perspective of graph theory is used to obtain the network outage polynomial of generalized wireless networks by…

This lecture discusses the mathematical relationship between network structure and network utilization of transportation network. Network structure means the graph itself. Network utilization represent the aggregation of trajectories of…

In this article, we propose a growing network model based on an optimal policy involving both topological and geographical measures. In this model, at each time step, a new node, having randomly assigned coordinates in a $1 \times 1$…

The deployment of modern network applications is increasing the network size and traffic volumes at an unprecedented pace. Storing network-related information (e.g., traffic traces) is key to enable efficient network management. However,…

With the tremendous increase of the Internet traffic, achieving the best performance with limited resources is becoming an extremely urgent problem. In order to address this concern, in this paper, we build an optimization problem which…

Gradient networks can be used to model the dominant structure of complex networks. Previous works have focused on random gradient networks. Here we study gradient networks that minimize jamming on substrate networks with scale-free and…

This paper proposes a simplified version of classical models for urban transportation networks, and studies the problem of controlling intersections with the goal of optimizing network-wide congestion. Differently from traditional…

In this article, we propose the approach to structural optimization of neural networks, based on the braid theory. The paper describes the basics of braid theory as applied to the description of graph structures of neural networks. It is…

Coherent transport promises to be the basis for an emerging new technology. Notwithstanding, a mechanistic understanding of the fundamental principles behind optimal scattering media is still missing. Here, complex network analysis is…

Consider networks on $n$ vertices at average density 1 per unit area. We seek a network that minimizes total length subject to some constraint on journey times, averaged over source-destination pairs. Suppose journey times depend on both…

Modeling Internet growth is important both for understanding the current network and to predict and improve its future. To date, Internet models have typically attempted to explain a subset of the following characteristics: network…

This paper give a simple linear-time algorithm that, given a weighted digraph, finds a spanning tree that simultaneously approximates a shortest-path tree and a minimum spanning tree. The algorithm provides a continuous trade-off: given the…

We introduce evolving networks where new vertices preferentially connect to the more central parts of a network. This makes such networks compact. Finite networks grown under the preferential compactness mechanism have complex…

While operating communication networks adaptively may improve utilization and performance, frequent adjustments also introduce an algorithmic challenge: the re-optimization of traffic engineering solutions is time-consuming and may limit…

Mapping the Internet generally consists in sampling the network from a limited set of sources by using "traceroute"-like probes. This methodology, akin to the merging of different spanning trees to a set of destinations, has been argued to…