Experimental validation of resilient tree-based greedy geometric routing
暂无分享,去创建一个
Wouter Tavernier | Didier Colle | Mario Pickavet | Sahel Sahhaf | Piet Demeester | P. Demeester | D. Colle | M. Pickavet | Sahel Sahhaf | W. Tavernier
[1] Robert D. Kleinberg. Geographic Routing Using Hyperbolic Space , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.
[2] Cédric Westphal,et al. Scalable routing easy as PIE: A practical isometric embedding protocol , 2011, 2011 19th IEEE International Conference on Network Protocols.
[3] Didier Colle,et al. Link failure recovery technique for greedy routing in the hyperbolic plane , 2013, Comput. Commun..
[4] Yehuda Afek,et al. Improved BGP convergence via ghost flushing , 2003, IEEE Journal on Selected Areas in Communications.
[5] Michael Menth,et al. A Survey of Mapping Systems for Locator/Identifier Split Internet Routing , 2013, IEEE Communications Surveys & Tutorials.
[6] Donald F. Towsley,et al. On distinguishing between Internet power law topology generators , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[7] Brad Karp,et al. GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.
[8] Roger Wattenhofer,et al. Greedy Routing with Bounded Stretch , 2009, IEEE INFOCOM 2009.
[9] Mark Crovella,et al. On the choice of a spanning tree for greedy embedding of network graphs , 2013 .
[10] Cédric Westphal,et al. Scalable Routing Via Greedy Embedding , 2009, IEEE INFOCOM 2009.
[11] Didier Colle,et al. Robust geometric forest routing with tunable load balancing , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).
[12] D. Saha,et al. On Suitability of Euclidean Embedding for Host-Based Network Coordinate Systems , 2010, IEEE/ACM Transactions on Networking.
[13] David Eppstein,et al. Succinct Greedy Geometric Routing Using Hyperbolic Geometry , 2011, IEEE Transactions on Computers.
[14] Marc St-Hilaire,et al. A Survey on Geographic Routing Protocols for Mobile Ad hoc Networks , 2011 .
[15] Mingdong Tang,et al. Tree Cover Based Geographic Routing with Guaranteed Delivery , 2010, 2010 IEEE International Conference on Communications.
[16] Didier Colle,et al. Fault-tolerant Greedy Forest Routing for complex networks , 2014, 2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM).
[17] G. Kirchhoff. Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird , 1847 .
[18] Minsu Huang,et al. Three-dimensional greedy routing in large-scale random wireless sensor networks , 2013, Ad Hoc Networks.
[19] Ruibing Hao,et al. The Optimal Rate-Limiting Timer of BGP for Routing Convergence , 2005, IEICE Trans. Commun..
[20] Didier Colle,et al. Single failure resiliency in greedy routing , 2013, 2013 9th International Conference on the Design of Reliable Communication Networks (DRCN).
[21] David E. Culler,et al. Beacon vector routing: scalable point-to-point routing in wireless sensornets , 2005, NSDI.
[22] Chen Qian,et al. Geographic routing in d-dimensional spaces with guaranteed delivery and low stretch , 2013, TNET.
[23] Christos H. Papadimitriou,et al. On a conjecture related to geometric routing , 2004, Theor. Comput. Sci..
[24] Mark Crovella,et al. Hyperbolic Embedding and Routing for Dynamic Graphs , 2009, IEEE INFOCOM 2009.
[25] Miguel Rio,et al. Tuning Topology Generators Using Spectral Distributions , 2008, SIPEW.