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

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).

[1]  Wen-Xu Wang,et al.  Self-organized emergence of navigability on small-world networks , 2010, ArXiv.

[2]  Cédric Westphal,et al.  Scalable Routing Via Greedy Embedding , 2009, IEEE INFOCOM 2009.

[3]  Roger Wattenhofer,et al.  Greedy Routing with Bounded Stretch , 2009, IEEE INFOCOM 2009.

[4]  David E. Culler,et al.  Beacon vector routing: scalable point-to-point routing in wireless sensornets , 2005, NSDI.

[5]  Zhi-Li Zhang,et al.  VIRO: A scalable, robust and namespace independent virtual Id routing for future networks , 2011, 2011 Proceedings IEEE INFOCOM.

[6]  Dominique Barthel,et al.  Centroid virtual coordinates - A novel near-shortest path routing paradigm , 2009, Comput. Networks.

[7]  Jon M. Kleinberg,et al.  Navigation in a small world , 2000, Nature.

[8]  Robert Tappan Morris,et al.  Greedy Virtual Coordinates for Geographic Routing , 2007, 2007 IEEE International Conference on Network Protocols.

[9]  Mark Crovella,et al.  Hyperbolic Embedding and Routing for Dynamic Graphs , 2009, IEEE INFOCOM 2009.

[10]  Robert D. Kleinberg.  Geographic Routing Using Hyperbolic Space , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[11]  Peter Eades,et al.  A Heuristic for Graph Drawing , 1984 .

[12]  Lixia Zhang,et al.  Report from the IAB Workshop on Routing and Addressing , 2007, RFC.

[13]  Marián Boguñá,et al.  Navigability of Complex Networks , 2007, ArXiv.

[14]  David E. Culler,et al.  Beacon vector routing: Scalable point-to-point in wireless sensornets , 2004 .

[15]  Cédric Westphal,et al.  Scalable routing easy as PIE: A practical isometric embedding protocol , 2011, 2011 19th IEEE International Conference on Network Protocols.

[16]  Petar Maymounkov,et al.  Greedy Embeddings , Trees , and Euclidean vs . Lobachevsky Geometry , 2006 .

[17]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[18]  David Eppstein,et al.  Succinct Greedy Graph Drawing in the Hyperbolic Plane , 2008, GD.

[19]  Pramod K. Varshney,et al.  A survey of void handling techniques for geographic routing in wireless networks , 2007, IEEE Communications Surveys & Tutorials.

[20]  Scott Shenker,et al.  Geographic routing without location information , 2003, MobiCom '03.