Satyam Mukherjee

We study the efficiency of the gradient mechanism of message transfer in a two-dimensional communication network of regular nodes and randomly distributed hubs. Each hub on the network is assigned some randomly chosen capacity and hubs with lower capacities are connected to the hubs with maximum capacity. The average travel times of single messages traveling on the lattice decrease rapidly as the number of hubs increase. The functional dependence of the average travel times on the hub density shows q-exponential behavior with a power-law tail. We also study the relaxation behavior of the network when a large number of messages are created simultaneously at random locations and travel on the network toward their designated destinations. For this situation, in the absence of the gradient mechanism, the network can show congestion effects due to the formation of transport traps. We show that if hubs of high betweenness centrality are connected by the gradient mechanism, efficient decongestion can be achieved. The gradient mechanism is less prone to the formation of traps than other decongestion schemes. We also study the spatial configurations of transport traps and propose minimal strategies for their elimination.