Abstract :
Based on network circulation formulation, the existence of feasible beam-to-beam switching modes for a satellite-switched time-division multiple access system is completely and transparently proved, where simultaneous transmissions on several carriers in each spot-beam are configured. Showing the linear independence of all but one augmented switching modes, a new bound of mn+2 is obtained on the number of switching modes, where m and n are the number of up-link and down-link beams, respectively. The time complexity for finding the whole sequence of switching modes and for finding the initial switching mode are improved to O(m2n2) and O(min(√K,(m+n)23/)mn), respectively. Practical implementation considerations are discussed.
Keywords :
combinatorial mathematics; computational complexity; linear algebra; satellite communication; scheduling; telecommunication switching; time division multiple access; beam-to-beam switching modes; combinatorial mathematics; downlink modes; general switching modes; linear algebra approach; satellite-switched time-division multiple access scheduling; spot-beam; time complexity; uplink modes; Application software; Communication switching; Complexity theory; Linear algebra; Mathematics; Processor scheduling; Satellite communication; Structural beams; Telecommunication traffic; Time division multiple access; Combinatorial mathematics; communication switching; complexity theory; linear algebra; networks; satellite communication; scheduling; time-division switching;
