2012 IEEE Symposium on Computers and Communications (ISCC) (2012)
July 1, 2012 to July 4, 2012
Yonggong Wang , Institute of Computing Technology, Chinese Academy of Sciences, Beijing, P.R. China
Gaogang Xie , Institute of Computing Technology, Chinese Academy of Sciences, Beijing, P.R. China
Mohamed-Ali Kaafar , INRIA Rhône-Alpes, Grenoble, France
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).
Scale-free network, Greedy routing, Self-organized, Path compression
Y. Wang, G. Xie and M. Kaafar, "FPC: A self-organized greedy routing in scale-free networks," 2012 IEEE Symposium on Computers and Communications (ISCC), Cappadocia Turkey, 2012, pp. 000102-000107.