Efficient Geometric Routing in Large-Scale Complex Networks with Low-Cost Node Design

Sahhaf, Seyedeh Sahel; Tavernier, Wouter; Colle, Didier; Pickavet, Mario; Demeester, Piet

doi:10.1587/transcom.2015ebp3268

Cited by 4 publications

(4 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This was also confirmed in GTR and WMGR schemes as the tree construction method (i.e., selection of the maximum degree node as the root and construction of a breadth-first-search tree) does not generate deep branches due to the short average distance between nodes in scale-free networks. This minimizes the memory requirements for coordinate representation and enables shorter paths [13].…”

Section: Gtr-wmgrmentioning

confidence: 99%

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: 99%

Routing at Large Scale: Advances and Challenges for Complex Networks

et al. 2017

Self Cite

View full text Add to dashboard Cite

show abstract

“…In order to bridge the gap between geometric routing in theory and its applicability in practice, we propose a hardware design of a greedy forwarder based on a simple greedy embedding. In [17,18], we investigated this embedding which is based on a single spanning tree. Despite its simplicity, good performance in terms of routing quality and convergence behavior was achieved.…”

Section: Related Workmentioning

confidence: 99%

“…It is worth mentioning that the performance of the tree-based greedy geometric routing scheme has been already evaluated in terms of routing quality and convergence behavior in case of network dynamics in our previous works [17,18]. The goal of this paper is to illustrate that a scalable all-optical greedy router can be implemented which enables high data rate throughput.…”

Section: Introductionmentioning

confidence: 99%

All-optical tree-based greedy router using optical logic gates and optical flip-flops

et al. 2017

Self Cite

View full text Add to dashboard Cite

Due to ever increasing throughput demands the lookup in conventional IP routers based on longest prefix matching is becoming a bottleneck. Additionally, the scalability of current routing protocols is limited by the size of the routing tables. Geometric greedy routing is an alternative to IP routing which replaces longest prefix matching with a simple calculation employing only local information for packet forwarding. For the first time, in this paper we propose a novel and truly alloptical geometric greedy router based on optical logic gates and optical flip-flops. The circuit of the router is constructed through the interconnection of SOAs and directional couplers. The successful functionality of the proposed router is verified through simulation. The circuit enables high data rate throughput.

show abstract

“…Since each node only stores its neighbors, and the greedy forwarding takes full use of the shortcuts [1] of the network topology, geometric routing guarantees both efficiency and scalability. Meanwhile, for some geometric routing schemes, such as PIE [2], prefix embedding [3], [4], the structure of coordinate is simple and succinct, which brings lightweight calculations.…”

Section: Introductionmentioning

confidence: 99%

Lightweight Anonymous Geometric Routing for Internet of Things

Sun¹,

Wang²,

Li³

et al. 2019

IEEE Access

View full text Add to dashboard Cite

Mobile service computing relies on efficient and secure data transfer. Geometric routing, which guarantees scalability, efficiency, and mobility, is a promising routing scheme for mobile services in the resource-constrained Internet of Things (IoT). However, the private data transmitted by geometric routing may be eavesdropped by the malicious node and the privacy-preserving becomes one of the important issues for the mobile service in IoTs. Due to the resource constrains, approaches using encryption or hashing are not suitable for geometric routing. In this paper, we propose a lightweight anonymous geometric routing (LAGER) to protect the node-related private data. Instead of using the encryption or hashing approach, LAGER adopts a coordinate confusion mechanism which provides each node an anonymous coordinate of virtual node, such that the private data is decoupled from the node coordinate. The malicious node cannot determine which node the data belongs to even if it obtains the private data. To support the data transmission with anonymous coordinates, LAGER adopts a hybrid routing scheme by combining the greedy routing and a source routing. The experiment results show that LAGER provides effective anonymity with acceptable costs of scalability and efficiency.

show abstract

Efficient Geometric Routing in Large-Scale Complex Networks with Low-Cost Node Design

Cited by 4 publications

References 26 publications

Routing at Large Scale: Advances and Challenges for Complex Networks

Routing at Large Scale: Advances and Challenges for Complex Networks

All-optical tree-based greedy router using optical logic gates and optical flip-flops

Lightweight Anonymous Geometric Routing for Internet of Things

Contact Info

Product

Resources

About