Time-slot assignment for TDMA-systems
Computing
Polynomial time optimal algorithms for time slot assignment of variable bandwidth systems
IEEE/ACM Transactions on Networking (TON)
Scheduling variable-length messages in a single-hop multichannel local lightwave network
IEEE/ACM Transactions on Networking (TON)
Efficient scheduling of transmissions in optical broadcast networks
IEEE/ACM Transactions on Networking (TON)
Complexity of Minimum Length Scheduling for Precedence Constrained Messages in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Satellite grouping and routing protocol for LEO/MEO satellite IP networks
WOWMOM '02 Proceedings of the 5th ACM international workshop on Wireless mobile multimedia
InterPlaNetary internet: state-of-the-art and research challenges
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal packet scheduling in tree-structured LEO satellite clusters
Mobile Networks and Applications
TP-planet: a reliable transport protocol for interplanetary Internet
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
LEO/MEO constellations of communication satellites have recently been proposed as a powerful tool for improving internet performance and for extending it beyond the earth (InterPlanetary Internet). Several aspects of such usage must still be investigated. Among them, proper routing and MAC protocols play a prominent role. In this paper,we assume that the MAC protocol is an MF/TDMA one (as usual in satellite communication), and we consider the problem of assigning packets to a set of shortest paths in a satellite constellation, with the goal of minimizing the overall packet scheduling problem. We present an optimal polynomial time algorithm which works offline and balances the load over all possible shortest paths, allowing a minimum schedule length for the entire constellation to be found in polynomial time.