Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Link-identified Routing Architecture in Space

Hefan Zhang, Zhiyuan Wang, Shan Zhang, Qingkai Meng, Hongbin Luo

TL;DR

A Link-identified Routing (LiR) architecture for LEO satellite networks, which leverages the deterministic neighbor relation of LEO constellations, and identifies each inter-satellite link (ISL), and adopts source-route-style forwarding based on in-packet bloom filter.

Abstract

Low earth orbit (LEO) satellite networks have the potential to provide low-latency communication with global coverage. To unleash this potential, it is crucial to achieve efficient packet delivery. In this paper, we propose a Link-identified Routing (LiR) architecture for LEO satellite networks. The LiR architecture leverages the deterministic neighbor relation of LEO constellations, and identifies each inter-satellite link (ISL). Moreover, LiR architecture adopts source-route-style forwarding based on in-packet bloom filter (BF). Each satellite could efficiently encode multiple ISL identifiers via an in-packet BF to specify the end-to-end path for the packets. Due to false positives caused by BF, the more ISLs are encoded at a time, the more redundant forwarding cases emerge. Based on the topology characteristics, we derive the expected forwarding overhead in a closed-form and propose the optimal encoding policy. To accommodate link-state changes in LEO satellite networks, we propose the on-demand rerouting scheme and the on-demand detouring scheme to address the intermittent ISLs. We also elaborate how to take advantage of LiR architecture to achieve seamless handover for ground-satellite links (GSLs). Finally, we conduct extensive numerical experiments and packet-level simulations to verify our analytical results and evaluate the performance of the LiR architecture.

Link-identified Routing Architecture in Space

TL;DR

A Link-identified Routing (LiR) architecture for LEO satellite networks, which leverages the deterministic neighbor relation of LEO constellations, and identifies each inter-satellite link (ISL), and adopts source-route-style forwarding based on in-packet bloom filter.

Abstract

Low earth orbit (LEO) satellite networks have the potential to provide low-latency communication with global coverage. To unleash this potential, it is crucial to achieve efficient packet delivery. In this paper, we propose a Link-identified Routing (LiR) architecture for LEO satellite networks. The LiR architecture leverages the deterministic neighbor relation of LEO constellations, and identifies each inter-satellite link (ISL). Moreover, LiR architecture adopts source-route-style forwarding based on in-packet bloom filter (BF). Each satellite could efficiently encode multiple ISL identifiers via an in-packet BF to specify the end-to-end path for the packets. Due to false positives caused by BF, the more ISLs are encoded at a time, the more redundant forwarding cases emerge. Based on the topology characteristics, we derive the expected forwarding overhead in a closed-form and propose the optimal encoding policy. To accommodate link-state changes in LEO satellite networks, we propose the on-demand rerouting scheme and the on-demand detouring scheme to address the intermittent ISLs. We also elaborate how to take advantage of LiR architecture to achieve seamless handover for ground-satellite links (GSLs). Finally, we conduct extensive numerical experiments and packet-level simulations to verify our analytical results and evaluate the performance of the LiR architecture.

Paper Structure

This paper contains 43 sections, 3 theorems, 15 equations, 16 figures, 1 table, 1 algorithm.

Table of Contents

  1. Introduction
  2. Background and Motivation
  3. Main Results and Key Contributions
  4. Literature Review
  5. Source-Route-Style Forwarding in Satellite Networks
  6. BF-based Forwarding
  7. LiR Architecture for LEO Constellations
  8. ISL Identification for LEO Constellation
  9. BF-based Packet Forwarding
  10. Bloom Filter (BF)
  11. BF-based Forwarding
  12. Forwarding Performance Analysis
  13. Comparison Between LiR and SRv6
  14. How SRv6 Works
  15. How LiR Works
  16. ...and 28 more sections

Key Result

Theorem 1

Given a route with $N$ ISL identifiers encoded into an $M$-bit BF under $K$ independent hash functions, the expected incorrect forwarding overhead is given by where $p(N,M,K)$ denotes the false positive rate defined in (Equ: p), and $C$ denotes the volume of effective data in the packet.

Figures (16)

  • Figure 1: Illustration of BF-based forwarding under LiR
  • Figure 2: Illustration of incorrect packet forwarding
  • Figure 3: $f(N)$ given $K=5$
  • Figure 4: Illustration of SRv6.
  • Figure 5: Numerical results of LiR and SRv6
  • ...and 11 more figures

Theorems & Definitions (5)

  • Theorem 1
  • proof : Proof of Theorem \ref{['Theorem: incorrect']}
  • Theorem 2
  • Example 1
  • Lemma 1