FPC: A self-organized greedy routing in scale-free networks

Y. Wang Gaogang Xie Mohamed Ali Kaafar 1, *
* Auteur correspondant
1 PLANETE - Protocols and applications for the Internet
Inria Grenoble - Rhône-Alpes, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : In this paper, we propose FPC -- a Force-based layout and Path Compressing routing schema for scale-free network. As opposed to previous work, our algorithm employs a quasi-greedy but self-organized and configuration-free embedding method force based layout. In order to eliminate the negative influences of the "quasi" greedy property, we present a two-stage routing strategy, which combines the greedy routing with source routing. The greedy routing path discovered and compressed in a first stage is then used by the following source-routing stage. The detailed evaluation based on synthetic topologies as well as on a real Internet AS topology shows that: FPC guarantees 100% delivery rates on scale-free networks with an attractive low stretch (e.g. less than 1.2 on the real Internet AS topology).
Type de document :
Communication dans un congrès
Computers and Communications (ISCC), 2012 IEEE Symposium on, Jul 2012, Cappadocia, Turkey. pp.000102--000107, 2012, 〈http://doi.ieeecomputersociety.org/10.1109/ISCC.2012.6249275〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00748157
Contributeur : Mohamed Ali Kaafar <>
Soumis le : lundi 5 novembre 2012 - 06:42:51
Dernière modification le : jeudi 11 janvier 2018 - 16:21:48

Identifiants

  • HAL Id : hal-00748157, version 1

Collections

Citation

Y. Wang, Gaogang Xie, Mohamed Ali Kaafar. FPC: A self-organized greedy routing in scale-free networks. Computers and Communications (ISCC), 2012 IEEE Symposium on, Jul 2012, Cappadocia, Turkey. pp.000102--000107, 2012, 〈http://doi.ieeecomputersociety.org/10.1109/ISCC.2012.6249275〉. 〈hal-00748157〉

Partager

Métriques

Consultations de la notice

98