Satyam Mukherjee
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Satyam Mukherjee has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Neelima Gupte
Department of Physics, Indian Institute of Technology, Madras, Chennai 600036, India
5 shared publications - Gautam Mukherjee1 shared publication
Neelima Gupte
Indian Institute of Technology Madras
1 shared publication
Latest Publications
- 20 April 2010
- Published by American Physical Society (APS) in Physical Review E
- Vol. 81 (4) , 046109
Statistical characterizers of transport in communication networks
We identify the statistical characterizers of congestion and decongestion for message transport in model communication lattices. These turn out to be the travel time distributions, which are Gaussian in the congested phase, and logarithmic normal in the decongested phase. Our results are demonstrated for two-dimensional lattices, such the Waxman graph, and for lattices with local clustering and geographic separations, gradient connections, as well as for a one-dimensional ring lattice with random assortative connections. The behavior of the distribution identifies the congested and decongested phase correctly for these distinct network topologies and decongestion strategies. The waiting time distributions of the systems also show identical signatures of the congested and decongested phases. The distributions are explained using a stochastic differential equation to model the transport.
- 20 April 2010
- Published by American Physical Society (APS) in Physical Review E
- Vol. 81 (4) , 046109
Statistical characterizers of transport in communication networks
We identify the statistical characterizers of congestion and decongestion for message transport in model communication lattices. These turn out to be the travel time distributions, which are Gaussian in the congested phase, and logarithmic normal in the decongested phase. Our results are demonstrated for two-dimensional lattices, such the Waxman graph, and for lattices with local clustering and geographic separations, gradient connections, as well as for a one-dimensional ring lattice with random assortative connections. The behavior of the distribution identifies the congested and decongested phase correctly for these distinct network topologies and decongestion strategies. The waiting time distributions of the systems also show identical signatures of the congested and decongested phases. The distributions are explained using a stochastic differential equation to model the transport.
- Open Access
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.Open AccessQueue-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. - 14 May 2009
- Published by American Physical Society (APS) in Physical Review E
- Vol. 79 (5) , 056105
Queue-length synchronization in communication networks
We study the synchronization in the context of network traffic on a 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 are 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.- 14 May 2009
- Published by American Physical Society (APS) in Physical Review E
- Vol. 79 (5) , 056105
Queue-length synchronization in communication networks
We study the synchronization in the context of network traffic on a 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 are 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.- Open Access
- 1 June 2008
- Published by Springer Nature in Pramana
- Vol. 70 (6) , 1109-1116
Message transfer in a communication network
- 1 June 2008
- Published by Springer Nature in Pramana
- Vol. 70 (6) , 1109-1116
Open AccessMessage transfer in a communication network
- 24 March 2008
- Published by American Physical Society (APS) in Physical Review E
- Vol. 77 (3) , 036121
Gradient mechanism in a communication network
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 -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.- 24 March 2008
- Published by American Physical Society (APS) in Physical Review E
- Vol. 77 (3) , 036121
Gradient mechanism in a communication network
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 -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.- Open Access
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.Open AccessThe 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.