Optimal energy efficient packet scheduling with arbitrary individual deadline guarantee
Given a rate adaptive wireless transmitter, a challenging problem is to design a rate control policy for it such that the energy consumption is minimized at transmitting a set of dynamically arrived packets with arbitrary individual deadlines. In a decade, researches have partially made progress on...
Gespeichert in:
| Veröffentlicht in: | Computer networks (Amsterdam, Netherlands : 1999) Netherlands : 1999), 2014-12, Vol.75, p.351-366 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 366 |
|---|---|
| container_issue | |
| container_start_page | 351 |
| container_title | Computer networks (Amsterdam, Netherlands : 1999) |
| container_volume | 75 |
| creator | Shan, Feng Luo, Junzhou Shen, Xiaojun |
| description | Given a rate adaptive wireless transmitter, a challenging problem is to design a rate control policy for it such that the energy consumption is minimized at transmitting a set of dynamically arrived packets with arbitrary individual deadlines. In a decade, researches have partially made progress on this topic. A latest work offers an optimal algorithm that allows packets to have arbitrary deadlines but requires them to follow the order they arrive. This paper first presents the Densest Interval First (DIF) policy which repeatedly locates the densest data interval and determines its transmission rate. This policy is proved to be optimal for the most general model that allows arbitrary arrival times as well as arbitrary deadlines. Then, this paper presents a simple EDF (earliest deadline first) algorithm to actually schedule the transmission time for each packet. It is proved that the EDF always guarantees every packet to complete transmission before its deadline with minimum energy consumption which is computed and required by DIF. Finally, this paper also proposes a novel online policy named Density Guided Cooling (DGC) policy which models Newton’s Law of Cooling. Simulations show that online DGC policy constantly produces a rate scheduling that on average consumes energy within 110% of the minimum value obtained by the offline DIF. |
| doi_str_mv | 10.1016/j.comnet.2014.10.022 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1660074746</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S1389128614003843</els_id><sourcerecordid>3513053921</sourcerecordid><originalsourceid>FETCH-LOGICAL-c397t-5d0120be69eef5b6ef54211d9fe35e0e70922b88c65d19031e143dccfe809a8b3</originalsourceid><addsrcrecordid>eNp9kE1LxDAQhosoqKv_wENBBC9dJ2maJhdBxC8QvCgeQ5pMd7N22zVJV_bfm2XFgwcvmTA878zwZNkZgSkBwq8WUzMse4xTCoSl1hQo3cuOiKhpUQOX--lfClkQKvhhdhzCAgAYo-Ioe39ZRbfUXY49-tkmx7Z1xmEf85U2HxjzYOZox871s_zLxXmufeOi136Tu966tbNjClvUNiGYz0btdR8RT7KDVncBT3_qJHu7v3u9fSyeXx6ebm-eC1PKOhaVBUKhQS4R26rh6WGUECtbLCsErEFS2ghheGWJhJIgYaU1pkUBUoumnGSXu7krP3yOGKJaumCw63SPwxgU4RygZjXjCT3_gy6G0ffpukRRWYqSgkwU21HGDyF4bNXKJ0F-owiorW21UDvbamt72022U-ziZ7gORndtsmBc-M1SCRUIBom73nGYpKwdehW2ug1a59FEZQf3_6JvPyiX0w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1629383209</pqid></control><display><type>article</type><title>Optimal energy efficient packet scheduling with arbitrary individual deadline guarantee</title><source>ScienceDirect Journals (5 years ago - present)</source><creator>Shan, Feng ; Luo, Junzhou ; Shen, Xiaojun</creator><creatorcontrib>Shan, Feng ; Luo, Junzhou ; Shen, Xiaojun</creatorcontrib><description>Given a rate adaptive wireless transmitter, a challenging problem is to design a rate control policy for it such that the energy consumption is minimized at transmitting a set of dynamically arrived packets with arbitrary individual deadlines. In a decade, researches have partially made progress on this topic. A latest work offers an optimal algorithm that allows packets to have arbitrary deadlines but requires them to follow the order they arrive. This paper first presents the Densest Interval First (DIF) policy which repeatedly locates the densest data interval and determines its transmission rate. This policy is proved to be optimal for the most general model that allows arbitrary arrival times as well as arbitrary deadlines. Then, this paper presents a simple EDF (earliest deadline first) algorithm to actually schedule the transmission time for each packet. It is proved that the EDF always guarantees every packet to complete transmission before its deadline with minimum energy consumption which is computed and required by DIF. Finally, this paper also proposes a novel online policy named Density Guided Cooling (DGC) policy which models Newton’s Law of Cooling. Simulations show that online DGC policy constantly produces a rate scheduling that on average consumes energy within 110% of the minimum value obtained by the offline DIF.</description><identifier>ISSN: 1389-1286</identifier><identifier>EISSN: 1872-7069</identifier><identifier>DOI: 10.1016/j.comnet.2014.10.022</identifier><language>eng</language><publisher>Kidlington: Elsevier B.V</publisher><subject>Algorithms ; Applied sciences ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Cooling ; Data transmission ; Deadline guarantee ; Deadlines ; Densest interval first ; Energy consumption ; Energy efficiency ; Energy policy ; Exact sciences and technology ; Intervals ; Network flow problem ; Optimization ; Optimization algorithms ; Packet transmission ; Policies ; Radiocommunications ; Rate control ; Scheduling algorithm ; Scheduling algorithms ; Simulation ; Software ; Studies ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Teletraffic ; Wireless communication</subject><ispartof>Computer networks (Amsterdam, Netherlands : 1999), 2014-12, Vol.75, p.351-366</ispartof><rights>2014 Elsevier B.V.</rights><rights>2015 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Dec 24, 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c397t-5d0120be69eef5b6ef54211d9fe35e0e70922b88c65d19031e143dccfe809a8b3</citedby><cites>FETCH-LOGICAL-c397t-5d0120be69eef5b6ef54211d9fe35e0e70922b88c65d19031e143dccfe809a8b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.comnet.2014.10.022$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=29050840$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Shan, Feng</creatorcontrib><creatorcontrib>Luo, Junzhou</creatorcontrib><creatorcontrib>Shen, Xiaojun</creatorcontrib><title>Optimal energy efficient packet scheduling with arbitrary individual deadline guarantee</title><title>Computer networks (Amsterdam, Netherlands : 1999)</title><description>Given a rate adaptive wireless transmitter, a challenging problem is to design a rate control policy for it such that the energy consumption is minimized at transmitting a set of dynamically arrived packets with arbitrary individual deadlines. In a decade, researches have partially made progress on this topic. A latest work offers an optimal algorithm that allows packets to have arbitrary deadlines but requires them to follow the order they arrive. This paper first presents the Densest Interval First (DIF) policy which repeatedly locates the densest data interval and determines its transmission rate. This policy is proved to be optimal for the most general model that allows arbitrary arrival times as well as arbitrary deadlines. Then, this paper presents a simple EDF (earliest deadline first) algorithm to actually schedule the transmission time for each packet. It is proved that the EDF always guarantees every packet to complete transmission before its deadline with minimum energy consumption which is computed and required by DIF. Finally, this paper also proposes a novel online policy named Density Guided Cooling (DGC) policy which models Newton’s Law of Cooling. Simulations show that online DGC policy constantly produces a rate scheduling that on average consumes energy within 110% of the minimum value obtained by the offline DIF.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Cooling</subject><subject>Data transmission</subject><subject>Deadline guarantee</subject><subject>Deadlines</subject><subject>Densest interval first</subject><subject>Energy consumption</subject><subject>Energy efficiency</subject><subject>Energy policy</subject><subject>Exact sciences and technology</subject><subject>Intervals</subject><subject>Network flow problem</subject><subject>Optimization</subject><subject>Optimization algorithms</subject><subject>Packet transmission</subject><subject>Policies</subject><subject>Radiocommunications</subject><subject>Rate control</subject><subject>Scheduling algorithm</subject><subject>Scheduling algorithms</subject><subject>Simulation</subject><subject>Software</subject><subject>Studies</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Teletraffic</subject><subject>Wireless communication</subject><issn>1389-1286</issn><issn>1872-7069</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LxDAQhosoqKv_wENBBC9dJ2maJhdBxC8QvCgeQ5pMd7N22zVJV_bfm2XFgwcvmTA878zwZNkZgSkBwq8WUzMse4xTCoSl1hQo3cuOiKhpUQOX--lfClkQKvhhdhzCAgAYo-Ioe39ZRbfUXY49-tkmx7Z1xmEf85U2HxjzYOZox871s_zLxXmufeOi136Tu966tbNjClvUNiGYz0btdR8RT7KDVncBT3_qJHu7v3u9fSyeXx6ebm-eC1PKOhaVBUKhQS4R26rh6WGUECtbLCsErEFS2ghheGWJhJIgYaU1pkUBUoumnGSXu7krP3yOGKJaumCw63SPwxgU4RygZjXjCT3_gy6G0ffpukRRWYqSgkwU21HGDyF4bNXKJ0F-owiorW21UDvbamt72022U-ziZ7gORndtsmBc-M1SCRUIBom73nGYpKwdehW2ug1a59FEZQf3_6JvPyiX0w</recordid><startdate>20141224</startdate><enddate>20141224</enddate><creator>Shan, Feng</creator><creator>Luo, Junzhou</creator><creator>Shen, Xiaojun</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>E3H</scope><scope>F2A</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>7TB</scope><scope>FR3</scope></search><sort><creationdate>20141224</creationdate><title>Optimal energy efficient packet scheduling with arbitrary individual deadline guarantee</title><author>Shan, Feng ; Luo, Junzhou ; Shen, Xiaojun</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c397t-5d0120be69eef5b6ef54211d9fe35e0e70922b88c65d19031e143dccfe809a8b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Cooling</topic><topic>Data transmission</topic><topic>Deadline guarantee</topic><topic>Deadlines</topic><topic>Densest interval first</topic><topic>Energy consumption</topic><topic>Energy efficiency</topic><topic>Energy policy</topic><topic>Exact sciences and technology</topic><topic>Intervals</topic><topic>Network flow problem</topic><topic>Optimization</topic><topic>Optimization algorithms</topic><topic>Packet transmission</topic><topic>Policies</topic><topic>Radiocommunications</topic><topic>Rate control</topic><topic>Scheduling algorithm</topic><topic>Scheduling algorithms</topic><topic>Simulation</topic><topic>Software</topic><topic>Studies</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Teletraffic</topic><topic>Wireless communication</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Shan, Feng</creatorcontrib><creatorcontrib>Luo, Junzhou</creatorcontrib><creatorcontrib>Shen, Xiaojun</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Library & Information Sciences Abstracts (LISA)</collection><collection>Library & Information Science Abstracts (LISA)</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>Mechanical & Transportation Engineering Abstracts</collection><collection>Engineering Research Database</collection><jtitle>Computer networks (Amsterdam, Netherlands : 1999)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Shan, Feng</au><au>Luo, Junzhou</au><au>Shen, Xiaojun</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal energy efficient packet scheduling with arbitrary individual deadline guarantee</atitle><jtitle>Computer networks (Amsterdam, Netherlands : 1999)</jtitle><date>2014-12-24</date><risdate>2014</risdate><volume>75</volume><spage>351</spage><epage>366</epage><pages>351-366</pages><issn>1389-1286</issn><eissn>1872-7069</eissn><abstract>Given a rate adaptive wireless transmitter, a challenging problem is to design a rate control policy for it such that the energy consumption is minimized at transmitting a set of dynamically arrived packets with arbitrary individual deadlines. In a decade, researches have partially made progress on this topic. A latest work offers an optimal algorithm that allows packets to have arbitrary deadlines but requires them to follow the order they arrive. This paper first presents the Densest Interval First (DIF) policy which repeatedly locates the densest data interval and determines its transmission rate. This policy is proved to be optimal for the most general model that allows arbitrary arrival times as well as arbitrary deadlines. Then, this paper presents a simple EDF (earliest deadline first) algorithm to actually schedule the transmission time for each packet. It is proved that the EDF always guarantees every packet to complete transmission before its deadline with minimum energy consumption which is computed and required by DIF. Finally, this paper also proposes a novel online policy named Density Guided Cooling (DGC) policy which models Newton’s Law of Cooling. Simulations show that online DGC policy constantly produces a rate scheduling that on average consumes energy within 110% of the minimum value obtained by the offline DIF.</abstract><cop>Kidlington</cop><pub>Elsevier B.V</pub><doi>10.1016/j.comnet.2014.10.022</doi><tpages>16</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1389-1286 |
| ispartof | Computer networks (Amsterdam, Netherlands : 1999), 2014-12, Vol.75, p.351-366 |
| issn | 1389-1286 1872-7069 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1660074746 |
| source | ScienceDirect Journals (5 years ago - present) |
| subjects | Algorithms Applied sciences Computer science control theory systems Computer systems and distributed systems. User interface Cooling Data transmission Deadline guarantee Deadlines Densest interval first Energy consumption Energy efficiency Energy policy Exact sciences and technology Intervals Network flow problem Optimization Optimization algorithms Packet transmission Policies Radiocommunications Rate control Scheduling algorithm Scheduling algorithms Simulation Software Studies Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Teletraffic Wireless communication |
| title | Optimal energy efficient packet scheduling with arbitrary individual deadline guarantee |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T09%3A06%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimal%20energy%20efficient%20packet%20scheduling%20with%20arbitrary%20individual%20deadline%20guarantee&rft.jtitle=Computer%20networks%20(Amsterdam,%20Netherlands%20:%201999)&rft.au=Shan,%20Feng&rft.date=2014-12-24&rft.volume=75&rft.spage=351&rft.epage=366&rft.pages=351-366&rft.issn=1389-1286&rft.eissn=1872-7069&rft_id=info:doi/10.1016/j.comnet.2014.10.022&rft_dat=%3Cproquest_cross%3E3513053921%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1629383209&rft_id=info:pmid/&rft_els_id=S1389128614003843&rfr_iscdi=true |