Related papers: Predicting Network Congestion by Extending Between…
We study the emergence of congestion patterns in urban networks by modeling vehicular interaction by means of a simple traffic rule and by using a set of measures inspired by the standard Betweenness Centrality (BC). We consider a…
We study network traffic dynamics in a two dimensional communication network with regular nodes and hubs. If the network experiences heavy message traffic, congestion occurs due to finite capacity of the nodes. We discuss strategies to…
We study network traffic dynamics in a two dimensional communication network with regular nodes and hubs. If the network experiences heavy message traffic, congestion occurs due to finite capacity of the nodes. We discuss strategies to…
Most of the real world networks are complex as well as evolving. Therefore, it is important to study the effect of network topology on the dynamics of traffic and congestion in the network. To account this problem, we have designed a…
The emergence of congestion is a critical phenomenon in transport systems. Transport is organized along pathways abstracted by links, which connect different nodes as regions to form the network. The modeling of traffic has so far mainly…
Preventing traffic congestion by forecasting near time traffic flows is an important problem as it leads to effective use of transport resources. Social network provides information about activities of humans and social events. Thus, with…
The congestion formation on a urban road network is one of the key issue for the development of a sustainable mobility in the future smart cities. In this work we propose a reductionist approach studying the stationary states of a simple…
The central points of communication network flow has often been identified using graph theoretical centrality measures. In real networks, the state of traffic density arises from an interplay between the dynamics of the flow and the…
We demonstrate that the distribution of betweenness centrality (BC), a global structural metric based on network flow, is an invariant quantity in most planar graphs. We confirm this invariance through an empirical analysis of street…
The betweenness centrality (BC) is an important quantity for understanding the structure of complex large networks. However, its calculation is in general difficult and known in simple cases only. In particular, the BC has been exactly…
This paper presents a new Compressive Sensing (CS) scheme for detecting network congested links. We focus on decreasing the required number of measurements to detect all congested links in the context of network tomography. We have expanded…
Traffic congestion is one of the most notable problems arising in worldwide urban areas, importantly compromising human mobility and air quality. Current technologies to sense real-time data about cities, and its open distribution for…
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…
We study a minimal model of traffic flows in complex networks, simple enough to get analytical results, but with a very rich phenomenology, presenting continuous, discontinuous as well as hybrid phase transitions between a free-flow phase…
One abstract method for the study of network transportation is proposed in this paper. By interpolating the properties of the edges that constitute network into the two leading parameters of the nodes, this method can abstract the…
Widespread use of computer networks and the use of varied technology for the interconnection of computers has made congestion a significant problem. In this report, we summarize our research on congestion avoidance. We compare the concept…
Traffic congestion at intersections is a significant issue in urban areas, leading to increased commute times, safety hazards, and operational inefficiencies. This study aims to develop a predictive model for congestion at intersections in…
We study the evolution of the fastest paths (FP) in transportation networks under increasing congestion. Moving from the common edge-based to a path-based analysis, we examine the directed FPs connecting random origin-destination pairs as…
All the existing real world networks are evolving, hence, study of traffic dynamics in these enlarged networks is a challenging task. The critical issue is to optimize the network structure to improve network capacity and avoid traffic…
Betweenness centrality (BC) was proposed as an indicator of the extent of an individual's influence in a social network. It is measured by counting how many times a vertex (i.e., an individual) appears on all the shortest paths between…