{"id":"https://openalex.org/W2117366124","doi":"https://doi.org/10.1109/infcom.2011.5934920","title":"Energy-aware scheduling algorithms for network stability","display_name":"Energy-aware scheduling algorithms for network stability","publication_year":2011,"publication_date":"2011-04-01","ids":{"openalex":"https://openalex.org/W2117366124","doi":"https://doi.org/10.1109/infcom.2011.5934920","mag":"2117366124"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2011.5934920","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2011.5934920","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077188973","display_name":"Matthew Andrews","orcid":"https://orcid.org/0000-0002-0977-9685"},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Matthew Andrews","raw_affiliation_strings":["Bell Laboratories, Murray Hill, NJ, USA","Bell Lab., Murray Hill, NJ (USA)"],"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Murray Hill, NJ, USA","institution_ids":[]},{"raw_affiliation_string":"Bell Lab., Murray Hill, NJ (USA)","institution_ids":["https://openalex.org/I72090969"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079501848","display_name":"Spyridon Antonakopoulos","orcid":null},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Spyridon Antonakopoulos","raw_affiliation_strings":["Bell Laboratories, Murray Hill, NJ, USA","Bell Lab., Murray Hill, NJ (USA)"],"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Murray Hill, NJ, USA","institution_ids":[]},{"raw_affiliation_string":"Bell Lab., Murray Hill, NJ (USA)","institution_ids":["https://openalex.org/I72090969"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103087443","display_name":"Lisa Zhang","orcid":"https://orcid.org/0000-0001-6054-2176"},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lisa Zhang","raw_affiliation_strings":["Bell Laboratories, Murray Hill, NJ, USA","Bell Lab., Murray Hill, NJ (USA)"],"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Murray Hill, NJ, USA","institution_ids":[]},{"raw_affiliation_string":"Bell Lab., Murray Hill, NJ (USA)","institution_ids":["https://openalex.org/I72090969"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5077188973"],"corresponding_institution_ids":["https://openalex.org/I72090969"],"apc_list":null,"apc_paid":null,"fwci":4.008,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.93905067,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"1","issue":null,"first_page":"1359","last_page":"1367"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8174434304237366},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.6664418578147888},{"id":"https://openalex.org/keywords/energy-consumption","display_name":"Energy consumption","score":0.6502479910850525},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6315268278121948},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5440906286239624},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.5348917841911316},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.46629565954208374},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.45464026927948},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3904590606689453},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3726657032966614},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35991543531417847},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08414047956466675},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07791286706924438}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8174434304237366},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6664418578147888},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.6502479910850525},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6315268278121948},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5440906286239624},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.5348917841911316},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.46629565954208374},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.45464026927948},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3904590606689453},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3726657032966614},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35991543531417847},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08414047956466675},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07791286706924438},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infcom.2011.5934920","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2011.5934920","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.683.4765","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.683.4765","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.greentouch.org/uploads/documents/Energy+Aware+Scheduling+for+Network+Stability+-+Infocom+2011.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.9100000262260437,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1523209876","https://openalex.org/W1963656977","https://openalex.org/W2005012890","https://openalex.org/W2021724654","https://openalex.org/W2073078076","https://openalex.org/W2099961254","https://openalex.org/W2112694890","https://openalex.org/W2138779116","https://openalex.org/W2152025418","https://openalex.org/W2160091270","https://openalex.org/W2169741605","https://openalex.org/W2176566884","https://openalex.org/W3163287424","https://openalex.org/W4238270389","https://openalex.org/W4239139364","https://openalex.org/W4246623841","https://openalex.org/W6631527149","https://openalex.org/W6641009288","https://openalex.org/W6646201544","https://openalex.org/W6668949099"],"related_works":["https://openalex.org/W2195904091","https://openalex.org/W2365647353","https://openalex.org/W2381415338","https://openalex.org/W4385401023","https://openalex.org/W2365404242","https://openalex.org/W2044363610","https://openalex.org/W4214715787","https://openalex.org/W2363056536","https://openalex.org/W2029548118","https://openalex.org/W2295575944"],"abstract_inverted_index":{"A":[0],"key":[1],"problem":[2],"in":[3,29,77,141,239],"the":[4,13,17,109,117,125,134,185,223,229,240,256,273],"control":[5],"of":[6,32,79,137,147,222,247,255,272],"packet-switched":[7],"data":[8,14],"networks":[9],"is":[10,44,63,108,113,250],"to":[11,96,115],"schedule":[12],"so":[15],"that":[16,35,52,112,130,168,189,249],"queue":[18,43,67,160,173],"sizes":[19],"remain":[20],"bounded":[21,253],"over":[22,216],"time.":[23],"Scheduling":[24],"algorithms":[25],"have":[26],"been":[27],"developed":[28],"a":[30,57,83,90,103,138,151,170,181,197,206,220,252,259],"number":[31],"different":[33],"models":[34],"ensure":[36],"network":[37,118,199,241],"stability":[38,238],"as":[39,41,69,71],"long":[40],"no":[42],"inherently":[45],"overloaded.":[46],"However,":[47],"this":[48,62,121],"literature":[49],"typically":[50],"assumes":[51],"each":[53],"server":[54,86,140,156],"runs":[55],"at":[56,89,93],"fixed":[58],"maximum":[59],"speed.":[60],"Although":[61],"optimal":[64],"for":[65],"clearing":[66],"backlogs":[68],"fast":[70],"possible,":[72],"it":[73],"may":[74],"be":[75,192],"suboptimal":[76],"terms":[78],"energy":[80,111,176,248],"consumption.":[81],"Indeed,":[82],"lightly":[84],"loaded":[85],"could":[87],"operate":[88],"lower":[91,182],"rate,":[92],"least":[94],"temporarily,":[95],"save":[97],"energy.":[98],"Within":[99],"an":[100,245,270],"energy-aware":[101],"framework,":[102],"natural":[104],"question":[105],"arises:":[106],"\"What":[107],"minimum":[110],"required":[114],"keep":[116],"stable?\"":[119],"In":[120,205,258],"paper,":[122],"we":[123,143,195,218,268],"demonstrate":[124],"following":[126],"results":[127],"towards":[128],"answering":[129],"question.":[131],"Starting":[132],"with":[133,228],"simplest":[135],"case":[136],"single":[139],"isolation,":[142],"consider":[144],"three":[145],"types":[146],"rate":[148,225,288],"adaptation":[149,226],"policies:":[150],"heuristic":[152],"policy,":[153],"which":[154],"sets":[155],"speed":[157],"depending":[158],"on":[159,184],"size":[161,174],"only,":[162],"and":[163,175,201,280],"two":[164,203],"more":[165],"complex":[166],"ones":[167],"exhibit":[169],"tradeoff":[171,188],"between":[172],"usage.":[177],"We":[178],"also":[179],"present":[180],"bound":[183],"best":[186],"such":[187],"can":[190,213],"possibly":[191],"achieved.":[193],"Next,":[194],"study":[196],"general":[198],"environment":[200],"investigate":[202],"scenarios.":[204],"temporary":[207],"sessions":[208,261],"scenario,":[209,262],"where":[210,263],"connection":[211,264],"paths":[212,265],"rapidly":[214],"change":[215],"time,":[217],"propose":[219],"combination":[221],"above":[224],"policies":[227],"standard":[230],"Farthest-to":[231],"Go":[232],"scheduling":[233,278],"algorithm.":[234],"This":[235],"approach":[236],"provides":[237],"setting,":[242],"while":[243],"using":[244],"amount":[246],"within":[251],"factor":[254],"optimum.":[257],"permanent":[260],"are":[266,285],"fixed,":[267],"examine":[269],"analogue":[271],"well-known":[274],"Weighted":[275],"Fair":[276],"Queueing":[277],"policy":[279],"show":[281],"how":[282],"delay":[283],"bounds":[284],"affected":[286],"under":[287],"adaptation.":[289]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}