Geometric Routing With Word-Metric Spaces

Camelo, Miguel; Papadimitriou, Dimitri; Fàbrega, Lluís; Vilà, Pere

doi:10.1109/lcomm.2014.2364213

Cited by 10 publications

(11 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Simulation/emulation outcomes support the memory-advantage of both GTR and WMGR, but clearly indicate the resulting cost in the recovery domain [5,6]. Similar to other greedy routing schemes, the RT size is bounded by the maximum vertex degree.…”

Section: Gtr-wmgrmentioning

confidence: 65%

“…All schemes rely on embeddings into metric spaces to assign coordinates to nodes that are used as locators to perform point-to-point routing decisions in this space. 16 Geometric Tree-Based Greedy Routing (GTR) and Word-Metric-Based Greedy Routing (WMGR): GTR [5] and WMGR [6] comprise two components: greedy embedding and greedy routing/forwarding. The greedy embedding scheme finds a mapping between nodes and coordinates in a metric space in such a way that there is always a distance-decreasing neighbor toward any destination in the network.…”

Section: This Mechanism First Finds a Path S-a-b-c-d-e-fg-tmentioning

confidence: 99%

“…5 Schemes that maintain the path information to reach a destination. 6 A routing paradigm that derives paths based on locators. Particularly it enables routing the packets based on addresses that are specific to the network location instead of relying on any arbitrary flat address space.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Routing at Large Scale: Advances and Challenges for Complex Networks

et al. 2017

Self Cite

View full text Add to dashboard Cite

A wide range of social, technological and communication systems can be described as complex networks. Scale-free networks are one of the well known classes of complex networks in which nodes' degrees follow a power-law distribution. The design of scalable, adaptive and resilient routing schemes in such networks is very challenging. In this article we present an overview of required routing functionality, categorize the potential design dimensions of routing protocols among existing routing schemes, and analyze experimental results and analytical studies performed so far to identify the main trends/trade-offs and draw main conclusions. Besides traditional schemes such as hierarchical/shortest-path path-vector routing, the article pays attention to advances in compact routing and geometric routing since they are known to significantly improve scalability in terms of memory space. The identified trade-offs and the outcomes of this overview enable more careful conclusions regarding the (un-)suitability of different routing schemes to large-scale complex networks and provide a guideline for future routing research. IntroductIonComplex networks refer to large, dynamic networks consisting of potentially billions of nodes and links that are used to describe a wide range of social, biological, technological and communication systems. Scale-free networks as one well known/much studied class of complex networks have degree distribution 1 that follows a power-law function. In such networks, new nodes attach preferentially to already well-connected nodes. The network of autonomous systems 2 (ASes) forming the core of the Internet graph, is an example of such networks. 3 Routing 4 in these networks is challenging because of the size of the network, and the properties and performance expected from these networks, particularly, anyto-any connectivity, availability, and reliability.Routing research has evolved very pragmatically in communication networks from small scale to larger scale in technologies including wireless, ad-hoc/sensor networks, the Internet, and so on.Since new networks of increasing scale are popping up every day (e.g., Internet of Things), it is important to consider clean-slate approaches considering the entire design space of routing paradigms to avoid getting "trapped" again in legacy protocols/paradigms. In this article we try to open this design question by clearly and cautiously categorizing/grouping the potential design dimensions of routing protocols among existing routing schemes (traditional schemes as well as novel ones), analyzing experimental results performed so far, and drawing some main conclusions, guidelines and open challenges for routing schemes in future settings.This article synthesizes the fundamental aspects of routing schemes for complex networks, as well as lessons learned from experimental routing research stemming from the EULER project (http://www.euler-fire-project.eu/). Particular attention will be given to:• New classes of path-based routing schemes 5 .• New routing par...

show abstract

Section: Gtr-wmgrmentioning

confidence: 65%

Section: This Mechanism First Finds a Path S-a-b-c-d-e-fg-tmentioning

confidence: 99%

See 1 more Smart Citation

Routing at Large Scale: Advances and Challenges for Complex Networks

et al. 2017

Self Cite

View full text Add to dashboard Cite

show abstract

“…Then, nodes forward data packets to their adjacent node that is the nearest to the destination in the metric space.In our scheme, graphs are embedded into Word-Metric Spaces while much of the research works in GR focus on the Euclidean [19], [20] and Hyperbolic [21], [22] spaces. These works, however, have some of the following problems: 1) they do not guarantee packet delivery, or 2) they are not scalable in space and/or [15,Sec. I]).…”

Section: Routing Schemes Based On Permutation-sort For Cayley Graph (Cg)mentioning

confidence: 99%

“…In this paper, we present the Word-Metric-based Greedy Routing (WMGR), a routing scheme that is compact and independent of the DCN topology. Our scheme extends and enhances the Greedy Routing (GR) scheme, introduced for the Internet in [15]. In the WMGR scheme, nodes are assigned to coordinates in the Word-Metric Space (WMS) of an algebraic group.…”

mentioning

confidence: 99%

WMGR: A Generic and Compact Routing Scheme for Data Center Networks

Aguirre-Guerrero

Camelo

Fàbrega

et al. 2018

IEEE/ACM Trans. Networking

Self Cite

View full text Add to dashboard Cite

Data center networks (DCNs) connect hundreds and thousands of computers and, as a result of the exponential growth in their number of nodes, the design of scalable (compact) routing schemes plays a pivotal role in the optimal operation of the DCN. Traditional trends in the design of DCN architectures have led to solutions, where routing schemes and network topologies are interdependent, i.e., specialized routing schemes. Unlike these, we propose a routing scheme that is compact and generic, i.e., independent of the DCN topology, the word-metric-based greedy routing. In this scheme, each node is assigned to a coordinate (or label) in the word-metric space (WMS) of an algebraic group and then nodes forward packets to the closest neighbor to the destination in this WMS. We evaluate our scheme and compare it with other routing schemes in several topologies. We prove that the memory space requirements in nodes and the forwarding decision time grow sub-linearly (with respect to n, the number of nodes) in all of these topologies. The scheme finds the shortest paths in topologies based on Cayley graphs and trees (e.g. Fat tree), while in the rest of topologies, the length of any path is stretched by a factor that grows logarithmically (with respect to n). Moreover, the simulation results show that many of the paths remain far below this upper bound.

show abstract