A parallel algorithm for time-slot assignment problems in TDM hierarchical switching systems
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 42 (10) , 2890-2898
- https://doi.org/10.1109/26.328959
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- A parallel algorithm for broadcast scheduling problems in packet radio networksIEEE Transactions on Communications, 1993
- Comparisons of seven neural network models on traffic control problems in multistage interconnection networksIEEE Transactions on Computers, 1993
- A neural network model for finding a near-maximum cliqueJournal of Parallel and Distributed Computing, 1992
- A neural network parallel algorithm for clique vertex-partition problemsInternational Journal of Electronics, 1992
- Time Slot Assignment in SS/TDMA Systems with Intersatellite LinksIEEE Transactions on Communications, 1987
- Minimizing the Number of Switchings in an SS/TDMA SystemIEEE Transactions on Communications, 1985
- Scheduling in Multibeam Satellites with Interfering ZonesIEEE Transactions on Communications, 1983
- SS/TDMA Time Slot Assignment with Restricted Switching ModesIEEE Transactions on Communications, 1983
- An Optimal Switching Algorithm for Multibeam Satellite Systems with Variable Bandwidth BeamsIEEE Transactions on Communications, 1982
- An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of TranspondersIEEE Transactions on Communications, 1981