arXiv subjects

Satyam Mukherjee

Publications and source records attributed to Satyam Mukherjee.

21 records · Page 2Linked to original sources

arXiv2009

Queue-length synchronization in a communication networks

We study synchronization in the context of network traffic on a $2-d$ communication network with local clustering and geographic separations. The network consists of nodes and randomly distributed hubs where the top five hubs ranked according to their coefficient of betweenness centrality (CBC) are connected by random assortative and gradient mechanisms. For multiple message traffic, messages can trap at the high CBC hubs, and congestion can build up on the network with long queues at the congested hubs. The queue lengths are seen to synchronize in the congested phase. Both complete and phase synchronization is seen, between pairs of hubs. In the decongested phase, the pairs start clearing, and synchronization is lost. A cascading master-slave relation is seen between the hubs, with the slower hubs (which are slow to decongest) driving the faster ones. These are usually the hubs of high CBC. Similar results are seen for traffic of constant density. Total synchronization between the hubs of high CBC is also seen in the congested regime. Similar behavior is seen for traffic on a network constructed using the Waxman random topology generator. We also demonstrate the existence of phase synchronization in real Internet traffic data.

physics.soc-ph↗

arXiv2008

Message Transfer in a Communication Network

We study message transfer in a $2-d$ communication network of regular nodes and randomly distributed hubs. We study both single message transfer and multiple message transfer on the lattice. The average travel time for single messages travelling between source and target pairs of fixed separations shows $q-$exponential behaviour as a function of hub density with a characteristic power-law tail, indicating a rapid drop in the average travel time as a function of hub density. This power-law tail arises as a consequence of the log-normal distribution of travel times seen at high hub densities. When many messages travel on the lattice, a congestion-decongestion transition can be seen. The waiting times of messages in the congested phase show a Gaussian distribution, whereas the decongested phase shows a log-normal distribution. Thus, the congested or decongested behaviour is encrypted in the behaviour of the waiting time distributions.

physics.soc-ph↗

arXiv2007

The Gradient Mechanism in a Communication Network

We study the efficiency of the gradient mechanism of message transfer in a $2-d$ 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 time of single messages traveling on this lattice, plotted as a function of hub density, shows q-exponential behavior. At high hub densities, this distribution can be fitted well by a power law. 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 towards 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.

physics.soc-ph↗