Optimal Local Routing Strategies for Community Structured Time Varying Communication Networks

Abstract : 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.
Type de document :
Communication dans un congrès
Cao, Yixin; Chen, Jianer. International Computing and Combinatorics Conference, Aug 2017, Hong Kong, China. Springer International Publishing, COCOON 2017: Computing and Combinatorics, 10392, pp.642-653, 2017, Lecture Notes in Computer Science book series (LNCS). 〈http://link.springer.com/10.1007/978-3-319-62389-4_53〉
Liste complète des métadonnées

https://hal-univ-bourgogne.archives-ouvertes.fr/hal-01627040
Contributeur : Le2i - Université de Bourgogne <>
Soumis le : mardi 31 octobre 2017 - 16:51:32
Dernière modification le : samedi 21 juillet 2018 - 13:54:01

Identifiants

  • HAL Id : hal-01627040, version 1

Collections

Citation

Suchi Kumari, Anurag Singh, Hocine Cherifi. Optimal Local Routing Strategies for Community Structured Time Varying Communication Networks. Cao, Yixin; Chen, Jianer. International Computing and Combinatorics Conference, Aug 2017, Hong Kong, China. Springer International Publishing, COCOON 2017: Computing and Combinatorics, 10392, pp.642-653, 2017, Lecture Notes in Computer Science book series (LNCS). 〈http://link.springer.com/10.1007/978-3-319-62389-4_53〉. 〈hal-01627040〉

Partager

Métriques

Consultations de la notice

85