Time-slot assignment for TDMA-systems
Computing
A time-wavelength assignment algorithm for a WDM star network
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Scheduling transmissions in WDM broadcast-and-select networks
IEEE/ACM Transactions on Networking (TON)
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)
Heuristics for Scheduling I/O Operations
IEEE Transactions on Parallel and Distributed Systems
A connection handover protocol for LEO satellite ATM networks
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Satellites free the mobile phone
IEEE Spectrum
Complexity of Minimum Length Scheduling for Precedence Constrained Messages in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
IEEE Journal on Selected Areas in Communications
An optimal packet scheduling and load balancing algorithm for LEO/MEO satellite networks
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Exchanging messages of different sizes
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Clusters of mobile (LEO) satellites, flying at a non-geostationary orbit, have been recently proposed, designed and made operational for achieving a global coverage of roaming users. An example of these is Teledesic. The satellites of these clusters are equipped with a radio frequency switch and connected via intersatellite links to form a specific topology. Uncoordinated packet transmission in these systems may result in collisions. Collided packets must be retransmitted, with an obvious degradation in performance, in terms of both bandwidth usage and delay. This performance degradation can be overcome by a proper scheduling of the packets. In this paper, we consider optimal (namely minimum length) packet scheduling in LEO satellite clusters. We present a preprocessing algorithm which, together with the optimal, polynomial time, packet scheduling algorithm for isolated satellites, produces an optimal schedule in tree-connected clusters. The overall algorithm inherit the time complexity of the optimal one for isolated systems, and is O(N4) for a cluster serving N roaming users.