Shortest-path queries in static networks
C Sommer - ACM Computing Surveys (CSUR), 2014 - dl.acm.org
We consider the point-to-point (approximate) shortest-path query problem, which is the
following generalization of the classical single-source (SSSP) and all-pairs shortest-path …
following generalization of the classical single-source (SSSP) and all-pairs shortest-path …
Challenges and opportunities in green networking
A Clemm, C Westphal - 2022 IEEE 8th International …, 2022 - ieeexplore.ieee.org
Reducing mankind's carbon footprint and becoming more sustainable is rapidly becoming
one of the main challenges of our age. The networking industry needs to respond to those …
one of the main challenges of our age. The networking industry needs to respond to those …
Anonymous addresses for efficient and resilient routing in f2f overlays
Friend-to-friend (F2F) overlays, which restrict direct communication to mutually trusted
parties, are a promising substrate for privacy-preserving communication due to their inherent …
parties, are a promising substrate for privacy-preserving communication due to their inherent …
Geographic Routing in -Dimensional Spaces With Guaranteed Delivery and Low Stretch
Almost all geographic routing protocols have been designed for 2-D. We present a novel
geographic routing protocol, named Multihop Delaunay Triangulation (MDT), for 2-D, 3-D …
geographic routing protocol, named Multihop Delaunay Triangulation (MDT), for 2-D, 3-D …
LEO Satellite Networking Relaunched: Survey and Current Research Challenges
C Westphal, L Han, R Li - arXiv preprint arXiv:2310.07646, 2023 - arxiv.org
This document surveys recent and current developments in LEO satellite networking. It
presents a brief overview of satellite networking in order to contextualize the issue. It then …
presents a brief overview of satellite networking in order to contextualize the issue. It then …
Greedy embedding, routing and content addressing for darknets
To achieve anonymous and censorship-resistant overlay communication, darknets restrict
overlay links to trusted parties. Efficient data retrieval in such a restricted topology requires a …
overlay links to trusted parties. Efficient data retrieval in such a restricted topology requires a …
Lightweight anonymous geometric routing for Internet of Things
Mobile service computing relies on efficient and secure data transfer. Geometric routing,
which guarantees scalability, efficiency, and mobility, is a promising routing scheme for …
which guarantees scalability, efficiency, and mobility, is a promising routing scheme for …
Secure data sharing framework via hierarchical greedy embedding in darknets
Geometric routing, which combines greedy embedding and greedy forwarding, is a
promising approach for efficient data sharing in darknets. However, the security of data …
promising approach for efficient data sharing in darknets. However, the security of data …
Voute-virtual overlays using tree embeddings
Friend-to-friend (F2F) overlays, which restrict direct communication to mutually trusted
parties, are a promising substrate for privacy-preserving communication due to their inherent …
parties, are a promising substrate for privacy-preserving communication due to their inherent …
Experimental validation of resilient tree-based greedy geometric routing
Geometric routing is an alternative for IP routing based on longest prefix matching. Using
this routing paradigm, every node in the network is assigned a coordinate and packets are …
this routing paradigm, every node in the network is assigned a coordinate and packets are …