Community structured time varying communication networks

Abstract

Traffic congestion and system utility maximization are the prominent issues for modern time varying communication networks (TVCN). These issues can be resolved by optimizing the network structure and by selecting efficient routing approaches. We focus on the design of a time varying network model by considering all the aspect of growth, rearrangement and removal of connections in the network. Centrality plays a very important role in finding congestion free routes. 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 (CC) outperforms betweenness centrality (BC) in the case of community structured time varying networks. Furthermore, Kelly's optimization formulation is used in order to compute optimal rates of distinct users.