Your Mega-Constellations Can Be Slim:A Cost-Effective Approach for Constructing Survivable and Performant LEO Satellite Networks

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Lai, Zeqi, Wang, Yibo, Li, Hewu, Wu, Qian, Zhang, Qi, Hou, Yunan, Liu, Jun, Li, Yuanjie
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866913417445507072
author Lai, Zeqi
Wang, Yibo
Li, Hewu
Wu, Qian
Zhang, Qi
Hou, Yunan
Liu, Jun
Li, Yuanjie
author_facet Lai, Zeqi
Wang, Yibo
Li, Hewu
Wu, Qian
Zhang, Qi
Hou, Yunan
Liu, Jun
Li, Yuanjie
contents In this paper, we investigate an important research problem facing the upcoming satellite Internet: from a network perspective, how many satellites exactly do we need to construct a survivable and performant LSN? To answer this question, we first formulate the survivable and performant LSN design (SPLD) problem, which aims to find the minimum number of needed satellites to construct an LSN that can provide sufficient amount of redundant paths, required link capacity and acceptable latency for traffic carried by the LSN. Second, to efficiently solve the tricky SPLD problem, we propose MEGAREDUCE, a requirement-driven constellation optimization mechanism, which can calculate feasible solutions for SPLD in polynomial time. Finally, we conduct extensive trace-driven simulations to verify MEGAREDUCE's cost-effectiveness in constructing survivable and performant LSNs on demand, and showcase how MEGAREDUCE can help optimize the incremental deployment and long-term maintenance of future satellite Internet.
format Preprint
id arxiv_https___arxiv_org_abs_2407_03799
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Your Mega-Constellations Can Be Slim:A Cost-Effective Approach for Constructing Survivable and Performant LEO Satellite Networks
Lai, Zeqi
Wang, Yibo
Li, Hewu
Wu, Qian
Zhang, Qi
Hou, Yunan
Liu, Jun
Li, Yuanjie
Networking and Internet Architecture
In this paper, we investigate an important research problem facing the upcoming satellite Internet: from a network perspective, how many satellites exactly do we need to construct a survivable and performant LSN? To answer this question, we first formulate the survivable and performant LSN design (SPLD) problem, which aims to find the minimum number of needed satellites to construct an LSN that can provide sufficient amount of redundant paths, required link capacity and acceptable latency for traffic carried by the LSN. Second, to efficiently solve the tricky SPLD problem, we propose MEGAREDUCE, a requirement-driven constellation optimization mechanism, which can calculate feasible solutions for SPLD in polynomial time. Finally, we conduct extensive trace-driven simulations to verify MEGAREDUCE's cost-effectiveness in constructing survivable and performant LSNs on demand, and showcase how MEGAREDUCE can help optimize the incremental deployment and long-term maintenance of future satellite Internet.
title Your Mega-Constellations Can Be Slim:A Cost-Effective Approach for Constructing Survivable and Performant LEO Satellite Networks
topic Networking and Internet Architecture
url https://arxiv.org/abs/2407.03799