Generic Algorithm for Universal TDM Communication Over Inter Satellite Links

TL;DR

This paper introduces a new generic algorithm for Time Division Multiplexing (TDM) communication that enables a satellite node to communicate with multiple peers simultaneously, overcoming previous pairwise limitations in federated learning frameworks.

Contribution

The paper presents a novel universal TDM algorithm that supports multi-peer communication, backed by theoretical, system design, and validation work, suitable for inter-satellite links.

Findings

Supports multi-peer TDM communication in satellite networks

Theoretical foundation established for the algorithm

System validated for real-world inter-satellite links

Abstract

The original Python Testbed for Federated Learning Algorithms is a light FL framework, which provides the three generic algorithms: the centralized federated learning, the decentralized federated learning, and the TDM communication (i.e., peer data exchange) in the current time slot. The limitation of the latter is that it allows communication only between pairs of network nodes. This paper presents the new generic algorithm for the universal TDM communication that overcomes this limitation, such that a node can communicate with an arbitrary number of peers (assuming the peers also want to communicate with it). The paper covers: (i) the algorithm's theoretical foundation, (ii) the system design, and (iii) the system validation. The main advantage of the new algorithm is that it supports real-world TDM communications over inter satellite links.