Name
Abstract | ||
|---|---|---|
A computer-aided approach to the planning of SS/TDMA network operation is proposed. SS/TDMA is a sophisticated satellite communication network based on an onboard switch matrix, whose operation planning is formulated as a large-scale scheduling problem. An overall planning and scheduling model is presented to deal with practical SS/TDMA systems, such as a two-frequency channel network and nondisjoint beam coverage. For systematic planning suitable for a computer-aided approach, the entire scheduling process is divided into several steps, for each of which an efficient mathematical model is proposed. A linear programming model is used for distribution of traffic on a beam-to-beam basis and the generated switching sequence is further refined by a model using the traveling salesman problem. Burst scheduling is carried out by the Bin packing algorithm and scheduling models for practical networks allowing transponder hopping and multidestination bursts. An algorithm called enhanced rescheduling is presented to further improve the scheduling capability of the existing methods. The performance of the proposed methods is demonstrated by simulation results |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1109/49.64902 | Selected Areas in Communications, IEEE Journal |
Keywords | Field | DocType |
satellite relay systems,scheduling,switching systems,telecommunication network management,telecommunication traffic,telecommunications computing,time division multiple access,Bin packing algorithm,SS/TDMA network operation,computer-aided planning,enhanced rescheduling,large-scale scheduling,linear programming model,multidestination bursts,nondisjoint beam coverage,onboard switch matrix,satellite communication network,traffic distribution,transponder hopping,traveling salesman problem,two-frequency channel network | Job shop scheduling,Fair-share scheduling,Scheduling (computing),Computer science,Computer network,Two-level scheduling,Real-time computing,Rate-monotonic scheduling,Dynamic priority scheduling,Time division multiple access,Round-robin scheduling | Journal |
Volume | Issue | ISSN |
9 | 1 | 0733-8716 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mizuike, T. | 1 | 0 | 0.34 |
| Ito, Y. | 2 | 54 | 6.22 |
| Nguyen, L.N. | 3 | 4 | 1.17 |
| Maeda, E. | 4 | 0 | 0.34 |