An efficient scheduling algorithm (stations burst plan) for demand-assigned time-division multiple-access (TDMA) satellite network systems is introduced. The total demand for transmitting data through a transponder may exceed the available bit-rate capacity, and a scheduler of the system wishes to utilize the system with minimum changes of slot allocations while maximizing throughputs. By implementing such a burst-plan algorithm, transmission of all demanded data traffic can be completed with minimum unused resources (idle slots). The underlying ideas adopted for the algorithm are that jobs with shorter remaining processing times should have higher priorities and that as many jobs are processed at a time as possible. The algorithm is particularly useful for deriving smooth burst plans for a satellite system with a large number of ground stations.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Efficient scheduling algorithm for demand-assigned TDMA satellite systems


    Contributors:
    Durrani, S.H. (author) / Jo, K.Y. (author)


    Publication date :

    1989-03-01


    Size :

    678954 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Demand Assigned TDMA system for digitally integrated services network

    KOHIYAMA, K. / WATANABE, Y. / SAMEJIMA, S. et al. | AIAA | 1980



    Demand-Assigned TDMA System for a Digitally Integrated Services Network

    Yoshio Watanabe / Shuichi Samejima / Shuzo Kato et al. | AIAA | 1981


    Performance of fully variable demand assignment SS/TDMA satellite systems

    MARAL, G. / BOUSQUET, M. / WATTIER, P. | AIAA | 1986