MARS: A Multi-Attribute Routing and Scheduling Algorithm for DTN Interplanetary Networks

The Interplanetary Network (IPN) or the Interplanetary Internet is a network composed of interconnected space objects, which are in turn connected to mission control stations on the surface of Earth. The IPN is our only portal to the deep space, and yet it has been relatively sparse, until recently....

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE/ACM transactions on networking Ročník 28; číslo 5; s. 2065 - 2076
Hlavní autoři: El Alaoui, Sara, Ramamurthy, Byrav
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.10.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Aerospace electronics
Algorithms
Buffers
contact Graph Routing
Decision making
Deep space
Delay Tolerant Networking
Delays
Earth surface
Integer programming
Interplanetary communication
Interplanetary Networks
Joint Scheduling and Routing
Linear programming
MADM
Mars
Messages
Mixed integer
Mixed Integer Linear Programming
Multi-Attribute Routing and Scheduling
Multiple Attribute Decision Making
PROMETHEE II
Routing
Routing protocols
Satellite Communication
Schedules
Scheduling
Space missions
ISSN:1063-6692, 1558-2566
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The Interplanetary Network (IPN) or the Interplanetary Internet is a network composed of interconnected space objects, which are in turn connected to mission control stations on the surface of Earth. The IPN is our only portal to the deep space, and yet it has been relatively sparse, until recently. With the ongoing and the planned missions to the outer space, the Delay Tolerant Networking (DTN) based network infrastructure will require more scalable routing and scheduling algorithms. In this paper, we propose the first Mixed Integer Linear Programming (MILP) model for message routing and scheduling in the IPN using Multi-Attribute Decision Making (MADM) principles. Based on this model, we propose a novel MADM-based algorithm called Multi-Attribute Routing and Scheduling (MARS) algorithm. This algorithm uses a sliding window of size <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula> to schedule the first <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula> messages in the buffer based on multiple attributes. After finding the optimal schedule for these messages (in terms of delivery rate), they are routed using our proposed Dijkstra-based routing algorithm. We use an existing MADM technique, PROMETHEE II, and consider the four main attributes of a message: size, priority, time to live (TTL), and time in buffer (TiB). Finally, we run multiple simulation experiments in order to test the performance of the proposed MARS and show that MADM coupled with scheduling and routing in IPN delivers at least three times more messages than a previously proposed technique, the Contact Graph Routing (CGR), while significantly reducing the average end-to-end delay and overhead.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2020.3008630