Efficient scheduling algorithm for demand-assigned TDMA satellite systems
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 u...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on aerospace and electronic systems 1989-03, Vol.25 (2), p.259-267 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 267 |
|---|---|
| container_issue | 2 |
| container_start_page | 259 |
| container_title | IEEE transactions on aerospace and electronic systems |
| container_volume | 25 |
| creator | Durrani, S.H. Jo, K.Y. |
| description | 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.< > |
| doi_str_mv | 10.1109/7.18686 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_7_18686</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>18686</ieee_id><sourcerecordid>28944206</sourcerecordid><originalsourceid>FETCH-LOGICAL-c388t-cac6175af7f1b260585130f4b47d42679ee750b76176a15f54c73d200c8b90b73</originalsourceid><addsrcrecordid>eNqNkb1PwzAQxS0EEqUgZiSGTDCl2I4_x6oUqFTEUmbLcezWKB8llw7970kbJEY6ne7ud0_v9BC6JXhCCNZPckKUUOIMjQjnMtUCZ-dohDFRqaacXKIrgK--ZYplI7SYhxBd9HWXgNv4YlfGep3Yct20sdtUSWjapPCVrYvUAsR17Ytk9fw-TcB2vixj5xPYQ-cruEYXwZbgb37rGH2-zFezt3T58bqYTZepy5TqUmedIJLbIAPJqcBccZLhwHImC0aF1N5LjnPZQ8ISHjhzMisoxk7lup9nY_Qw6G7b5nvnoTNVBNd7sbVvdmCo0oxRLE4AqRJE6_9BTnSmOD4JxIIeFB8H0LUNQOuD2baxsu3eEGwOKRlpjin15P1A1hasqbsWDNFKY8wpZYdn74Z19N7_iRxPfwA8WJMC</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>25190629</pqid></control><display><type>article</type><title>Efficient scheduling algorithm for demand-assigned TDMA satellite systems</title><source>IEEE Electronic Library (IEL)</source><creator>Durrani, S.H. ; Jo, K.Y.</creator><creatorcontrib>Durrani, S.H. ; Jo, K.Y.</creatorcontrib><description>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.< ></description><identifier>ISSN: 0018-9251</identifier><identifier>EISSN: 1557-9603</identifier><identifier>DOI: 10.1109/7.18686</identifier><identifier>CODEN: IEARAX</identifier><language>eng</language><publisher>Legacy CDMS: IEEE</publisher><subject>Communications And Radar ; Satellite ground stations ; Scheduling algorithm ; Telecommunication traffic ; Throughput ; Time division multiple access ; Transponders</subject><ispartof>IEEE transactions on aerospace and electronic systems, 1989-03, Vol.25 (2), p.259-267</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c388t-cac6175af7f1b260585130f4b47d42679ee750b76176a15f54c73d200c8b90b73</citedby><cites>FETCH-LOGICAL-c388t-cac6175af7f1b260585130f4b47d42679ee750b76176a15f54c73d200c8b90b73</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/18686$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/18686$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Durrani, S.H.</creatorcontrib><creatorcontrib>Jo, K.Y.</creatorcontrib><title>Efficient scheduling algorithm for demand-assigned TDMA satellite systems</title><title>IEEE transactions on aerospace and electronic systems</title><addtitle>T-AES</addtitle><description>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.< ></description><subject>Communications And Radar</subject><subject>Satellite ground stations</subject><subject>Scheduling algorithm</subject><subject>Telecommunication traffic</subject><subject>Throughput</subject><subject>Time division multiple access</subject><subject>Transponders</subject><issn>0018-9251</issn><issn>1557-9603</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1989</creationdate><recordtype>article</recordtype><sourceid>CYI</sourceid><recordid>eNqNkb1PwzAQxS0EEqUgZiSGTDCl2I4_x6oUqFTEUmbLcezWKB8llw7970kbJEY6ne7ud0_v9BC6JXhCCNZPckKUUOIMjQjnMtUCZ-dohDFRqaacXKIrgK--ZYplI7SYhxBd9HWXgNv4YlfGep3Yct20sdtUSWjapPCVrYvUAsR17Ytk9fw-TcB2vixj5xPYQ-cruEYXwZbgb37rGH2-zFezt3T58bqYTZepy5TqUmedIJLbIAPJqcBccZLhwHImC0aF1N5LjnPZQ8ISHjhzMisoxk7lup9nY_Qw6G7b5nvnoTNVBNd7sbVvdmCo0oxRLE4AqRJE6_9BTnSmOD4JxIIeFB8H0LUNQOuD2baxsu3eEGwOKRlpjin15P1A1hasqbsWDNFKY8wpZYdn74Z19N7_iRxPfwA8WJMC</recordid><startdate>19890301</startdate><enddate>19890301</enddate><creator>Durrani, S.H.</creator><creator>Jo, K.Y.</creator><general>IEEE</general><scope>CYE</scope><scope>CYI</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>H8D</scope><scope>7TB</scope><scope>FR3</scope></search><sort><creationdate>19890301</creationdate><title>Efficient scheduling algorithm for demand-assigned TDMA satellite systems</title><author>Durrani, S.H. ; Jo, K.Y.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c388t-cac6175af7f1b260585130f4b47d42679ee750b76176a15f54c73d200c8b90b73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1989</creationdate><topic>Communications And Radar</topic><topic>Satellite ground stations</topic><topic>Scheduling algorithm</topic><topic>Telecommunication traffic</topic><topic>Throughput</topic><topic>Time division multiple access</topic><topic>Transponders</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Durrani, S.H.</creatorcontrib><creatorcontrib>Jo, K.Y.</creatorcontrib><collection>NASA Scientific and Technical Information</collection><collection>NASA Technical Reports Server</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Aerospace Database</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on aerospace and electronic systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Durrani, S.H.</au><au>Jo, K.Y.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Efficient scheduling algorithm for demand-assigned TDMA satellite systems</atitle><jtitle>IEEE transactions on aerospace and electronic systems</jtitle><stitle>T-AES</stitle><date>1989-03-01</date><risdate>1989</risdate><volume>25</volume><issue>2</issue><spage>259</spage><epage>267</epage><pages>259-267</pages><issn>0018-9251</issn><eissn>1557-9603</eissn><coden>IEARAX</coden><abstract>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.< ></abstract><cop>Legacy CDMS</cop><pub>IEEE</pub><doi>10.1109/7.18686</doi><tpages>9</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9251 |
| ispartof | IEEE transactions on aerospace and electronic systems, 1989-03, Vol.25 (2), p.259-267 |
| issn | 0018-9251 1557-9603 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_7_18686 |
| source | IEEE Electronic Library (IEL) |
| subjects | Communications And Radar Satellite ground stations Scheduling algorithm Telecommunication traffic Throughput Time division multiple access Transponders |
| title | Efficient scheduling algorithm for demand-assigned TDMA satellite systems |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T07%3A11%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Efficient%20scheduling%20algorithm%20for%20demand-assigned%20TDMA%20satellite%20systems&rft.jtitle=IEEE%20transactions%20on%20aerospace%20and%20electronic%20systems&rft.au=Durrani,%20S.H.&rft.date=1989-03-01&rft.volume=25&rft.issue=2&rft.spage=259&rft.epage=267&rft.pages=259-267&rft.issn=0018-9251&rft.eissn=1557-9603&rft.coden=IEARAX&rft_id=info:doi/10.1109/7.18686&rft_dat=%3Cproquest_RIE%3E28944206%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=25190629&rft_id=info:pmid/&rft_ieee_id=18686&rfr_iscdi=true |