Generic Algorithm for Universal TDM Communication Over Inter Satellite Links
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908764663185408 |
|---|---|
| author | Popovic, Miroslav Popovic, Marko Vasiljevic, Pavle Basicevic, Ilija |
| author_facet | Popovic, Miroslav Popovic, Marko Vasiljevic, Pavle Basicevic, Ilija |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_08034 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Generic Algorithm for Universal TDM Communication Over Inter Satellite Links Popovic, Miroslav Popovic, Marko Vasiljevic, Pavle Basicevic, Ilija Distributed, Parallel, and Cluster Computing 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. |
| title | Generic Algorithm for Universal TDM Communication Over Inter Satellite Links |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2511.08034 |