2,563 research outputs found
Greedy routing and virtual coordinates for future networks
At the core of the Internet, routers are continuously struggling with
ever-growing routing and forwarding tables. Although hardware advances
do accommodate such a growth, we anticipate new requirements e.g. in
data-oriented networking where each content piece has to be referenced
instead of hosts, such that current approaches relying on global
information will not be viable anymore, no matter the hardware
progress. In this thesis, we investigate greedy routing methods that
can achieve similar routing performance as today but use much less
resources and which rely on local information only. To this end, we
add specially crafted name spaces to the network in which virtual
coordinates represent the addressable entities. Our scheme enables participating
routers to make forwarding decisions using only neighbourhood information,
as the overarching pseudo-geometric name space structure already
organizes and incorporates "vicinity" at a global level.
A first challenge to the application of greedy routing on virtual
coordinates to future networks is that of "routing dead-ends"
that are local minima due to the difficulty of consistent coordinates
attribution. In this context, we propose a routing recovery scheme
based on a multi-resolution embedding of the network in low-dimensional Euclidean spaces.
The recovery is performed by routing greedily on a blurrier view of the network. The
different network detail-levels are obtained though the embedding of
clustering-levels of the graph. When compared with
higher-dimensional embeddings of a given network, our method shows a
significant diminution of routing failures for similar header and
control-state sizes.
A second challenge to the application of virtual coordinates and
greedy routing to future networks is the support of
"customer-provider" as well as "peering" relationships between
participants, resulting in a differentiated services
environment. Although an application of greedy routing within such a
setting would combine two very common fields of today's networking
literature, such a scenario has, surprisingly, not been studied so
far. In this context we propose two approaches to address this scenario.
In a first approach we implement a path-vector protocol similar to
that of BGP on top of a greedy embedding of the network. This allows
each node to build a spatial map associated with each of its
neighbours indicating the accessible regions. Routing is then
performed through the use of a decision-tree classifier taking the
destination coordinates as input. When applied on a real-world dataset
(the CAIDA 2004 AS graph) we demonstrate an up to 40% compression ratio of
the routing control information at the network's core as well as a computationally efficient
decision process comparable to methods such as binary trees and tries.
In a second approach, we take inspiration from consensus-finding in social
sciences and transform the three-dimensional distance data structure
(where the third dimension encodes the service differentiation) into a
two-dimensional matrix on which classical embedding tools can be used.
This transformation is achieved by agreeing on a set of
constraints on the inter-node distances guaranteeing an
administratively-correct greedy routing. The computed distances are
also enhanced to encode multipath support. We demonstrate a good
greedy routing performance as well as an above 90% satisfaction of multipath constraints
when relying on the non-embedded obtained distances on synthetic datasets.
As various embeddings of the consensus distances do not fully exploit their multipath potential, the use of compression techniques such as transform coding to
approximate the obtained distance allows for better routing performances
Towards Energy Efficient LPWANs through Learning-based Multi-hop Routing
Low-power wide area networks (LPWANs) have been identified as one of the top
emerging wireless technologies due to their autonomy and wide range of
applications. Yet, the limited energy resources of battery-powered sensor nodes
is a top constraint, especially in single-hop topologies, where nodes located
far from the base station must conduct uplink (UL) communications in high power
levels. On this point, multi-hop routings in the UL are starting to gain
attention due to their capability of reducing energy consumption by enabling
transmissions to closer hops. Nonetheless, a priori identifying energy
efficient multi-hop routings is not trivial due to the unpredictable factors
affecting the communication links in large LPWAN areas. In this paper, we
propose epsilon multi-hop (EMH), a simple reinforcement learning (RL) algorithm
based on epsilon-greedy to enable reliable and low consumption LPWAN multi-hop
topologies. Results from a real testbed show that multi-hop topologies based on
EMH achieve significant energy savings with respect to the default single-hop
approach, which are accentuated as the network operation progresses
Building Robust Distributed Infrastructure Networks
Many competing designs for Distributed Hash Tables exist exploring multiple models of addressing, routing and network maintenance. Designing a general theoretical model and implementation of a Distributed Hash Table allows exploration of the possible properties of Distributed Hash Tables. We will propose a generalized model of DHT behavior, centered on utilizing Delaunay triangulation in a given metric space to maintain the networks topology. We will show that utilizing this model we can produce network topologies that approximate existing DHT methods and provide a starting point for further exploration. We will use our generalized model of DHT construction to design and implement more efficient Distributed Hash Table protocols, and discuss the qualities of potential successors to existing DHT technologies
Classification of networks-on-chip in the context of analysis of promising self-organizing routing algorithms
This paper contains a detailed analysis of the current state of the
network-on-chip (NoC) research field, based on which the authors propose the
new NoC classification that is more complete in comparison with previous ones.
The state of the domain associated with wireless NoC is investigated, as the
transition to these NoCs reduces latency. There is an assumption that routing
algorithms from classical network theory may demonstrate high performance. So,
in this article, the possibility of the usage of self-organizing algorithms in
a wireless NoC is also provided. This approach has a lot of advantages
described in the paper. The results of the research can be useful for
developers and NoC manufacturers as specific recommendations, algorithms,
programs, and models for the organization of the production and technological
process.Comment: 10 p., 5 fig. Oral presentation on APSSE 2021 conferenc
Architectures for the Future Networks and the Next Generation Internet: A Survey
Networking research funding agencies in the USA, Europe, Japan, and other countries are encouraging research on revolutionary networking architectures that may or may not be bound by the restrictions of the current TCP/IP based Internet. We present a comprehensive survey of such research projects and activities. The topics covered include various testbeds for experimentations for new architectures, new security mechanisms, content delivery mechanisms, management and control frameworks, service architectures, and routing mechanisms. Delay/Disruption tolerant networks, which allow communications even when complete end-to-end path is not available, are also discussed
- …