Optimal Local Routing Strategies for Community Structured Time Varying Communication Networks

In time varying data communication networks (TVCN), traffic congestion, system utility maximization and network performance enhancement are the prominent issues. All these issues can be resolved either by optimizing the network structure or by selecting efficient routing approaches. In this paper, we focus on the design of a time varying network model and propose an algorithm to find efficient user route in this network. Centrality plays a very important role in finding congestion free routes. Indeed, the more a node is central, the more it can be congested by the flow coming from or going to its neighborhood. For that reason, classically, routes are chosen such that the sum of centrality of the nodes coming in user's route is minimum. In this paper, we show that closeness centrality outperforms betweenness centrality in the case of community structured time varying networks. Furthermore, Kelly's optimization formulation for a rate allocation problem is used in order to compute optimal rates of distinct users at different time instants.