Geometric Routing With Word-Metric Spaces

No abstract is available for this paper.

• Publication year

  2014

• Venue

  IEEE Communications Letters

• Publication date

  2014-10-21

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/LCOMM.2014.2364213
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Compact Routing Schemes

  2016cited by this paper
• Succinct Greedy Geometric Routing Using Hyperbolic Geometry

  2011cited by this paper
• Hyperbolic Embedding and Routing for Dynamic Graphs

  2009cited by this paper
• Greedy Routing with Bounded Stretch

  2009cited by this paper
• Greedy Drawings of Triangulations

  2008cited by this paper
• Space efficient and time optimal distributed BFS tree construction

  2008cited by this paper
• Geographic Routing Using Hyperbolic Space

  2007influential reference
• On compact routing for the internet

  2007cited by this paper
• The Diameter of a Scale-Free Random Graph

  2004cited by this paper
• On a conjecture related to geometric routing

  2004cited by this paper
• Geometric ad-hoc routing: of theory and practice

  2003cited by this paper
• Emergence of Scaling in Random Networks

  1999cited by this paper
• Computation with finitely presented groups

  1994cited by this paper

• Efficiency of a New Iterative Algorithm Using Fixed-Point Approach in the Settings of Uniformly Convex Banach Spaces

  2024cites this paper
• A Modified Iterative Approach for Fixed Point Problem in Hadamard Spaces

  2024cites this paper
• Strong and Δ-Convergence Fixed-Point Theorems Using Noor Iterations

  2023cites this paper
• Routing in Strongly Hyperbolic Unit Disk Graphs

  2021cites this paper
• Strongly Hyperbolic Unit Disk Graphs

  2021cites this paper
• WMGR: A Generic and Compact Routing Scheme for Data Center Networks

  2018cites this paper
• Greedy Embedding Strategy for Dynamic Graphs Based on Spanning Tree

  2018cites this paper
• Succinct and practical greedy embedding for geometric routing

  2017cites this paper
• Routing at Large Scale: Advances and Challenges for Complex Networks

  2017cites this paper
• Applying clique-decomposition for computing Gromov hyperbolicity

  2017cites this paper
• Metric properties of large graphs

  2016cites this paper
• Data center interconnection networks are not hyperbolic

  2016cites this paper
• Liens entre symétries et étirements de routages dans les réseaux d'interconnexions de centres de données

  2016cites this paper
• A geometric routing scheme in word-metric spaces for data networks

  2014cites this paper