{"id":"https://openalex.org/W2473347075","doi":"https://doi.org/10.4018/ijgc.2015070102","title":"Green Routing Algorithm for Wired Networks","display_name":"Green Routing Algorithm for Wired Networks","publication_year":2015,"publication_date":"2015-07-01","ids":{"openalex":"https://openalex.org/W2473347075","doi":"https://doi.org/10.4018/ijgc.2015070102","mag":"2473347075"},"language":"en","primary_location":{"id":"doi:10.4018/ijgc.2015070102","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijgc.2015070102","pdf_url":null,"source":{"id":"https://openalex.org/S4210190456","display_name":"International Journal of Green Computing","issn_l":"1948-5018","issn":["1948-5018","1948-5026"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Green Computing","raw_type":"journal-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/A5018303960","display_name":"Akshay Atul Deshmukh","orcid":null},"institutions":[{"id":"https://openalex.org/I11880225","display_name":"National Institute of Technology Karnataka","ror":"https://ror.org/01hz4v948","country_code":"IN","type":"education","lineage":["https://openalex.org/I11880225"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Akshay Atul Deshmukh","raw_affiliation_strings":["Computer Science and Engineering Department, National Institute of Technology Karnataka, Surathkal, India"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, National Institute of Technology Karnataka, Surathkal, India","institution_ids":["https://openalex.org/I11880225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090225389","display_name":"Mintu Jothish","orcid":null},"institutions":[{"id":"https://openalex.org/I11880225","display_name":"National Institute of Technology Karnataka","ror":"https://ror.org/01hz4v948","country_code":"IN","type":"education","lineage":["https://openalex.org/I11880225"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Mintu Jothish","raw_affiliation_strings":["Computer Science and Engineering Department, National Institute of Technology Karnataka, Surathkal, India"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, National Institute of Technology Karnataka, Surathkal, India","institution_ids":["https://openalex.org/I11880225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069939036","display_name":"K. Chandrasekaran","orcid":"https://orcid.org/0000-0001-5904-1753"},"institutions":[{"id":"https://openalex.org/I11880225","display_name":"National Institute of Technology Karnataka","ror":"https://ror.org/01hz4v948","country_code":"IN","type":"education","lineage":["https://openalex.org/I11880225"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"K. Chandrasekaran","raw_affiliation_strings":["National Institute of Technology Karnataka, Surathkal, India"],"affiliations":[{"raw_affiliation_string":"National Institute of Technology Karnataka, Surathkal, India","institution_ids":["https://openalex.org/I11880225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5018303960"],"corresponding_institution_ids":["https://openalex.org/I11880225"],"apc_list":null,"apc_paid":null,"fwci":0.1973,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62374127,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"6","issue":"2","first_page":"16","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9997000098228455,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9994000196456909,"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.7972865700721741},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6557759642601013},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6426243782043457},{"id":"https://openalex.org/keywords/open-shortest-path-first","display_name":"Open Shortest Path First","score":0.6043704152107239},{"id":"https://openalex.org/keywords/the-internet","display_name":"The Internet","score":0.5619215369224548},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.5608615875244141},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5150689482688904},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.49392133951187134},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4786747097969055},{"id":"https://openalex.org/keywords/flooding","display_name":"Flooding (psychology)","score":0.4677904546260834},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4541182518005371},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.34573209285736084},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.16905632615089417},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14355793595314026},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.08570596575737}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7972865700721741},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6557759642601013},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6426243782043457},{"id":"https://openalex.org/C70522964","wikidata":"https://www.wikidata.org/wiki/Q220169","display_name":"Open Shortest Path First","level":5,"score":0.6043704152107239},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.5619215369224548},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.5608615875244141},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5150689482688904},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.49392133951187134},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4786747097969055},{"id":"https://openalex.org/C186594467","wikidata":"https://www.wikidata.org/wiki/Q1429176","display_name":"Flooding (psychology)","level":2,"score":0.4677904546260834},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4541182518005371},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.34573209285736084},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.16905632615089417},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14355793595314026},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08570596575737},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4018/ijgc.2015070102","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijgc.2015070102","pdf_url":null,"source":{"id":"https://openalex.org/S4210190456","display_name":"International Journal of Green Computing","issn_l":"1948-5018","issn":["1948-5018","1948-5026"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Green Computing","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:igg:jgc000:v:6:y:2015:i:2:p:16-29","is_oa":false,"landing_page_url":"http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJGC.2015070102","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.6200000047683716,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1979410709","https://openalex.org/W1987149609","https://openalex.org/W1993444454","https://openalex.org/W2014008637","https://openalex.org/W2046444247","https://openalex.org/W2066582869","https://openalex.org/W2072677099","https://openalex.org/W2092279399","https://openalex.org/W2106170354","https://openalex.org/W2125256745","https://openalex.org/W2125595930","https://openalex.org/W2151303951","https://openalex.org/W2153794195","https://openalex.org/W2154957293","https://openalex.org/W2168780914","https://openalex.org/W2169741605","https://openalex.org/W3018690529"],"related_works":["https://openalex.org/W1977073748","https://openalex.org/W2061699822","https://openalex.org/W2119673702","https://openalex.org/W1923986415","https://openalex.org/W3160281244","https://openalex.org/W2947916359","https://openalex.org/W947546393","https://openalex.org/W2122925822","https://openalex.org/W4220949317","https://openalex.org/W1993229082"],"abstract_inverted_index":{"With":[0,24],"increase":[1,14,39],"in":[2,15,21,57,103,136],"uses":[3],"and":[4,18,54,94,113,146],"users":[5],"of":[6,27,33,52,65,106,144],"the":[7,28,34,50,55,58,71,123,142],"internet,":[8],"there":[9],"has":[10],"been":[11],"an":[12,44],"enormous":[13],"data":[16],"transferred":[17],"power":[19],"consumed":[20],"internet":[22,29,36],"networks.":[23],"increasing":[25],"penetration":[26],"into":[30,48],"developing":[31],"areas":[32],"world,":[35],"traffic":[37],"will":[38],"substantially.":[40],"The":[41],"authors":[42],"propose":[43],"algorithm":[45,82,125,134,140],"which":[46,87],"takes":[47],"consideration":[49],"temperature":[51],"servers":[53],"bottlenecks":[56],"network":[59,89],"by":[60],"modifying":[61],"Linked":[62],"State":[63],"Packets":[64],"OSPF":[66,133],"protocol.":[67],"Using":[68],"these":[69,107],"parameters,":[70],"routing":[72],"table":[73],"is":[74],"updated":[75],"using":[76],"a":[77,110],"modified":[78],"Dijkstra's":[79],"algorithm.":[80],"This":[81],"differs":[83],"from":[84],"previous":[85,121],"algorithms":[86,108],"switch":[88],"components":[90],"such":[91],"as":[92],"links":[93],"routers":[95],"to":[96,131],"sleep":[97],"mode":[98],"or":[99],"reduce":[100],"transfer":[101],"rate":[102],"links.":[104],"Many":[105],"require":[109,128],"centralized":[111],"system":[112],"are":[114],"not":[115,127],"very":[116],"scalable.":[117],"Also,":[118],"unlike":[119],"many":[120],"studies,":[122],"authors'":[124],"does":[126],"much":[129],"modification":[130],"existing":[132],"prevalent":[135],"networking":[137],"today.":[138],"Their":[139],"delineates":[141],"coexistence":[143],"performance":[145],"energy":[147],"conservation.":[148]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}